Robust refinement of rationalizability with arbitrary payoff uncertainty
From MaRDI portal
Publication:2100656
DOI10.1016/j.geb.2022.10.009zbMath1505.91064OpenAlexW4307295765MaRDI QIDQ2100656
Yi-Chun Chen, Satoru Takahashi, Siyang Xiong
Publication date: 24 November 2022
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2022.10.009
refinementrationalizabilityuniversal type spacestructure theoremgeneric uniquenessupper hemicontinuity
Applications of game theory (91A80) Games in extensive form (91A18) Auctions, bargaining, bidding and selling, and other market models (91B26) Special types of economic markets (including Cournot, Bertrand) (91B54)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The robust selection of rationalizability
- A structure theorem for rationalizability in the normal form of dynamic games
- Sensitivity of equilibrium behavior to higher-order beliefs in nice games
- Rational behavior under correlated uncertainty
- Robust equilibria under non-common priors
- Formulation of Bayesian analysis for games with incomplete information
- On the robustness of equilibrium refinements
- Monotone and bounded interval equilibria in a coordination game with information aggregation
- Impact of higher-order uncertainty
- Interim correlated rationalizability in infinite games
- Generalized potentials and robust sets of equilibria
- Rational behavior with payoff uncertainty
- Higher Order Uncertainty and Information: Static and Dynamic Games
- Continuous Implementation
- Global Games and Equilibrium Selection
- Uncertain rationality, depth of reasoning and robustness in games with incomplete information
- Rationalizable Strategic Behavior
- Alternating-Offer Bargaining with Two-Sided Incomplete Information
- The Robustness of Equilibria to Incomplete Information
- On the structure of rationalizability for arbitrary spaces of uncertainty
- Subgame-Perfect Implementation Under Information Perturbations*
- Critical Types
- Me\fehler und Information
- A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements
- Implementation with Near-Complete Information
