On the approximation performance of fictitious play in finite games

International Journal of Game Theory

Volumn 42, Issue 4, 2013, Pages 1059-1083

  Goldberg, Paul W ^a   Savani, Rahul ^a   Sørensen, Troels Bjerre ^b   Ventre, Carmine ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

Approximate Nash equilibria; Decentralized dynamics; Fictitious play

Indexed keywords

EID: 84885921711     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00182-012-0362-6     Document Type: Article

References (26)

1. Berger U (2005) Fictitious play in 2 × n games. J Econ Theory 120: 139-154.
2. Bosse H, Byrka J, Markakis E (2007) New algorithms for approximate Nash equilibria in bimatrix games. In: Proceedings of the 3rd international workshop on internet and network economics (WINE), pp 17-29.
3. Brandt F, Fischer F. Harrenstein P (2010) On the rate of convergence of fictitious play. In: Proceedings of the 3rd symposium on algorithmic game theory (SAGT), pp 102-113.
4. Chen X, Deng X, Teng S-H (2009) Settling the complexity of computing two-player Nash equilibria. J ACM 56(3): 1-57.
5. Conitzer V (2009) Approximation guarantees for fictitious play. In: Proceedings of the 47th annual Allerton conference on communication, control, and computing, pp 636-643.
6. Daskalakis C, Mehta A, Papadimitriou CH (2007) Progress in approximate Nash equilibria. In: Proceedings of the 8th ACM conference on electronic commerce (EC), pp 355-358.
7. Daskalakis C, Mehta A, Papadimitriou CH (2009a) A note on approximate Nash equilibria. Theor Comput Sci 410(17): 1581-1588.
8. Daskalakis C, Goldberg PW, Papadimitriou CH (2009b) The complexity of computing a Nash equilibrium. SIAM J Comput 39(1): 195-259.
9. Daskalakis C, Frongillo R, Papadimitriou CH, Pierrakos G, Valiant G (2010) On learning algorithms for Nash equilibria. In Proceedings of the 3rd symposium on algorithmic game theory (SAGT), pp 114-125.
10. Dudziak W (2006) Using fictitious play to find pseudo-optimal solutions for full-scale poker. In: Proceedings of the 2006 international conference on artificial intelligence (ICAI), pp 374-380.
11. Fearnley J, Goldberg PW, Savani R, Sørensen TB (2012) Approximate well-supported Nash equilibria below two-thirds. arXiv tech report 1204. 0707. In: Proceedings of the 5th symposium on algorithmic game theory (SAGT).
12. Feder T, Nazerzadeh H, Saberi A (2007) Approximating Nash equilibria using small-support strategies. In Proceedings of the 8th ACM conference on electronic commerce (EC), pp 352-354.
13. Fudenberg D, Kreps DM (1993) Learning mixed equilibria. Games Econ Behav 5: 320-367.
14. Fudenberg D, Levine DK (1995) Consistency and cautious fictitious play. J Econ Dyn Control 19(5-7): 1065-1089.
15. Fudenberg D, Levine DK (1998) The theory of learning in games. MIT Press, Cambridge, MA.
16. Ganzfried S, Sandholm T (2008) Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments. In: Proceedings of the 7th international joint conference on autonomous agents and multi-agent systems (AAMAS), pp 919-925.
17. Hart S, Mas-Colell A (2003) Uncoupled dynamics do not lead to Nash equilibrium. Am Econ Rev 93(5): 1830-1836.
18. Hart S, Mas-Colell A (2006) Stochastic uncoupled dynamics and Nash equilibrium. Games Econ Behav 57(2): 286-303.
19. Kontogiannis S, Spirakis PG (2010) Well supported approximate equilibria in bimatrix games. Algorithmica 57(4): 653-667.
20. Lambert TJ, Epelman MA, Smith RL (2005) A fictitious play approach to large-scale optimization. Oper Res 53(3): 477-489.
21. McMahan HB, Gordon GJ (2007) A fast bundle-based anytime algorithm for poker and other convex games. In: Proceedings of the eleventh international conference on artificial intelligence and statistics (AISTATS).
22. Miyasawa K (1961) On the convergence of the learning process in a 2 × 2 nonzero sum two-person game. Research Memo 33. Princeton University, Princeton.
23. Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1): 124-143.
24. Robinson J (1951) An iterative method of solving a game. Ann Math 54(2): 296-301.
25. Shapley L (1964) Some topics in two-person games. In: Dresher M, Shapley LS, Tucker AW (eds) Advances in game theory, vol 52. Annals of Mathematics Studies. Princeton University Press, Princeton, pp 1-29.
26. Tsaknakis H, Spirakis Paul G (2008) An optimization approach for approximate Nash equilibria. Internet Math 5(4): 365-382.