Simple strategies for large zero-sum games with applications to complexity theory

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 734-740

  Lipton, Richard J ^a   Young, Ncal E ^b  

^a PRINCETON UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; RANDOM PROCESSES; THEOREM PROVING;

CIRCUIT COMPLEXITY; COMPLEXITY THEORY; MIN-MAX THEOREM; MIXED STRATEGY; NEAR-OPTIMAL; NP-COMPLETE LANGUAGE; RANDOM INSTANCE; ZERO-SUM GAME;

GAME THEORY;

COMPLEXITY THEORY; LARGE ZERO SUM GAMES; VON NEUMANN'S MIN MAX THEOREM; ZERO SUM MATRIX GAME;

EID: 0027983376     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195447     Document Type: Conference Paper

References (20)

1. Leonard M. Adleman. Two theorems on random polynomial time. In Proc. of the 19th IEEE Annual Symp. on Foundation of Computer Science, pages 75-83, 1978.
2. Noga Alon, Richard M. Karp, David Peleg, and Douglas West. A graph-Theoretic game and its ap-plication to the fc-server problem. In Lyle McGeoch and Daniel Sleator, editors, On-Line Algorithms: Proceedings of a DIM ACS Workshop, volume 7 of DIM ACS Series in Discrete Mathematics and The-oretical Computer Science, pages 1-9, 1992.
3. Ingo Althofer. On sparse approximations to ran-domized strategies and covex combinations. Linear Algebra and its Applications, 199, March 1994.
4. Shai Ben-David, Benny Chor, Oded Goldreich, and Michael Luby. On the theory of average case com-plexity. Journal of Computer and System Sciences, 44:193-219, 1992.
5. Manuel Blum and S. Kannan. Designing programs that check their work. In Proc. of the 21st Ann. ACM Symp. on Theory of Computing, pages 86-97, 1989.
6. Ashok K. Chandra, Dexter Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
7. Joan Feigenbaum, Daphne Koller, and Peter Shor. Private communication. 1993.
8. Shafi Goldwasser, Silvio Micali, and C. Rackoff. The knowledge complexity of interactive proof sys-Tems. SIAM Journal on Computing, 18(1):186-208, 1989.
9. Y. Gurevich. Complete and incomplete randomized NP problems. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 111-117, 1987.
10. Y. Gurevich. Matrix decomposition problem is complete for the average case. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, pages 802-811, 1990.
11. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Sta-Tistical Journal, pages 13-30, March 1963.
12. Russell Impagliazzo and Leonid Levin. No better ways to generate hard NP instances than picking uniformly at random. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, pages 812-821, 1990.
13. Ming Li and P. M. B. Vitanyi. A theory of learning simple concepts under simple distributions and av-erage case complexity for the universal distribution. In Proc. of the 30th IEEE Annual Symp. on Foun-dation of Computer Science, pages 34-39, 1989.
14. Robert E. Schapire. The strength of weak learn-Ability. Machine Learning, 5:197-227, 1990.
15. Uwe Schoning. Probabilistic complexity classes and lowness. In Proc. of the Second IEEE Structure in Complexity Theory Conference, pages 2-8, 1987.
16. R. Venkatesan and Leonid Levin. Random in-stances of a graph coloring problem are hard. In Proc. of the 20th Ann. ACM Symp. on Theory of Computing, pages 217-222, 1988.
17. John von Neumann. Zur Theorie der Gesellschaft- spiel. Mathematische Annalen, 100(295-320), 1928.
18. Andrew C.C. Yao. Probabilistic complexity: To-wards a unified measure of complexity. In Proc. of the 18th IEEE Annual Symp. on Foundation of Computer Science, pages 222-227, 1977.
19. Andrew C.C. Yao. Lower bounds by probabilis-Tic arguments. In Proc. of the 24th IEEE Annual Symp. on Foundation of Computer Science, pages 420-428, 1983.
20. Neal E. Young. Greedy algorithms by derandomiz- ing unknown distributions. Technical Report T.R. 1087, Cornell University Department of Operations Research and Industrial Engineering, Ithaca, NY 14853, 1994.