2003
DOI: 10.2202/1534-5963.1073
|View full text |Cite
|
Sign up to set email alerts
|

Rationalization and Incomplete Information

Abstract: We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space a la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions D on first-order beliefs. For any fixed D we obtain a solution called D-rationalizability.In static games, D-rationalizability characterizes the set of outcomes (combinations of payoff types and strategies) that may occur in any Bayesian equilibrium model consiste… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
197
2

Year Published

2010
2010
2021
2021

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 136 publications
(202 citation statements)
references
References 41 publications
3
197
2
Order By: Relevance
“…We would like to point out that the finite valuation bound V and level bound K are needed only to ensure that our mechanism has a finite action space. We impose this restriction because our epistemic characterization in Section S4 of level-k rationality (i.e., by means of an iterated deletion procedure) only applies to finite games, similar to many other characterizations of higher-level rationality (Dekel, Fudenberg, and Morris (2007), Bergemann and Morris (2014), Brandenburger and Dekel (1987), Battigali and Siniscalchi (2003), Weinstein and Yildiz (2007), Halpern and Pass (2013)). …”
Section: Discrete Versus Continuous Valuation Spacementioning
confidence: 99%
“…We would like to point out that the finite valuation bound V and level bound K are needed only to ensure that our mechanism has a finite action space. We impose this restriction because our epistemic characterization in Section S4 of level-k rationality (i.e., by means of an iterated deletion procedure) only applies to finite games, similar to many other characterizations of higher-level rationality (Dekel, Fudenberg, and Morris (2007), Bergemann and Morris (2014), Brandenburger and Dekel (1987), Battigali and Siniscalchi (2003), Weinstein and Yildiz (2007), Halpern and Pass (2013)). …”
Section: Discrete Versus Continuous Valuation Spacementioning
confidence: 99%
“…Battigalli and Siniscalchi (2003) using -rationalizability, being an iterative procedure of eliminating type-strategy pairs in which the strategy is strictly dominated according to player's beliefs or which are contradicted by a history of play.…”
Section: Appendix 3: Incomplete Distorted or Ambiguous Informationmentioning
confidence: 99%
“…There are many attempts to extend the concept of Nash equilibria to make it work in the case of incomplete information: among others, Bayesian equilibria introduced by Harsanyi (1967), correlated equilibria introduced by Aumann (1974Aumann ( , 1987, -rationalizability introduced by Battigalli and Siniscalchi (2003), self-confirming equilibria introduced by Fudenberg and Levine (1993) and subjective equilibria introduced by Lehrer (1993, 1995).…”
Section: Introductionmentioning
confidence: 99%
“…As the solution concept, we employ interim correlated rationalizability (Battigalli and Siniscalchi (2003) and Dekel, Fudenberg, and Morris (2007)). …”
Section: Incomplete Information Games and P-dominancementioning
confidence: 99%