On the existence and efficiency of the von Neumann-Morgenstern stable set in a n-player prisoners' dilemma
We show that there exist von Neumann-Morgenstern (vN-M) stable sets in a n-player version of the prisoners' dilemma game with preplay negotiations in which every player can deviate unilaterally from the currently proposed combination of actions but can not do so jointly with other players, and that every vN-M stable set includes at least one Pareto-efficient outcome. The negotiation among the players is formulated as the "individual contingent threats situation" within the framework of the theory of social situations due to Greenberg (1990). The method of proving the existence also provides us with a step-by-step method of constructing the vN-M stable set.
Volume (Year): 30 (2001)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:30:y:2001:i:2:p:291-307. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.