An algorithm for proper rationalizability

DOI10.1016/J.GEB.2010.10.008MaRDI QIDQ550196zbMATH OpenOpenAlexFDO

Authors Andres Perea

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

zbMATH Keywords

algorithmsepistemic game theoryproper rationalizability

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Noncooperative games (91A10) Rationality and learning in game theory (91A26)

Recommendations

• Algorithms for cautious reasoning in games
• Proper rationalizability in lexicographic beliefs
• Proper belief revision and rationalizability in dynamic games
• Common belief in future and restricted past rationality
• A new epistemic characterization of \(\varepsilon\)-proper rationalizability

Cites work

• Admissibility in Games
• Lexicographic Probabilities and Choice Under Uncertainty
• Lexicographic Probabilities and Equilibrium Refinements
• Lexicographic rationalizability and iterated admissibility
• On rationalizability in extensive games
• Proper rationalizability and backward induction
• Proper rationalizability in lexicographic beliefs
• Rational behavior with payoff uncertainty
• Rationalizable Strategic Behavior and the Problem of Perfection
• Refinements of the Nash equilibrium concept
• The Bayesian foundations of solution concepts of games

Cited in

(7)

• Proper rationalizability in lexicographic beliefs
• Epistemic equivalence of extended belief hierarchies
• Algorithms for cautious reasoning in games
• Maximal-element rationalizability
• scientific article; zbMATH DE number 2079853 (Why is no real title available?)
• Utility proportional beliefs
• Quantal response equilibrium and rationalizability: inside the black box

This page was built for publication: An algorithm for proper rationalizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550196)