Simplicity of beliefs and delay tactics in a concession game
AbstractI explore the idea of simplicity as a belief-selection criterion in games. A pair of strategies in finite-automata representation (s(1), s(2)) is a Simple Nash Equilibrium (SINE) if: (1) s(j) is a best-reply to s(i); (2) every automaton for player j, which generates the same path as s(j) (given s(i)), has at least as many states as s(j). I apply SINE to a bilateral concession game and show that it captures an aspect of bargaining behavior: players employ delay tactics in order to justify their concessions. Delay tactics are mutually reinforcing, and this may prevent players from reaching an interior agreement. (C) 2003 Elsevier Inc. All rights reserved.
Download InfoIf 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 47 (2004)
Issue (Month): 1 (April)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Other versions of this item:
- Ran Spiegler, 2003. "Simplicity of Beliefs and Delay Tactics in a Concession Game," Levine's Working Paper Archive 506439000000000208, David K. Levine.
- Spiegler, R, 2004. "Simplicity of beliefs and delay tactics in a concession game," Open Access publications from University College London http://discovery.ucl.ac.u, University College London.
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.:
- Banks, J.S. & Sundaram, R.K., 1989.
"Repeated Games, Finite Automata, And Complexity,"
RCER Working Papers
183, University of Rochester - Center for Economic Research (RCER).
- Eliaz, K., 2001.
"Nash Equilibrium When Players Account for the Complexity of their Forecasts,"
2001-6, Tel Aviv.
- Eliaz, Kfir, 2003. "Nash equilibrium when players account for the complexity of their forecasts," Games and Economic Behavior, Elsevier, vol. 44(2), pages 286-310, August.
- Spiegler, Ran, 2002.
"Equilibrium in Justifiable Strategies: A Model of Reason-Based Choice in Extensive-Form Games,"
Review of Economic Studies,
Wiley Blackwell, vol. 69(3), pages 691-706, July.
- Ran Spiegler, 2002. "Equilibrium in Justifiable Strategies: A Model of Reason-based Choice in Extensive-form Games," Review of Economic Studies, Oxford University Press, vol. 69(3), pages 691-706.
- 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.
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometric Society, vol. 56(2), pages 397-410, March.
- Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Piccione Michele & Rubinstein Ariel, 1993. "Finite Automata Play a Repeated Extensive Game," Journal of Economic Theory, Elsevier, vol. 61(1), pages 160-168, October.
- Kalyan Chatterjee & Hamid Sabourian, 1998.
"Multiperson Bargaining and Strategic Complexity,"
CRIEFF Discussion Papers
9808, Centre for Research into Industry, Enterprise, Finance and the Firm.
- 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.
- Piccione, Michele, 1992. "Finite automata equilibria with discounting," Journal of Economic Theory, Elsevier, vol. 56(1), pages 180-193, February.
- Friederike Mengel, 2007.
"Learning Across Games,"
Working Papers. Serie AD
2007-05, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Jehiel, Philippe, 2005.
"Analogy-based expectation equilibrium,"
Journal of Economic Theory,
Elsevier, vol. 123(2), pages 81-104, August.
- Tsakas Elias, 2012. "Rational belief hierarchies," Research Memoranda 004, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Azrieli, Yaron, 2007. "Thinking categorically about others: A conjectural equilibrium approach," MPRA Paper 3843, University Library of Munich, Germany.
- Sandroni, Alvaro & Cherepavov, Vadim & Feddersen, Timothy, 2013. "Rationalization," Theoretical Economics, Econometric Society, vol. 8(3), September.
- Maenner, Eliot, 2008. "Adaptation and complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 63(1), pages 166-187, May.
- Azrieli, Yaron, 2009. "Categorizing others in a large game," Games and Economic Behavior, Elsevier, vol. 67(2), pages 351-362, November.
- Li, Duozhe, 2007. "Bargaining with history-dependent preferences," Journal of Economic Theory, Elsevier, vol. 136(1), pages 695-708, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.