Satisficing Leads to Cooperation in Mutual Interests Games
Abstract
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.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1126.Length:
Date of creation: May 1995
Date of revision:
Handle: RePEc:nwu:cmsems:1126
Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
Order Information:
Email:
Related research
Keywords:References
References listed on IDEASPlease 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,"
Papers
186, Cambridge - Risk, Information & Quantity Signals.
- Anderlini, Luca & Ianni, Antonella, 1996. "Path Dependence and Learning from Neighbors," Games and Economic Behavior, Elsevier, vol. 13(2), pages 141-177, April.
- Itzhak Gilboa & David Schmeidler, 1992.
"Case-Based Decision Theory,"
Discussion Papers
994, 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.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994.
"Aspirations, Adaptive Learning and Cooperation in Reapeted Games,"
Papers
27, Boston University - Department of Economics.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994. "Aspirations, adaptive learning and cooperation in repeated games," Discussion Paper 1994-42, Tilburg University, Center for Economic Research.
- Anderlini, Luca & Sabourian, Hamid, 1995.
"Cooperation and Effective Computability,"
Econometrica,
Econometric Society, vol. 63(6), pages 1337-69, November.
- Anderlini, L. & Sabourian, H., 1991. "Cooperation and Effective Computability," Papers 167, Cambridge - Risk, Information & Quantity Signals.
- Kandori, M. & Mailath, G.J., 1991.
"Learning, Mutation, And Long Run Equilibria In Games,"
Papers
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.
- 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.
- Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
- Matsui, Akihiko, 1991. "Cheap-talk and cooperation in a society," Journal of Economic Theory, Elsevier, vol. 54(2), pages 245-258, August.
- Gilboa, Itzhak & Schmeidler, David, 1996.
"Case-Based Optimization,"
Games and Economic Behavior,
Elsevier, vol. 15(1), pages 1-26, July.
- Itzhak Gilboa & David Schmeidler, 1993. "Case-Based Optimization," Discussion Papers 1039, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- 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.
- Akihiko Matsui, 1989. "Cheap Talk and Cooperation in the Society," Discussion Papers 848, 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.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1126For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

