On the Complexity of Repeated Principal Agent Games

Inkoo Cho

Economic Theory, 1996, vol. 7, issue 1, 17 pages

Abstract: We examine an infinitely repeated principal agent game without discounting (Radner [1985]), in which the agent may engage in multiple projects. We focus on "linear" strategies that summarize each history into a linear function of public outcomes, and select an action according to a single threshold rule. We claim that linear strategies significantly simplify the computation needed to make strategic decisions following each history. Despite the simplicity of linear strategies, we can virtually recover the folk theorem. For any individually rational payoff vector in the interior in the set of feasible expected payoff vectors, there exists a pair of linear strategies that form a Nash equilibrium supporting the target payoff. The equilibrium strategies and the equilibrium payoff vectors form a globally stable solution (Smale [1980]).

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: On the complexity of repeated principal agent games (1995)
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:spr:joecth:v:7:y:1996:i:1:p:1-17

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().