IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v30y2002i4p453-478.html
   My bibliography  Save this article

Proper rationalizability in lexicographic beliefs

Author

Listed:
  • Geir B. Asheim

    (Department of Economics, University of Oslo, P.O. Box 1095 Blindern, N-0317 Oslo, Norway Final version: December 2001)

Abstract

Proper consistency is defined by the property that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used with positive probability in a proper equilibrium is properly rationalizable. Only strategies that lead to the backward induction outcome are properly rationalizable in the strategic form of a generic perfect information game. Proper rationalizability can test the robustness of inductive procedures.

Suggested Citation

  • Geir B. Asheim, 2002. "Proper rationalizability in lexicographic beliefs," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(4), pages 453-478.
    • Handle: RePEc:spr:jogath:v:30:y:2002:i:4:p:453-478
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/2030004/20300453.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Shuige Liu, 2018. "Ordered Kripke Model, Permissibility, and Convergence of Probabilistic Kripke Model," Papers 1801.08767, arXiv.org.
    2. V. K. Oikonomou & J. Jost, 2013. "Periodic Strategies: A New Solution Concept and an Algorithm for NonTrivial Strategic Form Games," Papers 1307.2035, arXiv.org, revised Jan 2018.
    3. Perea, Andrés, 2011. "An algorithm for proper rationalizability," Games and Economic Behavior, Elsevier, vol. 72(2), pages 510-525, June.
    4. Adam Brandenburger & Amanda Friedenberg, 2014. "Self-Admissible Sets," World Scientific Book Chapters, in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 8, pages 213-249, World Scientific Publishing Co. Pte. Ltd..
    5. Asheim, Geir B. & Dufwenberg, Martin, 2003. "Admissibility and common belief," Games and Economic Behavior, Elsevier, vol. 42(2), pages 208-234, February.
    6. Breitmoser, Yves & Tan, Jonathan H.W. & Zizzo, Daniel John, 2014. "On the beliefs off the path: Equilibrium refinement due to quantal response and level-k," Games and Economic Behavior, Elsevier, vol. 86(C), pages 102-125.
    7. V. K. Oikonomou & J. Jost, 2020. "Periodic Strategies II: Generalizations and Extensions," Papers 2005.12832, arXiv.org.
    8. Perea Andrés, 2003. "Rationalizability and Minimal Complexity in Dynamic Games," Research Memorandum 047, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Perea, Andres, 2007. "Proper belief revision and equilibrium in dynamic games," Journal of Economic Theory, Elsevier, vol. 136(1), pages 572-586, September.
    10. Geir B. Asheim & Andrés Perea, 2019. "Algorithms for cautious reasoning in games," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1241-1275, December.
    11. Perea, Andrés & Roy, Souvik, 2017. "A new epistemic characterization of ε-proper rationalizability," Games and Economic Behavior, Elsevier, vol. 104(C), pages 309-328.
    12. Adam Brandenburger, 2007. "The power of paradox: some recent developments in interactive epistemology," International Journal of Game Theory, Springer;Game Theory Society, vol. 35(4), pages 465-492, April.
    13. Asheim, Geir B., 2002. "On the epistemic foundation for backward induction," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 121-144, November.
    14. Dekel, Eddie & Friedenberg, Amanda & Siniscalchi, Marciano, 2016. "Lexicographic beliefs and assumption," Journal of Economic Theory, Elsevier, vol. 163(C), pages 955-985.
    15. Larry Samuelson, 2004. "Modeling Knowledge in Economic Analysis," Journal of Economic Literature, American Economic Association, vol. 42(2), pages 367-403, June.
    16. Shuige Liu, 2018. "Characterizing Assumption of Rationality by Incomplete Information," Papers 1801.04714, arXiv.org.
    17. Perea ý Monsuwé, A., 2003. "Proper rationalizability and belief revision in dynamic games," Research Memorandum 048, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Dekel, Eddie & Siniscalchi, Marciano, 2015. "Epistemic Game Theory," Handbook of Game Theory with Economic Applications,, Elsevier.
    19. Oikonomou, V.K. & Jost, J, 2013. "Periodic strategies and rationalizability in perfect information 2-Player strategic form games," MPRA Paper 48117, University Library of Munich, Germany.

    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:spr:jogath:v:30:y:2002:i:4:p:453-478. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.