A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games

2012
*
2012 IEEE 27th Conference on Computational Complexity
*

This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weights update method. Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other. This algorithm considerably extends the class of games which admit parallel solutions, demonstrating for the

doi:10.1109/ccc.2012.12
dblp:conf/coco/GutoskiW12
fatcat:cnomniipjffrjatt32qllqvm6a