Algorithms for playing games with limited randomness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 323-334

  Kalyanaraman, Shankar ^a   Umans, Christopher ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; POLYNOMIALS; USER INTERFACES;

DETERMINISTIC ALGORITHM; PLAYING GAMES; SIMILAR SETTING KANNAN;

ONLINE SYSTEMS;

EID: 38049050347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_30     Document Type: Conference Paper

References (22)

1. Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3, 289-304 (1992)
2. Chen, X., Deng, X.: 3-NASH is PPAD-complete. Electronic Colloquium on Computational Complexity (ECCC) (134) (2005)
3. Chen, X., Deng, X.: Settling the Complexity of Two-Player Nash Equilibrium. In: Foundations of Computer Science (FOCS 2006), pp. 261-272. IEEE Computer Society Press, Los Alamitos (2006)
4. Chen, X., Deng, X., Teng, S.-H.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: Foundations of Computer Science (FOCS 2006), pp. 603-612. IEEE Computer Society Press, Los Alamitos (2006)
5. Cesati, M.: Compendium of parameterized problems (2005), http://bravo.ce.uniroma2.it/home/cesati/research/compendium/
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
7. Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Proceedings of the First DIMATIA Symposium (1997)
8. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Symposium on Theory of Computing (STOC 2006), pp. 71-78 (2006)
9. Daskalakis, C., Papadimitriou, C.H.: Three-player games are hard. Electronic Colloquium on Computational Complexity (ECCC) (139) (2005)
10. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure-strategy equilibria. In: Symposium on Theory of Computing (STOC 2004), pp. 604-612 (2004)
11. Freund, Y., Schapire, R.: Game theory, on-line prediction and boosting. In: COLT 1996, pp. 325-332 (1996)
12. Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games and Economic Behavior 29, 79-103 (1999)
13. Gillman, D.: A Chernoff bound for random walks on expander graphs. In: Foundations of Computer Science (FOCS 1993), pp. 680-691. IEEE, Los Alamitos (1993)
14. Goldberg, P.W., Papadimitriou, C.H.: Reducibility among equilibrium problems. In: Symposium on Theory of Computing (STOC 2006), pp. 61-70 (2006)
15. Kannan, R., Theobald, T.: Games of fixed rank: A hierarchy of bimatrix games. In: ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (2007)
16. Kalyanaraman, S., Umans, C.: Algorithms for playing games with limited randomness (2007), http://www.cs.caltech.edu/~shankar/pubs/ku07-apglr.pdf
17. Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: EC '03: Proceedings of the 4th ACM conference on Electronic commerce, pp. 36-41. ACM Press, New York, NY, USA (2003)
18. Lipton, R.J., Young, N.E.: Simple strategies for large zero-sum games with applications to complexity theory. In: STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pp. 734-740. ACM Press, New York, USA (1994)
19. Morgenstern, O., von Neumann, J.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)
20. Nash, J.F.: Non-cooperative games. Annals of Mathematics 54, 286-295 (1951)
21. Papadimitriou, C.H.: Computing Correlated Equilibria in Multi-Player Games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 49-56 (May 2005)
22. Vavasis, S.A.: Approximation algorithms for indefinite quadratic programming. Math. Program. 57, 279-311 (1992)