A new epistemic characterization of -proper rationalizability

DOI10.1016/J.GEB.2017.04.009MaRDI QIDQ2013350zbMATH OpenOpenAlexFDO

Authors Andres Perea, Souvik Roy

Publication date 17 August 2017

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2017.04.009

zbMATH Keywords

epistemic game theoryincomplete informationproper rationalizability

Mathematics Subject Classification ID

Rationality and learning in game theory (91A26)

Recommendations

• An epistemic generalization of rationalizability
• A new approach to epistemic logic
• Epistemic conditions for rationalizability
• A new modal framework for epistemic logic
• scientific article; zbMATH DE number 5997429
• Epistemic extensions of combined classical and intuitionistic propositional logic
• Realization theorem for epistemic logic with justification
• On intuitionistic modal epistemic logic
• Publication:3204443
• scientific article; zbMATH DE number 51606

Cites work

• Formulation of Bayesian analysis for games with incomplete information
• On solutions of Bayesian games
• On the relationship between hierarchy and type morphisms
• Proper rationalizability and backward induction
• Proper rationalizability in lexicographic beliefs
• Rational behavior with payoff uncertainty
• Refinements of the Nash equilibrium concept
• The Bayesian foundations of solution concepts of games
• Topology-free typology of beliefs
• When do types induce the same belief hierarchy?

Cited in

(2)

• Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
• An algorithm for proper rationalizability

This page was built for publication: A new epistemic characterization of \(\varepsilon\)-proper rationalizability

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