An algorithm for proper rationalizability
From MaRDI portal
Publication:550196
DOI10.1016/J.GEB.2010.10.008zbMath1217.91020OpenAlexW1997528105MaRDI QIDQ550196
Publication date: 8 July 2011
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2010.10.008
Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Rationality and learning in game theory (91A26)
Related Items (3)
Utility proportional beliefs ⋮ Epistemic equivalence of extended belief hierarchies ⋮ Algorithms for cautious reasoning in games
Cites Work
- Lexicographic rationalizability and iterated admissibility
- The Bayesian foundations of solution concepts of games
- On rationalizability in extensive games
- Proper rationalizability in lexicographic beliefs
- Proper rationalizability and backward induction
- Rational behavior with payoff uncertainty
- Rationalizable Strategic Behavior and the Problem of Perfection
- Lexicographic Probabilities and Equilibrium Refinements
- Lexicographic Probabilities and Choice Under Uncertainty
- Admissibility in Games
- Refinements of the Nash equilibrium concept
This page was built for publication: An algorithm for proper rationalizability
