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 条
12345