The Consistent Preferences Approach to Deductive Reasoning in Games
From MaRDI portal
Recommendations
- On the epistemic foundation for backward induction
- The language of game theory. Putting epistemics into the mathematics of games. With a foreword by Eric S. Maskin
- Doxastic conditions for backward induction
- Strong belief and forward induction reasoning.
- Backward induction versus forward induction reasoning
Cited in
(11)- Dynamic psychological games
- An epistemic characterization of MACA
- Backward induction versus forward induction reasoning
- Forward induction reasoning and correct beliefs
- An epistemic approach to stochastic games
- A one-person doxastic characterization of Nash strategies
- Preference-based belief operators
- Game justification of the rule of self-consistent choice
- Epistemically robust strategy subsets
- Time inconsistency and second-order beliefs over types in extensive-form games
- Lexicographic probability, conditional probability, and nonstandard probability
This page was built for publication: The Consistent Preferences Approach to Deductive Reasoning in Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479626)