IDEAS home Printed from https://ideas.repec.org/h/wsi/wschap/9789814513449_0007.html
   My bibliography  Save this book chapter

Admissibility in Games

In: The Language of Game Theory Putting Epistemics into the Mathematics of Games

Author

Listed:
  • Adam Brandenburger
  • Amanda Friedenberg
  • H. Jerome Keisler

Abstract

Suppose that each player in a game is rational, each player thinks the other players are rational, and so on. Also, suppose that rationality is taken to incorporate an admissibility requirement — that is, the avoidance of weakly dominated strategies. Which strategies can be played? We provide an epistemic framework in which to address this question. Specifically, we formulate conditions of rationality and mth-order assumption of rationality (RmAR) and rationality and common assumption of rationality (RCAR). We show that (i) RCAR is characterized by a solution concept we call a “self-admissible set”; (ii) in a “complete” type structure, RmAR is characterized by the set of strategies that survive m + 1 rounds of elimination of inadmissible strategies; (iii) under certain conditions, RCAR is impossible in a complete structure.

Suggested Citation

  • Adam Brandenburger & Amanda Friedenberg & H. Jerome Keisler, 2014. "Admissibility in Games," World Scientific Book Chapters, in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 7, pages 161-212, World Scientific Publishing Co. Pte. Ltd..
  • Handle: RePEc:wsi:wschap:9789814513449_0007
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/pdf/10.1142/9789814513449_0007
    Download Restriction: Ebook Access is available upon purchase.

    File URL: https://www.worldscientific.com/doi/abs/10.1142/9789814513449_0007
    Download Restriction: Ebook Access is available upon purchase.
    ---><---

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

    Other versions of this item:

    More about this item

    Keywords

    Game Theory; Epistemic Game Theory; Foundations; Applied Mathematics; Social Neuroscience; Rationalizability; Nash Equilibrium; Probability; Uncertainty;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:wsi:wschap:9789814513449_0007. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscientific.com/page/worldscibooks .

    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.