Smoothing Techniques for Computing Nash Equilibria of Sequential Games

References

• Billings D., Peña L., Schaeffer J., Szafron D. The challenge of poker. Artificial Intelligence (2002) 134(1–2, Special Issue on Games, Computers and Artificial Intelligence):201–240Crossref, Google Scholar
• Billings D., Burch N., Davidson A., Holte R., Schaeffer J., Schauenberg T., Szafron D. Approximating game-theoretic optimal strategies for full-scale poker. Proc. 18th Internat. Joint Conf. Artificial Intelligence (IJCAI) (2003) Acapulco, MexicoGoogle Scholar
• Gilpin A. Algorithms for abstracting and solving imperfect information games. (2009) . Doctoral dissertation, Computer Science Department, Carnegie Mellon University, PittsburghGoogle Scholar
• Gilpin A., Sandholm T. A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation. Proc. National Conf. Artificial Intelligence (AAAI) (2006) BostonGoogle Scholar
• Gilpin A., Sandholm T. Lossless abstraction method for sequential games of imperfect information. J. ACM (2007) 54(5). Article 25Crossref, Google Scholar
• Gilpin A., Sandholm T., Sørensen T. B. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker. Proc. National Conf. Artificial Intelligence (AAAI) (2007) VancouverGoogle Scholar
• Gilpin A., Sandholm T., Sørensen T. B. A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs. Internat. Conf. Autonomous Agents and Multi-Agent Systems (AAMAS) (2008) Estoril, PortugalGoogle Scholar
• Goffin J.-L. On the convergence rate of subgradient optimization methods. Math. Programming (1977) 13(1):329–347Crossref, Google Scholar
• Hirriart-Urruty J., Lemaréchal C.Fundamentals of Convex Analysis (2001) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Juditsky A., Lan G., Nemirovski A., Shapiro A. Stochastic approximation approach to stochastic programming. SIAM J. Optim. (2009) 19(4):1574–1609Crossref, Google Scholar
• Koller D., Megiddo N., von Stengel B. Efficient computation of equilibria for extensive two-person games. Games Econom. Behavior (1996) 14(2):247–259Crossref, Google Scholar
• Lan G., Lu Z., Monteiro R. Primal-dual first-order methods with O(1/ε) iteration-complexity for cone programming. Math. Programming. (2010) . ForthcomingGoogle Scholar
• Nemirovski A. Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz-continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. (2004) 15(1):229–251Crossref, Google Scholar
• Nesterov Y. A method for unconstrained convex minimization problem with rate of convergence O(1/k2). Doklady AN SSSR (In Russian) (1983) 269:543–547Soviet Math. Dokl. (English translation)Google Scholar
• Nesterov Y. Introductory lectures on convex optimization: A basic course. Applied Optimization (2004) (Kluwer Academic Publishers, Boston) Google Scholar
• Nesterov Y. Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. (2005) 16(1):235–249Crossref, Google Scholar
• Nesterov Y. Smooth minimization of non-smooth functions. Math. Programming (2005) 103(1):127–152Crossref, Google Scholar
• Osborne M., Rubinstein A.A Course in Game Theory (1994) (MIT Press, Cambridge, MA) Google Scholar
• Romanovskii I. Reduction of a game with complete memory to a matrix game. Soviet Math. (1962) 3:678–681Google Scholar
• Shi J., Littman M. Abstraction methods for game-theoretic poker. Computers and Games (2001) (Springer-Verlag, Berlin) 333–345Crossref, Google Scholar
• von Stengel B. Efficient computation of behavior strategies. Games and Econom. Behavior (1996) 14:220–246Crossref, Google Scholar
• von Stengel B., Nisan N., Roughgarden T., Tardos E., Vazirani V. V. Equilibrium computation for games in strategic and extensive form. Algorithmic Game Theory (2007) (Cambridge University Press, Cambridge, UK) 53–78Crossref, Google Scholar
• Zinkevich M., Bowling M., Johanson M., Piccione C. Regret minimization in games with incomplete information. Annual Conf. Neural Inform. Processing Systems (NIPS) (2007) VancouverGoogle Scholar