A resolution of N -person prisoners' dilemma
The 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.
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|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:10:y:1997:i:3:p:531-540. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.