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 which 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 which are cooperative (and hence non-draconian) are not due to computability per se but to the further restrictions they impose on allowable beliefs.
|Date of creation:||13 Jun 2000|
|Note:||Type of Document - Acrobat PDF; prepared on IBM PC; pages: 22 ; figures: included. pdf file, prepared from sci word|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
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:wpa:wuwpga:0004002. 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: (EconWPA)
If references are entirely missing, you can add them using this form.