Cooperation and Punishment
We show that, in repeated common interest games without discounting, strong "perturbation implies efficiency" results require that the perturbations must include strategies that are "draconian" in the sense that they are prepared to punish to the maximum extent possible. Moreover, there is a draconian strategy whose presence in the perturbations guarantees that any equilibrium is efficient. We also argue that the results of Anderlini and Sabourian (1995) using perturbation strategies that are cooperative (and hence nondraconian) are not due to computability per se but to the further restrictions they impose on allowable beliefs.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 69 (2001)
Issue (Month): 4 (July)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/Email:
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
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.:
- Sorin, Sylvain, 1999. "Merging, Reputation, and Repeated Games with Incomplete Information," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 274-308, October.
- Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:69:y:2001:i:4:p:1061-75. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
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.