Evolution towards asymptotic efficiency, preliminary version
We show that in long repeated games, or in infinitely repeated games with discount rate close to one, payoffs corresponding to evolutionary stable sets are asymptotically efficient, as intuition suggests. Actions played at the beginning of the game are used as messages that allow players to coordinate on Pareto optimal outcomes in the following stages. The result builds a bridge between the theory of repeated games and that of communication games.
|Date of creation:||May 2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://dipartimenti.unipv.eu/on-dip/epmq/Home.html
More information through EDIRC
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.:
- Demichelis, Stefano & Ritzberger, Klaus & Swinkels, Jeroen M., 2002.
"The Simple Geometry of Perfect Information Games,"
115, Institute for Advanced Studies.
- DEMICHELIS, Stefano & RITZBERGER, Klaus, 2000.
"From evolutionary to strategic stability,"
CORE Discussion Papers
2000059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Fudenberg, Drew & Dreber, Anna & Rand, David G. & Nowak, Martin, 2008. "Winners Don't Punish," Scholarly Articles 2252594, Harvard University Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:pav:wpaper:173. 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: (Paolo Bonomolo)
If references are entirely missing, you can add them using this form.