{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/100688"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/100688","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A counter-example to Karlin's strong conjecture for fictitious play","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_html":"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_has_math":false,"creators":["Pan, Qinxuan"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Konstantinos Daskalakis."],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-07-22T22:21:22Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/100688","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Konstantinos Daskalakis."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Pan, Qinxuan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-01-04T20:53:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-01-04T20:53:37Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/100688"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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)."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["A counter-example to Karlin's strong conjecture for fictitious play"]}]}],"canonical_facts":{"dc:contributor.advisor":["Konstantinos Daskalakis."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Pan, Qinxuan"],"dc:date.accessioned":["2016-01-04T20:53:37Z"],"dc:date.available":["2016-01-04T20:53:37Z"],"dc:date.issued":["2015"],"dc:description":["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)."],"dc:description.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)."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/100688"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["A counter-example to Karlin's strong conjecture for fictitious play"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:22Z"}