Evolving aspirations and cooperation

• Rajeeva L. Karandikar ^[1] ; Dilip Mookherjee ^[3] ; Debraj Ray ^[4] ; Fernando Vega-Redondo ^[2]
  1. [1] Indian Statistical Institute

     Indian Statistical Institute

     India

     
  2. [2] Universitat d'Alacant

     Universitat d'Alacant

     Alicante, España

     
  3. [3] Boston University; Indian Statistical Institute
  4. [4] Boston University; Instituto de Análisis Económico CSIC, España

  Mostrar afiliaciones +
• Localización: Working papers = Documentos de trabajo: Serie AD, Nº. 6, 1996, págs. 1-38
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.