EconPapers    
Economics at your fingertips  
 

Efficiency and Observability with Long-Run and Short-Run Players

David Levine and Drew Fudenberg

Scholarly Articles from Harvard University Department of Economics

Abstract: We present a general algorithm for computing the limit, as δ → 1, of the set of payoffs of perfect public equilibria of repeated games with long-run and short-run players, allowing for the possibility that the players′ actions are not observable by their opponents. We illustrate the algorithm with two economic examples. In a simple partnership we show how to compute the equilibrium payoffs when the folk theorem fails. In an investment game, we show that two competing capitalists subject to moral hazard may both become worse off if their firms are merged and they split the profits from the merger. Finally, we show that with short-run players each long-run player′s highest equilibrium payoff is generally greater when their realized actions are observed.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (96)

Published in Journal of Economic Theory

Downloads: (external link)
http://dash.harvard.edu/bitstream/handle/1/3203774/fudenberg_efficiency.pdf (application/pdf)

Related works:
Working Paper: Efficiency and Observability with Long-Run and Short-Run Players (1999) Downloads
Journal Article: Efficiency and Observability with Long-Run and Short-Run Players (1994) Downloads
Working Paper: Efficiency and Observability with Long-Run and Short-Run Players (1994) Downloads
Working Paper: Efficiency and Obsevability with Long-Run and Short-Run Players (1991)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hrv:faseco:3203774

Access Statistics for this paper

More papers in Scholarly Articles from Harvard University Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Office for Scholarly Communication ().

 
Page updated 2025-03-19
Handle: RePEc:hrv:faseco:3203774