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: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014|
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
References listed on IDEAS
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.:
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- M. Kandori & G. Mailath & R. Rob, 1999.
"Learning, Mutation and Long Run Equilibria in Games,"
Levine's Working Paper Archive
500, David K. Levine.
- 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.
- Kandori, M. & Mailath, G.J., 1991. "Learning, Mutation, And Long Run Equilibria In Games," Papers 71, Princeton, Woodrow Wilson School - John M. Olin Program.
- Aderlini, L. & Ianni, A., 1993.
"Path Dependence and Learning from Neighbours,"
186, Cambridge - Risk, Information & Quantity Signals.
- Anderlini, L. & Sabourian, H., 1991.
"Cooperation and Effective Computability,"
167, Cambridge - Risk, Information & Quantity Signals.
- Matsui, Akihiko, 1991. "Cheap-talk and cooperation in a society," Journal of Economic Theory, Elsevier, vol. 54(2), pages 245-258, August.
- Itzhak Gilboa & David Schmeidler, 1996.
- 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.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994.
"Aspirations, Adaptive Learning and Cooperation in Reapeted Games,"
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.
- Itzhak Gilboa & David Schmeidler, 1995.
"Case-Based Decision Theory,"
- Akihiko Matsui, 1989. "Cheap Talk and Cooperation in the Society," Discussion Papers 848, 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.
- 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.
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 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.