{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:28:35Z","timestamp":1709828915045},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00182-012-0362-6","type":"journal-article","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T05:24:28Z","timestamp":1354512268000},"page":"1059-1083","source":"Crossref","is-referenced-by-count":4,"title":["On the approximation performance of fictitious play in finite games"],"prefix":"10.1007","volume":"42","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,4]]},"reference":[{"key":"362_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jet.2004.02.003","volume":"120","author":"U Berger","year":"2005","unstructured":"Berger U (2005) Fictitious play in $$2 \\times n$$ games. J Econ Theory 120:139\u2013154","journal-title":"J Econ Theory"},{"key":"362_CR2","doi-asserted-by":"crossref","unstructured":"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\u201329","DOI":"10.1007\/978-3-540-77105-0_6"},{"key":"362_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013113","DOI":"10.1007\/978-3-642-16170-4_10"},{"key":"362_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Deng X, Teng S-H (2009) Settling the complexity of computing two-player Nash equilibria. J ACM 56(3):1\u201357","DOI":"10.1145\/1516512.1516516"},{"key":"362_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer V (2009) Approximation guarantees for fictitious play. In: Proceedings of the 47th annual Allerton conference on communication, control, and computing, pp 636\u2013643","DOI":"10.1109\/ALLERTON.2009.5394918"},{"key":"362_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013358","DOI":"10.1145\/1250910.1250962"},{"key":"362_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis C, Mehta A, Papadimitriou CH (2009a) A note on approximate Nash equilibria. Theor Comput Sci 410(17):1581\u20131588","DOI":"10.1016\/j.tcs.2008.12.031"},{"key":"362_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis C, Goldberg PW, Papadimitriou CH (2009b) The complexity of computing a Nash equilibrium. SIAM J Comput 39(1):195\u2013259","DOI":"10.1137\/070699652"},{"key":"362_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013125","DOI":"10.1007\/978-3-642-16170-4_11"},{"key":"362_CR10","unstructured":"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\u2013380"},{"key":"362_CR11","doi-asserted-by":"crossref","unstructured":"Fearnley J, Goldberg PW, Savani R, S\u00f8rensen 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)","DOI":"10.1007\/978-3-642-33996-7_10"},{"key":"362_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013354","DOI":"10.1145\/1250910.1250961"},{"key":"362_CR13","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1006\/game.1993.1021","volume":"5","author":"D Fudenberg","year":"1993","unstructured":"Fudenberg D, Kreps DM (1993) Learning mixed equilibria. Games Econ Behav 5:320\u2013367","journal-title":"Games Econ Behav"},{"issue":"5\u20137","key":"362_CR14","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/0165-1889(94)00819-4","volume":"19","author":"D Fudenberg","year":"1995","unstructured":"Fudenberg D, Levine DK (1995) Consistency and cautious fictitious play. J Econ Dyn Control 19(5\u20137):1065\u20131089","journal-title":"J Econ Dyn Control"},{"key":"362_CR15","volume-title":"The theory of learning in games","author":"D Fudenberg","year":"1998","unstructured":"Fudenberg D, Levine DK (1998) The theory of learning in games. MIT Press, Cambridge, MA"},{"key":"362_CR16","unstructured":"Ganzfried S, Sandholm T (2008) Computing an approximate jam\/fold equilibrium for 3-player no-limit Texas Hold\u2019em tournaments. In: Proceedings of the 7th international joint conference on autonomous agents and multi-agent systems (AAMAS), pp 919\u2013925"},{"issue":"5","key":"362_CR17","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1257\/000282803322655581","volume":"93","author":"S Hart","year":"2003","unstructured":"Hart S, Mas-Colell A (2003) Uncoupled dynamics do not lead to Nash equilibrium. Am Econ Rev 93(5):1830\u20131836","journal-title":"Am Econ Rev"},{"issue":"2","key":"362_CR18","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.geb.2005.09.007","volume":"57","author":"S Hart","year":"2006","unstructured":"Hart S, Mas-Colell A (2006) Stochastic uncoupled dynamics and Nash equilibrium. Games Econ Behav 57(2):286\u2013303","journal-title":"Games Econ Behav"},{"issue":"4","key":"362_CR19","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s00453-008-9227-6","volume":"57","author":"S Kontogiannis","year":"2010","unstructured":"Kontogiannis S, Spirakis PG (2010) Well supported approximate equilibria in bimatrix games. Algorithmica 57(4):653\u2013667","journal-title":"Algorithmica"},{"issue":"3","key":"362_CR20","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/opre.1040.0178","volume":"53","author":"TJ Lambert","year":"2005","unstructured":"Lambert TJ, Epelman MA, Smith RL (2005) A fictitious play approach to large-scale optimization. Oper Res 53(3):477\u2013489","journal-title":"Oper Res"},{"key":"362_CR21","unstructured":"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)"},{"key":"362_CR22","unstructured":"Miyasawa K (1961) On the convergence of the learning process in a 2 $$\\times $$ 2 nonzero sum two-person game. Research Memo 33. Princeton University, Princeton"},{"issue":"1","key":"362_CR23","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124\u2013143","journal-title":"Games Econ Behav"},{"issue":"2","key":"362_CR24","doi-asserted-by":"crossref","first-page":"296","DOI":"10.2307\/1969530","volume":"54","author":"J Robinson","year":"1951","unstructured":"Robinson J (1951) An iterative method of solving a game. Ann Math 54(2):296\u2013301","journal-title":"Ann Math"},{"key":"362_CR25","doi-asserted-by":"crossref","unstructured":"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\u201329","DOI":"10.1515\/9781400882014-002"},{"issue":"4","key":"362_CR26","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/15427951.2008.10129172","volume":"5","author":"H Tsaknakis","year":"2008","unstructured":"Tsaknakis H, Spirakis Paul G (2008) An optimization approach for approximate Nash equilibria. Internet Math 5(4):365\u2013382","journal-title":"Internet Math"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-012-0362-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-012-0362-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-012-0362-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T07:26:18Z","timestamp":1562397978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-012-0362-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,4]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s00182-012-0362-6","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,4]]}}}