A Uniform Min-Max Theorem with Applications in Cryptography

The authors present a new, more constructive proof of von neumann's min-max theorem for two-player zero-sum game - specifically, an algorithm that builds a near-optimal mixed strategy for the second player from several best-responses of the second player to mixed strategies of the first player. The algorithm extends previous paper of the researchers (Games and Economic Behavior '99) with the advantage that the algorithm runs in poly(n) time even when a pure strategy for the first player is a distribution chosen from a set of distributions over {0; 1} n.

Provided by: Harvard University Topic: Security Date Added: Jul 2013 Format: PDF

Find By Topic