Iterated Prisoner's Dilemma with Choice and Refusal of Partners
This article extends the traditional iterated prisoner's dilemma (IPD) with round-robin partner matching by permitting players to choose and refuse partners in each iteration on the basis of continually updated expected payoffs. Comparative computer experiments are reported that indicate the introduction of partner choice and refusal accelerates the emergence of mutual cooperation in the IPD relative to round-robin partner matching. Moreover, in contrast to findings for round-robin partner matching (in which the average payoffs of the players tend to be either clustered around the mutual cooperation payoff or widely scattered), the average payoff scores of the players with choice and refusal of partners tend to cluster into two or more distinct narrow bands. Preliminary analytical and computational sensitivity studies are also reported for several key parameters. Related work can be accessed here: http://www.econ.iastate.edu/tesfatsi/tnghome.htm
|Date of creation:||01 Jan 1994|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +1 515.294.6741
Fax: +1 515.294.0221
Web page: http://www.econ.iastate.edu
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:isu:genres:11180. 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: (Curtis Balmer)
If references are entirely missing, you can add them using this form.