| dc.contributor.author | Pan, Qinxuan | |
| dc.contributor.author | Daskalakis, Konstantinos | |
| dc.date.accessioned | 2015-11-23T13:40:40Z | |
| dc.date.available | 2015-11-23T13:40:40Z | |
| dc.date.issued | 2014-10 | |
| dc.identifier.isbn | 978-1-4799-6517-5 | |
| dc.identifier.issn | 0272-5428 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/99979 | |
| dc.description.abstract | 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]). | en_US |
| dc.description.sponsorship | Alfred P. Sloan Foundation (Fellowship) | en_US |
| dc.description.sponsorship | Microsoft Research (Faculty Fellowship) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CAREER Award CCF-0953960) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Award CCF-1101491) | en_US |
| dc.description.sponsorship | United States. Office of Naval Research (Grant N00014-12-1-0999) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/FOCS.2014.10 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | A Counter-example to Karlin's Strong Conjecture for Fictitious Play | en_US |
| dc.type | Article | en_US |
| dc.identifier.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). | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Daskalakis, Konstantinos | en_US |
| dc.contributor.mitauthor | Pan, Qinxuan | en_US |
| dc.relation.journal | Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Daskalakis, Constantinos; Pan, Qinxuan | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-5451-0490 | |
| dc.identifier.orcid | https://orcid.org/0000-0001-8412-8287 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
