Satisficing Leads to Cooperation in Mutual Interests Games
We study the play of mutual interests games by satisficing decision makers. We show that, for a high enough inital aspiration level, and under certain assumptions of "tremble," there is a high probability (close to unity) of convergence to the Pareto dominant cooperative outcome. Simulations indicate that the theoretical result is robust with respect to the "trembling" mechanism.
|Date of creation:||May 1995|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aderlini, L. & Ianni, A., 1993.
"Path Dependence and Learning from Neighbours,"
186, Cambridge - Risk, Information & Quantity Signals.
- Osborne, Martin J., 1990. "Signaling, forward induction, and stability in finitely repeated games," Journal of Economic Theory, Elsevier, vol. 50(1), pages 22-36, February.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994.
"Aspirations, adaptive learning and cooperation in repeated games,"
1994-42, Tilburg University, Center for Economic Research.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994. "Aspirations, Adaptive Learning and Cooperation in Reapeted Games," Papers 27, Boston University - Department of Economics.
- Binmore, Kenneth G. & Samuelson, Larry, 1992. "Evolutionary stability in repeated games played by finite automata," Journal of Economic Theory, Elsevier, vol. 57(2), pages 278-305, August.
- Itzhak Gilboa & David Schmeidler, 1993.
1039, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Anderlini, Luca & Sabourian, Hamid, 1995.
"Cooperation and Effective Computability,"
Econometric Society, vol. 63(6), pages 1337-69, November.
- repec:dgr:kubcen:199442 is not listed on IDEAS
- Kandori, M. & Mailath, G.J., 1991.
"Learning, Mutation, And Long Run Equilibria In Games,"
71, Princeton, Woodrow Wilson School - John M. Olin Program.
- Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993. "Learning, Mutation, and Long Run Equilibria in Games," Econometrica, Econometric Society, vol. 61(1), pages 29-56, January.
- M. Kandori & G. Mailath & R. Rob, 1999. "Learning, Mutation and Long Run Equilibria in Games," Levine's Working Paper Archive 500, David K. Levine.
- Akihiko Matsui, 1989. "Cheap Talk and Cooperation in the Society," Discussion Papers 848, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gilboa, Itzhak & Schmeidler, David, 1995.
"Case-Based Decision Theory,"
The Quarterly Journal of Economics,
MIT Press, vol. 110(3), pages 605-39, August.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
- Matsui, Akihiko, 1991. "Cheap-talk and cooperation in a society," Journal of Economic Theory, Elsevier, vol. 54(2), pages 245-258, August.
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1126. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.