A resolution of N -person prisoners' dilemma
AbstractThe purpose of this paper is to show that cooperation is possible in N-person prisoners' dilemma if players have incomplete information on the order of their moves. We consider a modified version of N-person prisoners' dilemma in which players sequentially move in the order determined by Nature, and during the play they get some information about others. We provide an information partition and a condition of payoffs for which cooperation is attained in an equilibrium. Further, for the case that full cooperation is not attained, we examine the largest partial cooperation which is achieved in an equilibrium.
Download InfoIf 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 10 (1997)
Issue (Month): 3 ()
Note: Received: March 5, 1995; revised version August 11, 1996
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D62 - Microeconomics - - Welfare Economics - - - Externalities
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.