Advanced Search
MyIDEAS: Login

Repeated games played by cryptographically sophisticated players

Contents:

Author Info

  • O. Gossner

Abstract

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..

(This abstract was borrowed from another version of this item.)

Download Info

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.
File URL: http://www.u-cergy.fr/IMG/99-07Gossner.pdf
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Marion Oury)
Download Restriction: no

Bibliographic Info

Paper provided by THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise in its series THEMA Working Papers with number 99-07.

as in new window
Length:
Date of creation: 1999
Date of revision:
Handle: RePEc:ema:worpap:99-07

Contact details of provider:
Postal: 33, boulevard du port - 95011 Cergy-Pontoise Cedex
Phone: 33 1 34 25 60 63
Fax: 33 1 34 25 62 33
Email:
Web page: http://thema.u-cergy.fr
More information through EDIRC

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. 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).
  2. Forges, F., 1987. "Universal mechanisms," CORE Discussion Papers 1987004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  3. Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
  4. 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).
  5. 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).
  6. 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).
  7. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
  8. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
  9. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
  10. Robert J. Aumann & Lloyd S. Shapley, 1992. "Long Term Competition-A Game Theoretic Analysis," UCLA Economics Working Papers 676, UCLA Department of Economics.
  11. Binmore, Ken, 1988. "Modeling Rational Players: Part II," Economics and Philosophy, Cambridge University Press, vol. 4(01), pages 9-55, April.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. 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).
  2. Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  3. Gilad Bavly & Abraham Neyman, 2014. "Online Concealed Correlation and Bounded Rationality," Discussion Paper Series dp659, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  4. O. Gossner, 2000. "Sharing a long secret in a few public words," THEMA Working Papers 2000-15, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
  5. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer, vol. 42(3), pages 593-611, August.
  6. Hannu Vartiainen, 2009. "A Simple Model of Secure Public Communication," Theory and Decision, Springer, vol. 67(1), pages 101-122, July.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ema:worpap:99-07. 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: (Marion Oury).

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.