This file is part of IDEAS , which uses RePEc data
[ Papers |
Articles |
Software |
Books |
Chapters |
Authors |
Institutions |
JEL Classification |
NEP reports |
Search |
New papers by email |
Author registration |
Rankings |
Volunteers |
FAQ |
Blog |
Help! ]
Repeated games played by cryptographically sophisticated players Author info | Abstract | Publisher info | Download info | Related research | Statistics O. Gossner Additional information is available for the following
registered author(s):
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
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.
Download reference. The following formats are available: HTML
(with abstract ),
plain text
(with abstract ),
BibTeX ,
RIS (EndNote, RefMan, ProCite),
ReDIF
Length: Date of creation: 1999Date of revision:
Handle: RePEc:ema:worpap:99-07Contact details of provider: http://www.u-cergy.fr/thema More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Lise Patureau).
Keywords: Other versions of this item:
Paper Gossner, O., 1999.
"Repeated Games played by Cryptographically Sophesticated Players Papers
99-07, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
GOSSNER, Olivier, 1998.
"Repeated games played by cryptographically sophisticated players CORE Discussion Papers
1998035, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
[Downloadable!] This paper has been announced in the following NEP Reports :
References listed on IDEAS RePEc Author Service profile , click on "citations" and make appropriate adjustments.: Robert J. Aumann & Lloyd S. Shapley, 1992.
"Long Term Competition-A Game Theoretic Analysis UCLA Economics Working Papers
676, UCLA Department of Economics.
[Downloadable!]
Ben-Porath Elchanan, 1993.
"Repeated Games with Finite Automata Journal of Economic Theory ,
Elsevier, vol. 59(1), pages 17-32, February.
[Downloadable!] (restricted)
Forges, Francoise, 1990.
"Universal Mechanisms Econometrica ,
Econometric Society, vol. 58(6), pages 1341-64, November.
[Downloadable!] (restricted)
Neyman, Abraham, 1985.
"Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma Economics Letters ,
Elsevier, vol. 19(3), pages 227-229.
[Downloadable!] (restricted)
Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma Journal of Economic Theory ,
Elsevier, vol. 39(1), pages 83-96, June.
[Downloadable!] (restricted)
Full
references Cited by :explanations , 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.)
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.
[Downloadable!]
Gilad Bavly & Abraham Neyman, 2003.
"Online Concealed Correlation by Boundedly Rational Players Discussion Paper Series
dp336, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem.
[Downloadable!]
Hannu Vartiainen, 2009.
"A Simple Model of Secure Public Communication Theory and Decision ,
Springer, vol. 67(1), pages 101-122, July.
[Downloadable!] (restricted)
Access and
download statistics Did you know? IDEAS was sponsored from 1997 to 2002 by the Université du Québec à Montréal .
This page was last updated on 2009-12-15.
IDEAS at the Department of Economics , College of Liberal Arts and Sciences , University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics .