2026-09-18T20:29:49Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1006882026-06-06T00:49:40Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Konstantinos Daskalakis.
Pan, Qinxuan
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-01-04T20:53:37Z
2016-01-04T20:53:37Z
2015
2015
http://hdl.handle.net/1721.1/100688
933249721
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 23-26).
Fictitious play is a natural dynamic for equilibrium play in zero-sum games, proposed by Brown , and shown to converge by Robinson . Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t- 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 x n identity matrix, fictitious play may converge (for some tie-breaking) at rate as slow as [Omega](t- 1/n).
by Qinxuan Pan.
M.Eng.
29 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
A counter-example to Karlin's strong conjecture for fictitious play
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="590204c1-3f23-4539-8a1a-17478a5aecb8">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A counter-example to Karlin's strong conjecture for fictitious play</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Pan, Qinxuan</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Fictitious play is a natural dynamic for equilibrium play in zero-sum games, proposed by Brown , and shown to converge by Robinson . Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t- 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 x n identity matrix, fictitious play may converge (for some tie-breaking) at rate as slow as [Omega](t- 1/n).</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>