Achievable outcomes of dynamic contribution games
This paper concerns multistage games, with and without discounting, in which each player can increase the level of an action over time so as to increase the other players' future payoffs. An action profile is said to be achievable if it is the limit point of a subgame perfect equilibrium path. Necessary conditions are derived for achievability under relatively general conditions. They imply that any efficient profile that is approximately achievable must be in the core of the underlying coalitional game. In some but not all games with discounting, the necessary conditions for achievability are also sufficient for a profile to be the limit of achievable profiles as the period length shrinks to zero. Consequently, in these games when the period length is very short, (i) the set of achievable profiles does not depend on the move structure; (ii) an efficient profile can be approximately achieved if and only if it is in the core; and (iii) any achievable profile can be achieved almost instantly.
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.:
- Lise Vesterlund & John Duffy & Jack Ochs, 2004.
"Giving Little by Little: Dynamic Voluntary Contribution Games,"
Econometric Society 2004 North American Winter Meetings
402, Econometric Society.
- Duffy, John & Ochs, Jack & Vesterlund, Lise, 2007. "Giving little by little: Dynamic voluntary contribution games," Journal of Public Economics, Elsevier, vol. 91(9), pages 1708-1730, September.
- Ochs, Jack & Park, In-Uck, 2004.
"Overcoming the Coordination Problem: Dynamic Formation of Networks,"
CEI Working Paper Series
2004-18, Center for Economic Institutions, Institute of Economic Research, Hitotsubashi University.
- Ochs, Jack & Park, In-Uck, 2010. "Overcoming the coordination problem: Dynamic formation of networks," Journal of Economic Theory, Elsevier, vol. 145(2), pages 689-720, March.
- Jack Ochs & In-Uck Park, 2005. "Overcoming the Coordination Problem: Dynamic Formation of Networks," Levine's Bibliography 172782000000000046, UCLA Department of Economics.
- Yeon-Koo Che & József Sákovics, 2004.
"A Dynamic Theory of Holdup,"
Econometric Society, vol. 72(4), pages 1063-1103, 07.
- Marco Battaglini & Salvatore Nunnari & Thomas Palfrey, 2012.
"The Free Rider Problem: a Dynamic Analysis,"
NBER Working Papers
17926, National Bureau of Economic Research, Inc.
- Syngjoo Choi & Douglas Gale & Shachar Kariv, 2006.
"Sequential Equilibrium in Monotone Games: Theory-Based Analysis of Experimental Data,"
784828000000000278, UCLA Department of Economics.
- Choi, Syngjoo & Gale, Douglas & Kariv, Shachar, 2008. "Sequential equilibrium in monotone games: A theory-based analysis of experimental data," Journal of Economic Theory, Elsevier, vol. 143(1), pages 302-330, November.