Repeated games played by cryptographically sophisticated players
We explore the consequences of the assumptions used in modern cryptographywhen applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machinesand assume the existence of a trapdoor function. Under these conditions, we prove a Folk Theorem in which the minmax level of players has to be taken in correlated strategies instead of mixed strategies..
|Date of creation:||01 Jun 1998|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
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.:
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Robert J. Aumann & Lloyd S. Shapley, 2013.
"Long Term Competition -- A Game-Theoretic Analysis,"
Annals of Economics and Finance,
Society for AEF, vol. 14(2), pages 627-640, November.
- Urbano, A. & Vila, J. E., 2004.
"Unmediated communication in repeated games with imperfect monitoring,"
Games and Economic Behavior,
Elsevier, vol. 46(1), pages 143-173, January.
- José E. Vila & Amparo Urbano, 1998. "- Unmediated Communication In Repeated Games With Imperfect Monitoring," Working Papers. Serie AD 1998-27, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Forges, Francoise, 1990.
Econometric Society, vol. 58(6), pages 1341-64, November.
- Forges, F., 1987. "Universal mechanisms," CORE Discussion Papers 1987004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- FORGES, Françoise, . "Universal mechanisms," CORE Discussion Papers RP -914, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
- José E. Vila & Amparo Urbano Salvador, 1997. "Pre-play communication and coordination in two-player games," Working Papers. Serie AD 1997-26, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Amparo Urbano & Penélope Hernández, 2001. "Communication And Automata," Working Papers. Serie AD 2001-04, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- José E. Vila & Amparo Urbano, 1999. "- Unmediated Talk Under Incomplete Information," Working Papers. Serie AD 1999-07, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Binmore, Ken, 1988. "Modeling Rational Players: Part II," Economics and Philosophy, Cambridge University Press, vol. 4(01), pages 9-55, April.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1998035. 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: (Alain GILLIS)
If references are entirely missing, you can add them using this form.