Recommendations
Cited in
(93)- Common theories
- Dominated strategies and common knowledge
- Rationalizability and logical inference
- A characterization of Brandenburger-Friedenberg-Keisler's assumption
- Perfect forward induction
- On the equivalence between iterated application of choice rules and common belief of applying these rules
- Comprehensive rationalizability
- Epistemic equivalence of extended belief hierarchies
- Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
- Language and coordination games
- Iterated dominance revisited
- Agreeing to disagree with conditional probability systems
- Optimism and pessimism in strategic interactions under ignorance
- Robust perfect equilibrium in large games
- An epistemic characterization of MACA
- Strategic reasoning in persuasion games: an experiment
- Weak belief and permissibility
- Iterated elimination procedures
- Iterated admissibility through forcing in strategic belief models
- The refined best-response correspondence in normal form games
- Evolutionary selection against iteratively weakly dominated strategies
- Algorithms for cautious reasoning in games
- Strategic cautiousness as an expression of robustness to ambiguity
- Revenue comparison of discrete private-value auctions via weak dominance
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- The role of monotonicity in the epistemic analysis of strategic games
- Characterizing solution concepts in terms of common knowledge of rationality
- The role of aggregate information in a binary threshold game
- Simple mechanisms and preferences for honesty
- On the epistemic foundation for iterated weak dominance: an analysis in a logic of individual and collective attitudes
- Substantive assumptions in interaction: a logical perspective
- Scoring rule voting games and dominance solvability
- Hierarchies of ambiguous beliefs
- Iterated strict dominance in general games
- Foundations of probability
- Coordination via delay: theory and experiment
- Observability, dominance, and induction in learning models
- Admissibility and assumption
- Lexicographic beliefs and assumption
- Transparent restrictions on beliefs and forward-induction reasoning in games with asymmetric information
- A space of lexicographic preferences
- A dynamic analysis of interactive rationality
- The topology-free construction of the universal type structure for conditional probability systems
- The implications of finite‐order reasoning
- Admissibility in Infinite Games
- Admissibility and event-rationality
- scientific article; zbMATH DE number 1222678 (Why is no real title available?)
- scientific article; zbMATH DE number 1796969 (Why is no real title available?)
- Common belief in Choquet rationality and ambiguity attitudes (extended abstract)
- A conceptually well-founded characterization of iterated admissibility using an ``all I know operator
- Beyond admissibility: dominance between chains of strategies
- The context of the game
- A minimal logic for interactive epistemology
- Assume-admissible synthesis
- Logic and Game Theory
- The power of knowledge in games
- An algorithm for proper rationalizability
- Directed lexicographic rationalizability
- The existence of universal qualitative belief spaces
- Common assumption of rationality
- Lexicographic agreeing to disagree and perfect equilibrium
- Cautious belief and iterated admissibility
- Epistemic foundation of the backward induction paradox
- Complete Conditional Type Structures (Extended Abstract)
- The reasoning-based expected utility procedure
- Dominance-solvable common-value large auctions
- On the complexity of iterated weak dominance in constant-sum games
- Possibility and permissibility
- Lexicographic expected utility with a subjective state space
- Iterated regret minimization: a new solution concept
- Complete conditional type structures
- The relationship between strong belief and assumption
- Level-k thinking in the extensive form
- Conditional expressivity and collective deontic admissibility
- Conditional hypothesis testing systems
- Solid outcomes in finite games
- A rational way of playing: revision theory for strategic interaction
- Dominance and optimality
- A logical study of moral responsibility
- Epistemically robust strategy subsets
- Weak* dominance
- On redundant types and Bayesian formulation of incomplete information
- When do type structures contain all hierarchies of beliefs?
- Lexicographic probability, conditional probability, and nonstandard probability
- Universality of the Epstein-Wang type structure
- An impossibility theorem on beliefs in games
- The power of paradox: some recent developments in interactive epistemology
- Rational behavior under correlated uncertainty
- Weak assumption and iterative admissibility
- Strategic and structural uncertainty in robust implementation
- Minimal belief revision leads to backward induction
- Common knowledge of payoff uncertainty in games
- Self-admissible sets
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)
