A Counter-example to Karlin's Strong Conjecture for Fictitious Play
Author(s)
Pan, Qinxuan; Daskalakis, Konstantinos
DownloadDaskalakis_A counter-example.pdf (128.4Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Fictitious play is a natural dynamic for equilibrium play in zero-sum games, proposed by Brown [6], and shown to converge by Robinson [33]. Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t[superscript -1/2]) with respect to the number of steps t. We disprove this conjecture by showing that, when the payoff matrix of the row player is the n × n identity matrix, fictitious play may converge (for some tie-breaking) at rate as slow as Ω(t[superscript -1/n]).
Date issued
2014-10Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Daskalakis, Constantinos, and Qinxuan Pan. “A Counter-Example to Karlin’s Strong Conjecture for Fictitious Play.” 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (October 2014).
Version: Author's final manuscript
ISBN
978-1-4799-6517-5
ISSN
0272-5428