A unified epistemic analysis of iterated elimination algorithms from regret viewpoint

DOI10.1007/978-3-642-40948-6_7MaRDI QIDQ2859097zbMATH OpenOpenAlexFDO

Authors Jianying Cui, Xudong Luo

Publication date 6 November 2013

Published in Logic, Rationality, and Interaction (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40948-6_7

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Rationality and learning in game theory (91A26) Games involving topology, set theory, or logic (91A44)

Recommendations

• Characterizations of iterated admissibility based on PEGL
• scientific article; zbMATH DE number 6606375
• On the epistemic foundation for iterated weak dominance: an analysis in a logic of individual and collective attitudes
• ERRATUM: "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES"
• RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES

Cited in

(3)

• Algorithms for cautious reasoning in games
• Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces
• Characterizations of iterated admissibility based on PEGL

This page was built for publication: A unified epistemic analysis of iterated elimination algorithms from regret viewpoint

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