IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/506439000000000208.html
   My bibliography  Save this paper

Simplicity of Beliefs and Delay Tactics in a Concession Game

Author

Listed:
  • Ran Spiegler

Abstract

No abstract is available for this item.

Suggested Citation

  • Ran Spiegler, 2003. "Simplicity of Beliefs and Delay Tactics in a Concession Game," Levine's Working Paper Archive 506439000000000208, David K. Levine.
    • Handle: RePEc:cla:levarc:506439000000000208
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4506439000000000208.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Piccione, Michele, 1992. "Finite automata equilibria with discounting," Journal of Economic Theory, Elsevier, vol. 56(1), pages 180-193, February.
    2. Piccione Michele & Rubinstein Ariel, 1993. "Finite Automata Play a Repeated Extensive Game," Journal of Economic Theory, Elsevier, vol. 61(1), pages 160-168, October.
    3. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    4. Banks, Jeffrey S. & Sundaram, Rangarajan K., 1990. "Repeated games, finite automata, and complexity," Games and Economic Behavior, Elsevier, vol. 2(2), pages 97-117, June.
    5. 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.
    6. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    7. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    8. Ran Spiegler, 2002. "Equilibrium in Justifiable Strategies: A Model of Reason-based Choice in Extensive-form Games," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 69(3), pages 691-706.
    9. Kalyan Chatterjee & Hamid Sabourian, 2000. "Multiperson Bargaining and Strategic Complexity," Econometrica, Econometric Society, vol. 68(6), pages 1491-1510, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ran Spiegler, 2013. "Placebo Reforms," American Economic Review, American Economic Association, vol. 103(4), pages 1490-1506, June.
    2. Ran Spiegler, 2016. "Bayesian Networks and Boundedly Rational Expectations," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 131(3), pages 1243-1290.
    3. Mengel, Friederike, 2012. "Learning across games," Games and Economic Behavior, Elsevier, vol. 74(2), pages 601-619.
    4. Li, Duozhe, 2007. "Bargaining with history-dependent preferences," Journal of Economic Theory, Elsevier, vol. 136(1), pages 695-708, September.
    5. Tsakas, E., 2012. "Rational belief hierarchies," Research Memorandum 004, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    6. Tsakas, Elias, 2014. "Rational belief hierarchies," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 121-127.
    7. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    8. Azrieli, Yaron, 2009. "Categorizing others in a large game," Games and Economic Behavior, Elsevier, vol. 67(2), pages 351-362, November.
    9. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    10. Cherepanov, Vadim & Feddersen, Timothy & ,, 2013. "Rationalization," Theoretical Economics, Econometric Society, vol. 8(3), September.
    11. Azrieli, Yaron, 2007. "Thinking categorically about others: A conjectural equilibrium approach," MPRA Paper 3843, University Library of Munich, Germany.
    12. Maenner, Eliot, 2008. "Adaptation and complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 63(1), pages 166-187, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    2. Binmore, Ken & Piccione, Michele & Samuelson, Larry, 1998. "Evolutionary Stability in Alternating-Offers Bargaining Games," Journal of Economic Theory, Elsevier, vol. 80(2), pages 257-291, June.
    3. Jihong Lee & Hamid Sabourian, 2005. "Efficiency in Negotiation: Complexity and Costly Bargaining," Birkbeck Working Papers in Economics and Finance 0505, Birkbeck, Department of Economics, Mathematics & Statistics.
    4. Spiegler, Ran, 2005. "Testing threats in repeated games," Journal of Economic Theory, Elsevier, vol. 121(2), pages 214-235, April.
    5. Lee, J. & Sabourian, H., 2004. "Complexity and Efficiency in Repeated Games and Negotiation," Cambridge Working Papers in Economics 0419, Faculty of Economics, University of Cambridge.
    6. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in Repeated Games with Negotiation," Econometric Society 2004 Far Eastern Meetings 401, Econometric Society.
    7. Lee, Jihong & Sabourian, Hamid, 2007. "Coase theorem, complexity and transaction costs," Journal of Economic Theory, Elsevier, vol. 135(1), pages 214-235, July.
    8. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in the Negotiation Game," Econometric Society 2004 North American Winter Meetings 82, Econometric Society.
    9. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    10. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. Maenner, Eliot, 2008. "Adaptation and complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 63(1), pages 166-187, May.
    12. Muto, Nozomu, 2014. "Strategic complexity in repeated extensive games," Games and Economic Behavior, Elsevier, vol. 83(C), pages 45-52.
    13. Luca Anderlini & Leonardo Felli, 1999. "Incomplete Contracts and Complexity Costs," Theory and Decision, Springer, vol. 46(1), pages 23-50, February.
    14. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    15. Luca Anderlini (Georgetown University), Dino Gerardi (Yale University), Roger Lagunoff (Georgetown University), 2004. "The Folk Theorem in Dynastic Repeated Games," Working Papers gueconwpa~04-04-09, Georgetown University, Department of Economics.
    16. Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
    17. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    18. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    19. Guilherme Carmona, 2006. "A Strong Anti-Folk Theorem," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 131-151, April.
    20. Jones, Matthew T., 2014. "Strategic complexity and cooperation: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 106(C), pages 352-366.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levarc:506439000000000208. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.