Admissibility in Games
From MaRDI portal
Publication:5456469
DOI10.1111/J.1468-0262.2008.00835.XzbMATH Open1133.91330OpenAlexW2158026954MaRDI QIDQ5456469FDOQ5456469
Amanda Friedenberg, H. Jerome Keisler, Adam Brandenburger
Publication date: 8 April 2008
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1468-0262.2008.00835.x
Recommendations
rationalitycompletenessepistemic game theoryadmissibilityassumptioniterated weak dominanceself-admissible sets
Cited In (82)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimism and pessimism in strategic interactions under ignorance
- Revenue comparison of discrete private-value auctions via weak dominance
- Strategic cautiousness as an expression of robustness to ambiguity
- Common assumption of rationality
- Cautious belief and iterated admissibility
- Lexicographic agreeing to disagree and perfect equilibrium
- Iterated admissibility through forcing in strategic belief models
- The role of aggregate information in a binary threshold game
- The implications of finite‐order reasoning
- Title not available (Why is that?)
- Complete Conditional Type Structures (Extended Abstract)
- Characterizing solution concepts in terms of common knowledge of rationality
- Coordination via delay: theory and experiment
- Complete conditional type structures
- The existence of universal qualitative belief spaces
- Evolutionary selection against iteratively weakly dominated strategies
- Strategic reasoning in persuasion games: an experiment
- Rationalizability and logical inference
- Iterated elimination procedures
- Directed lexicographic rationalizability
- Foundations of probability
- Logic and Game Theory
- Epistemic equivalence of extended belief hierarchies
- The context of the game
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- An epistemic characterization of MACA
- Language and coordination games
- When do type structures contain all hierarchies of beliefs?
- On the complexity of iterated weak dominance in constant-sum games
- Comprehensive rationalizability
- On the equivalence between iterated application of choice rules and common belief of applying these rules
- Universality of the Epstein-Wang type structure
- Title not available (Why is that?)
- Lexicographic probability, conditional probability, and nonstandard probability
- Admissibility and assumption
- Lexicographic beliefs and assumption
- The power of paradox: some recent developments in interactive epistemology
- Algorithms for cautious reasoning in games
- Robust perfect equilibrium in large games
- A rational way of playing: revision theory for strategic interaction
- Epistemically robust strategy subsets
- Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
- An impossibility theorem on beliefs in games
- Weak assumption and iterative admissibility
- Agreeing to disagree with conditional probability systems
- On the epistemic foundation for iterated weak dominance: an analysis in a logic of individual and collective attitudes
- A space of lexicographic preferences
- Dominated strategies and common knowledge
- Epistemic foundation of the backward induction paradox
- Transparent restrictions on beliefs and forward-induction reasoning in games with asymmetric information
- Self-admissible sets
- The role of monotonicity in the epistemic analysis of strategic games
- On redundant types and Bayesian formulation of incomplete information
- A Dynamic Analysis of Interactive Rationality
- THE POWER OF KNOWLEDGE IN GAMES
- Rational behavior under correlated uncertainty
- Hierarchies of ambiguous beliefs
- Perfect forward induction
- A characterization of Brandenburger-Friedenberg-Keisler's assumption
- Admissibility in Infinite Games
- The reasoning-based expected utility procedure
- Common theories
- The refined best-response correspondence in normal form games
- Strategic and structural uncertainty in robust implementation
- Minimal belief revision leads to backward induction
- An algorithm for proper rationalizability
- Observability, dominance, and induction in learning models
- Iterated dominance revisited
- Iterated strict dominance in general games
- Substantive assumptions in interaction: a logical perspective
- Weak belief and permissibility
- Dominance-solvable common-value large auctions
- Possibility and permissibility
- Lexicographic expected utility with a subjective state space
- Simple mechanisms and preferences for honesty
- Common knowledge of payoff uncertainty in games
- A minimal logic for interactive epistemology
- Assume-admissible synthesis
- Iterated regret minimization: a new solution concept
- Scoring rule voting games and dominance solvability
This page was built for publication: Admissibility in Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5456469)
