Parallel Approximation of Min-Max Problems

被引：0
|
作者：
Gus Gutoski
Xiaodi Wu
机构：
[1] University of Waterloo,Institute for Quantum Computing, School of Computer Science
[2] University of Michigan,Department of Electrical Engineering and Computer Science
来源：
computational complexity | 2013年 / 22卷
关键词：
Parallel approximation algorithm; semidefinite programming; zero-sum games; quantum interactive proofs with competing provers; 68Q05; 68Q10; 68Q12; 68Q15; 68W25; 68W10; 90C22; 90C47;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for competitive two-party classical or quantum interactions in which a referee exchanges any number of messages with one party followed by any number of additional messages with the other. It considerably extends the class of interactions which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for an interaction in which one party reacts adaptively to the other.
引用
收藏
页码：385 / 428
页数：43
相关论文
共 50 条
  • [21] Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
    Yu, Wei
    Liu, Zhaohui
    [J]. COMPUTING AND COMBINATORICS, 2015, 9198 : 147 - 158
  • [22] Approximation Results for Min-Max Path Cover Problems in Vehicle Routing
    Xu, Zhou
    Xu, Liang
    Li, Chung-Lun
    [J]. NAVAL RESEARCH LOGISTICS, 2010, 57 (08) : 728 - 748
  • [23] Min-Max quickest path problems
    Ruzika, Stefan
    Thiemann, Markus
    [J]. NETWORKS, 2012, 60 (04) : 253 - 258
  • [24] ON MIN-MAX INTEGER ALLOCATION PROBLEMS
    ICHIMORI, T
    [J]. OPERATIONS RESEARCH, 1984, 32 (02) : 449 - 450
  • [25] Min-max controllable risk problems
    Evgeny Gurevsky
    Sergey Kovalev
    Mikhail Y. Kovalyov
    [J]. 4OR, 2021, 19 : 93 - 101
  • [26] Min-max controllable risk problems
    Gurevsky, Evgeny
    Kovalev, Sergey
    Kovalyov, Mikhail Y.
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2021, 19 (01): : 93 - 101
  • [27] Complexity of min-max subsequence problems
    Michiels, W
    Korst, J
    [J]. INFORMATION PROCESSING LETTERS, 2003, 87 (04) : 213 - 217
  • [28] Approximation hardness of min-max tree covers
    Xu, Zhou
    Wen, Qi
    [J]. OPERATIONS RESEARCH LETTERS, 2010, 38 (03) : 169 - 173
  • [29] GAME TREE SEARCHING BY MIN-MAX APPROXIMATION
    RIVEST, RL
    [J]. ARTIFICIAL INTELLIGENCE, 1987, 34 (01) : 77 - 96
  • [30] Approximation algorithms for min-max tree partition
    GuttmannBeck, N
    Hassin, R
    [J]. JOURNAL OF ALGORITHMS, 1997, 24 (02) : 266 - 286
12345