Advanced Search
MyIDEAS: Login to save this paper or follow this series

Repeated Games played by Cryptographically Sophesticated Players

Contents:

Author Info

  • Gossner, O.

Abstract

One of the main goals of bounded rationality models is to understand the limitations of agent's abilities in building representations of strategic situations as maximization problems and in solving these problems. Modern cryptography relies on the assumption that agents's computations should be implementable by polynominal Turing machines and on the exstence of a trapdoor function. Uder those assumption, we prove that very correlated equilibrium of the original infinitely repreated game can be implemented through public communication only.

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.

Bibliographic Info

Paper provided by Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor. in its series Papers with number 99-07.

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

Contact details of provider:
Postal: THEMA, Universite de Paris X-Nanterre, U.F.R. de science economiques, gestion, mathematiques et informatique, 200, avenue de la Republique 92001 Nanterre CEDEX.

Related research

Keywords: GAME THEORY mathematiques et informatique; 200; avenue de la Republique 9 2001 Nanterre CEDEX. 23p.;

Other versions of this item:

Find related papers by JEL classification:

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. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
  2. 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).
  3. FORGES, Françoise, . "Universal mechanisms," CORE Discussion Papers RP -914, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
  5. 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).
  6. Binmore, Ken, 1988. "Modeling Rational Players: Part II," Economics and Philosophy, Cambridge University Press, vol. 4(01), pages 9-55, April.
  7. Robert J. Aumann & Lloyd S. Shapley, 1992. "Long Term Competition-A Game Theoretic Analysis," UCLA Economics Working Papers 676, UCLA Department of Economics.
  8. 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).
  9. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
  10. Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
  11. 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).
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. 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.
  2. 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.
  3. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer, vol. 42(3), pages 593-611, August.
  4. 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.
  5. 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).
  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:fth:pnegmi: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: (Thomas Krichel).

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.