On the size and structure of group cooperation
This paper examines characteristics of cooperative behavior in a repeated, n-person, continuous action generalization of a Prisoner's Dilemma game. When time preferences are heterogeneous and bounded away from one, how "much" cooperation can be achieved by an ongoing group? How does group cooperation vary with the group's size and structure? For an arbitrary distribution of discount factors, we characterize the maximal average cooperation (MAC) likelihood of this game. The MAC likelihood is the highest average level of cooperation, over all stationary subgame perfect equilibrium paths, that the group can achieve. The MAC likelihood is shown to be increasing in monotone shifts, and decreasing in mean preserving spreads, of the distribution of discount factors. The latter suggests that more heterogeneous groups are less cooperative on average. Finally, we establish weak conditions under which the MAC likelihood exhibits increasing returns to scale when discounting is heterogeneous. That is, larger groups are more cooperative, on average, than smaller ones. By contrast, when the group has a common discount factor, the MAC likelihood is invariant to group size.
(This abstract was borrowed from another version of this item.)
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- George J. Mailath & Ichiro Obara & Tadashi Sekiguchi, .
"The Maximum Efficient Equilibrium Payoff in the Repeated Prisoners' Dilemma,"
Penn CARESS Working Papers
83719e84b6825736ffcfdfacb, Penn Economics Department.
- Mailath, George J. & Obara, Ichiro & Sekiguchi, Tadashi, 2002. "The Maximum Efficient Equilibrium Payoff in the Repeated Prisoners' Dilemma," Games and Economic Behavior, Elsevier, vol. 40(1), pages 99-122, July.
- Fudenberg, Drew & Levine, David K, 1989.
"Reputation and Equilibrium Selection in Games with a Patient Player,"
Econometric Society, vol. 57(4), pages 759-78, July.
- Drew Fudenberg & David Levine, 1987. "Reputation and Equilibrium Selection in Games With a Patient Player," Working papers 461, Massachusetts Institute of Technology (MIT), Department of Economics.
- D. Fudenberg & David K. Levine, 1989. "Reputation and Equilibrium Selection in Games with a Patient Player," Levine's Working Paper Archive 508, David K. Levine.
- Drew Fudenberg & David K. Levine, 1995. "Reputation and Equilibrium Selection in Games with a Patient Player," Levine's Working Paper Archive 103, David K. Levine.
- Ehud Lehrer & Ady Pauzner, 1999. "Repeated Games with Differential Time Preferences," Econometrica, Econometric Society, vol. 67(2), pages 393-412, March.
- Maskin, Eric & Kreps, David & Fudenberg, Drew, 1990.
"Repeated Games with Long-run and Short-run Players,"
3226950, Harvard University Department of Economics.
- Fudenberg, Drew & Kreps, David M & Maskin, Eric S, 1990. "Repeated Games with Long-run and Short-run Players," Review of Economic Studies, Wiley Blackwell, vol. 57(4), pages 555-73, October.
- D. Fudenberg & D. M. Kreps & E. Maskin, 1998. "Repeated Games with Long-run and Short-run Players," Levine's Working Paper Archive 608, David K. Levine.
- Drew Fudenberg & David Kreps & Eric Maskin, 1988. "Repeated Games with Long-Run and Short-Run Players," Working papers 474, Massachusetts Institute of Technology (MIT), Department of Economics.
- Marco Celentani, 1993.
"Maintaining a Reputation Against A Long-Lived Opponent,"
1075R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Celentani, Marco, et al, 1996. "Maintaining a Reputation against a Long-Lived Opponent," Econometrica, Econometric Society, vol. 64(3), pages 691-704, May.
- Aoyagi, Masaki, 1996. "Reputation and Dynamic Stackelberg Leadership in Infinitely Repeated Games," Journal of Economic Theory, Elsevier, vol. 71(2), pages 378-393, November.
- Matthew Haag & Roger Lagunoff, 1999.
"Social Norms, Local Interaction, and Neighborhood Planning,"
Game Theory and Information
- Matthew Haag & Roger Lagunoff, 2006. "Social Norms, Local Interaction, And Neighborhood Planning ," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 47(1), pages 265-296, 02.
- Matthew Haag & Roger Lagunoff, 2000. "social Norms, Local Interaction and Neighborhood Planning," Levine's Working Paper Archive 2049, David K. Levine.
- 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.
- Harrington, Joseph Jr., 1989. "Collusion among asymmetric firms: The case of different discount factors," International Journal of Industrial Organization, Elsevier, vol. 7(2), pages 289-307, June.
- Martin McGuire, 1974. "Group size, group homo-geneity, and the aggregate provision of a pure public good under cournot behavior," Public Choice, Springer, vol. 18(1), pages 107-126, June.
- Stahl, Dale II, 1991. "The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor," Games and Economic Behavior, Elsevier, vol. 3(3), pages 368-384, August.
- Pecorino, Paul, 1999. "The effect of group size on public good provision in a repeated game setting," Journal of Public Economics, Elsevier, vol. 72(1), pages 121-134, April.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:135:y:2007:i:1:p:68-89. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
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.