First-order algorithm with ο(ln(1/∈)) convergence for ∈-equilibrium in two-person zero-sum games

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 75-82

  Gilpin, Andrew ^a   Javier Pena ^b   Sandholm, Tuomas ^a  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

COMPLEXITY BOUNDS; COMPUTATIONAL EXPERIMENTS; FIRST ORDERS; INNER LOOPS; MATRIX GAMES; MEMORY REQUIREMENTS; MIN MAXES; OUTER LOOPS; SIMPLE MODIFICATIONS; SMALL MEMORY REQUIREMENTS; SPEED IMPROVEMENTS; TWO-PERSON ZERO-SUM GAMES;

GAME THEORY;

EID: 57749182400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bienstock, D. 2002. Potential Function Methods for Approximately Solving Linear Programming Problems. Dordrecht: Kluwer International Series.
2. Gilpin, A.; Hoda, S.; Peña, J.; and Sandholm, T. 2007. Gradient-based algorithms for finding Nash equilibria in extensive form games. In 3rd International Workshop on Internet and Network Economics (WINE).
3. Gilpin, A.; Sandholm, T.; and Sørensen, T. B. 2007. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 50-57. Vancouver, Canada: AAAI Press.
4. Goffin, J.-L. 1977. On the convergence rate of subgradient optimization methods. Mathematical Programming 13:329-347.
5. Hirriart-Urruty, J., and Lemaréchal, C. 2001. Fundamentals of Convex Analysis. Berlin: Springer-Verlag.
6. Koller, D., and Megiddo, N. 1992. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4(4):528-552.
7. Lan, G.; Lu, Z.; and Monteiro, R. D. C. 2006. Primal-dual first-order methods with O(1/∈) iteration-complexity for cone programming. Manuscript.
8. McMahan, H. B., and Gordon, G. J. 2007. A fast bundle-based anytime algorithm for poker and other convex games. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS).
9. 2).
10. Doklady AN SSSR 269:543-547. Translated to English as Soviet Math. Docl.
11. Nesterov, Y. 2005a. Excessive gap technique in nonsmooth convex minimization. SIAM Journal of Optimization 16(1):235-249.
12. Nesterov, Y. 2005b. Smooth minimization of non-smooth functions. Mathematical Programming 103:127-152.
13. Osborne, M., and Rubinstein, A. 1994. A Course in Game Theory. Cambridge, MA: MIT Press.
14. Romanovskii, I. 1962. Reduction of a game with complete memory to a matrix game. Soviet Mathematics 3:678-681.
15. Shi, J., and Littman, M. 2002. Abstraction methods for game theoretic poker. In CG '00: Revised Papers from the Second International Conference on Computers and Games, 333-345. London, UK: Springer-Verlag.
16. Smola, A. J.; Vishwanathan, S. V. N.; and Le, Q. 2007. Bundle methods for machine learning. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS).
17. von Stengel, B. 1996. Efficient computation of behavior strategies. Games and Economic Behavior 14(2):220-246.
18. Wright, S. J. 1997. Primal-Dual Interior-Point Methods. Philadelphia, PA: SIAM.
19. Zinkevich, M.; Bowling, M.; Johanson, M.; and Piccione, C. 2007. Regret minimization in games with incomplete information. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS).
20. Zinkevich, M.; Bowling, M.; and Burch, N. 2007. A new algorithm for generating equilibria in massive zero-sum games. In Proceedings of the National Conference on Artificial Intelligence (AAAI).