Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Levine, David
  • Fudenberg, Drew

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://dash.harvard.edu/bitstream/handle/1/3203774/fudenberg_efficiency.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Harvard University Department of Economics in its series Scholarly Articles with number 3203774.

as in new window
Length:
Date of creation: 1994
Date of revision:
Publication status: Published in Journal of Economic Theory
Handle: RePEc:hrv:faseco:3203774

Contact details of provider:
Postal: Littauer Center, Cambridge, MA 02138
Phone: 617-495-2144
Fax: 617-495-7730
Web page: http://www.economics.harvard.edu/
More information through EDIRC

Related research

Keywords:

Other versions of this item:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Hansen, Gary D., 1985. "Indivisible labor and the business cycle," Journal of Monetary Economics, Elsevier, vol. 16(3), pages 309-327, November.
  2. Kreps, David M. & Wilson, Robert, 1982. "Reputation and imperfect information," Journal of Economic Theory, Elsevier, vol. 27(2), pages 253-279, August.
  3. Fudenberg, Drew & Maskin, Eric, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, vol. 54(3), pages 533-54, May.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:hrv:faseco:3203774

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Reinhard Engels).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.