Evolving aspirations and cooperation
A model of "satisficing" behavior in the repeated Prisoners Dilemma is studied. Each player has an aspiration at each date, and takes an action. [S]he switches from the action played in the previous period only if the achieved payoff fell below the aspiration level (with a probability that depends on the shortfall). Aspirations are updated in each period, according to payoff experience in the previous period In addition, aspirations are subjected to random perturbations around the going level, with a small "tremble" probability. For sufficiently slow updating of aspirations, and small tremble probability, it is shown that in the long run both players cooperate most of the time.
|Date of creation:||Jan 1996|
|Date of revision:|
|Publication status:||Published by Ivie|
|Contact details of provider:|| Postal: C/ Guardia Civil, 22, Esc 2a, 1o, E-46020 VALENCIA|
Phone: +34 96 319 00 50
Fax: +34 96 319 00 55
Web page: http://www.ivie.es/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ivi:wpasad:1996-06. 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: (Departamento de Edición)
If references are entirely missing, you can add them using this form.