Abstract
There are four types of dominance depending on whether domination is strict or weak and whether the dominating strategy is pure or mixed. Letting d vary over these four types of dominance, we say that a player is d-dominance rational when she does not play a strategy that is d-dominated relative to what she knows. For weak dominance by a mixed strategy, Stalnaker (1994) introduced a process of iterative maximal elimination of certain profiles that we call here flaws. We define here, analogously, d-flaws for each type of dominance d, and show that for each d, iterative elimination of d-flaws is order independent. We then show that the characterization of common knowledge of d-dominance rationality is the same for each d. A strategy profile can be played when d-dominance rationality is commonly known if and only if it survives an iterative elimination of d-flaws.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.