2026-09-19T21:25:22Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/397162022-01-13T07:54:28Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Abhijit V. Banerjee and Muhamet Yildiz.
Chassang, Sylvain Guillaume
Massachusetts Institute of Technology. Dept. of Economics.
Massachusetts Institute of Technology. Department of Economics
2007-12-07T16:11:51Z
2007-12-07T16:11:51Z
2007
http://hdl.handle.net/1721.1/39716
179924484
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Economics, 2007.
"June 2007."
Includes bibliographical references.
This thesis is a collection of essays on coordination and learning in dynamic cooperation games. Chapter One begins by establishing results which are required in order to extend the global games approach to settings where the game structure is endogenous. In particular it shows that the selection argument of Carlsson and van Damme (1993) holds uniformly over appropriately controlled families of games. It also discusses selection results when the game lacks dominance regions. Chapter Two uses these results to investigate the impact of miscoordination fear in a class of dynamic cooperation games with exit. More specifically, it explores the effect of small amounts of private information on a class of dynamic cooperation games with exit. It is shown that lack of common knowledge creates a fear of miscoordination which pushes players away from the full-information Pareto frontier. Unlike in one-shot two-by-two games, the global games information structure does not yield equilibrium uniqueness, however, by making it harder to coordinate, it does reduce the range of equilibria and gives bite to the notion of local dominance solvability.
(cont.) Finally, Chapter Two provides a simple criterion for the robustness of cooperation to miscoordination fear, and shows it can yield predictions that are qualitatively different from those obtained by focusing on Pareto efficient equilibria under full information. Finally Chapter Three studies how economic agents learn to cooperate when the details of what cooperation means are ambiguous. It considers a dynamic game in which one player's cost for the cooperative action is private information. From the perspective of the other player, this cost is an unknown but stationary function of observable states of the world. Initially, because of information asymmetries, full cooperation can be sustained only at the cost of inefficient punishment. As players gain common experience, however, the uninformed player may learn how to predict her partner's cost, thereby resolving informational asymmetries. Once learning has occurred, players can sustain cooperation more efficiently and reduce the partnership's sensitivity to adverse economic conditions. Nevertheless, because inducing information revelation has an efficiency cost, it may sometimes be optimal for the uninformed player to remain uninformed even though that limits the amount of cooperation that can be sustained in equilibrium.
by Sylvain Guillaume Chassang.
Ph.D.
149 p.
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
Economics.
Essays on coordination, cooperation, and learning
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3dc4f81f-1ee3-4930-b5d8-5d9c9c133b99">
<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>Essays on coordination, cooperation, and learning</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Chassang, Sylvain Guillaume</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>Economics.</Keyword>
<Abstract>This thesis is a collection of essays on coordination and learning in dynamic cooperation games. Chapter One begins by establishing results which are required in order to extend the global games approach to settings where the game structure is endogenous. In particular it shows that the selection argument of Carlsson and van Damme (1993) holds uniformly over appropriately controlled families of games. It also discusses selection results when the game lacks dominance regions. Chapter Two uses these results to investigate the impact of miscoordination fear in a class of dynamic cooperation games with exit. More specifically, it explores the effect of small amounts of private information on a class of dynamic cooperation games with exit. It is shown that lack of common knowledge creates a fear of miscoordination which pushes players away from the full-information Pareto frontier. Unlike in one-shot two-by-two games, the global games information structure does not yield equilibrium uniqueness, however, by making it harder to coordinate, it does reduce the range of equilibria and gives bite to the notion of local dominance solvability.</Abstract>
<Abstract>(cont.) Finally, Chapter Two provides a simple criterion for the robustness of cooperation to miscoordination fear, and shows it can yield predictions that are qualitatively different from those obtained by focusing on Pareto efficient equilibria under full information. Finally Chapter Three studies how economic agents learn to cooperate when the details of what cooperation means are ambiguous. It considers a dynamic game in which one player's cost for the cooperative action is private information. From the perspective of the other player, this cost is an unknown but stationary function of observable states of the world. Initially, because of information asymmetries, full cooperation can be sustained only at the cost of inefficient punishment. As players gain common experience, however, the uninformed player may learn how to predict her partner's cost, thereby resolving informational asymmetries. Once learning has occurred, players can sustain cooperation more efficiently and reduce the partnership's sensitivity to adverse economic conditions. Nevertheless, because inducing information revelation has an efficiency cost, it may sometimes be optimal for the uninformed player to remain uninformed even though that limits the amount of cooperation that can be sustained in equilibrium.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>