<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T16:20:38Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/81037" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/81037</identifier><datestamp>2022-01-13T07:54:00Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131022</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Robert Gibbons and Juuso Toikka.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Barron, Daniel (Daniel Vincent)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Department of Economics.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Economics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-09-24T19:38:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-09-24T19:38:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2013</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2013</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/81037</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">857791257</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Economics, 2013.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 143-149).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This dissertation explores cooperation when formal contracts and legal institutions are imperfect. The first chapter (co-authored with Isaiah Andrews) considers how a principal allocates business among a group of agents to motivate them in the context of a repeated game with imperfect private monitoring. If players are impatient, the optimal relational contract dynamically allocates future business among agents depending on past performance. An optimal allocation rule favors an agent who performs well, even if he later performs poorly. An agent loses favor only if he is unable to produce and his replacement performs well. The principal may allows some relationships to deteriorate into persistent shirking in order to better motivate other agents. We find conditions under which the principal either does or does not benefit by concealing information from the agents. The second chapter proves that approximately Pareto efficient outcomes can be sustained in a broad class of games with imperfect public monitoring and Markov adverse selection when players are patient. Consider a game in which one player's utility evolves according to an irreducible Markov process and actions are imperfectly observed. Then any payoff in the interior of the convex hull of all Pareto efficient and min-max payoffs can be approximated by an equilibrium payoff for sufficiently patient players. The proof of this result is partially constructive and uses an intuitive "quota mechanism" to ensure approximate truth-felling. Under stronger assumptions, the result partially extends to games where one player's private type determines every player's utility. The final chapter explores how firms might invest to facilitate their relationships with one another. Consider a downstream firm who uses relational contracts to motivate multiple suppliers. In an applied model with imperfect private monitoring, this chapter shows that the suppliers might "put the relationship first:" they invest to flexibly produce many of the products required by the downstream firm, rather than cutting costs by specializing. A downstream firm that relies on relational contracts tends to source from fewer suppliers, each of whom can inefficiently manufacture many different products required by that firm.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Daniel Barron.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">149 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Economics.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Essays in cooperation and repeated games</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="c0e03926-fc96-4e94-bca7-065b5bd3abc7">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Essays in cooperation and repeated games&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2013&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Barron, Daniel (Daniel Vincent)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Economics.&lt;/Keyword>
   	&lt;Abstract>This dissertation explores cooperation when formal contracts and legal institutions are imperfect. The first chapter (co-authored with Isaiah Andrews) considers how a principal allocates business among a group of agents to motivate them in the context of a repeated game with imperfect private monitoring. If players are impatient, the optimal relational contract dynamically allocates future business among agents depending on past performance. An optimal allocation rule favors an agent who performs well, even if he later performs poorly. An agent loses favor only if he is unable to produce and his replacement performs well. The principal may allows some relationships to deteriorate into persistent shirking in order to better motivate other agents. We find conditions under which the principal either does or does not benefit by concealing information from the agents. The second chapter proves that approximately Pareto efficient outcomes can be sustained in a broad class of games with imperfect public monitoring and Markov adverse selection when players are patient. Consider a game in which one player&amp;apos;s utility evolves according to an irreducible Markov process and actions are imperfectly observed. Then any payoff in the interior of the convex hull of all Pareto efficient and min-max payoffs can be approximated by an equilibrium payoff for sufficiently patient players. The proof of this result is partially constructive and uses an intuitive &amp;quot;quota mechanism&amp;quot; to ensure approximate truth-felling. Under stronger assumptions, the result partially extends to games where one player&amp;apos;s private type determines every player&amp;apos;s utility. The final chapter explores how firms might invest to facilitate their relationships with one another. Consider a downstream firm who uses relational contracts to motivate multiple suppliers. In an applied model with imperfect private monitoring, this chapter shows that the suppliers might &amp;quot;put the relationship first:&amp;quot; they invest to flexibly produce many of the products required by the downstream firm, rather than cutting costs by specializing. A downstream firm that relies on relational contracts tends to source from fewer suppliers, each of whom can inefficiently manufacture many different products required by that firm.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>