The following pages link to Admissibility in Games (Q5456469):
Displayed 50 items.
- Foundations of probability (Q266643) (← links)
- Admissibility and assumption (Q281332) (← links)
- Lexicographic beliefs and assumption (Q281418) (← links)
- A space of lexicographic preferences (Q306732) (← links)
- The context of the game (Q513591) (← links)
- A minimal logic for interactive epistemology (Q516245) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- An algorithm for proper rationalizability (Q550196) (← links)
- The reasoning-based expected utility procedure (Q632953) (← links)
- Dominance-solvable common-value large auctions (Q645636) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- Possibility and permissibility (Q656787) (← links)
- Lexicographic expected utility with a subjective state space (Q663190) (← links)
- Iterated regret minimization: a new solution concept (Q665088) (← links)
- A rational way of playing: revision theory for strategic interaction (Q722022) (← links)
- Epistemically robust strategy subsets (Q725063) (← links)
- On redundant types and Bayesian formulation of incomplete information (Q840689) (← links)
- When do type structures contain all hierarchies of beliefs? (Q844914) (← links)
- Lexicographic probability, conditional probability, and nonstandard probability (Q844918) (← links)
- Universality of the Epstein-Wang type structure (Q844943) (← links)
- An impossibility theorem on beliefs in games (Q863184) (← links)
- The power of paradox: some recent developments in interactive epistemology (Q878162) (← links)
- Rational behavior under correlated uncertainty (Q893394) (← links)
- Weak assumption and iterative admissibility (Q896939) (← links)
- Strategic and structural uncertainty in robust implementation (Q900423) (← links)
- Minimal belief revision leads to backward induction (Q931782) (← links)
- Common knowledge of payoff uncertainty in games (Q934775) (← links)
- Self-admissible sets (Q969128) (← links)
- Common theories (Q1038264) (← links)
- Rationalizability and logical inference (Q1651238) (← links)
- A characterization of Brandenburger-Friedenberg-Keisler's assumption (Q1670160) (← links)
- Perfect forward induction (Q1787717) (← links)
- On the equivalence between iterated application of choice rules and common belief of applying these rules (Q2002344) (← links)
- Comprehensive rationalizability (Q2002361) (← links)
- Epistemic equivalence of extended belief hierarchies (Q2016225) (← links)
- Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information (Q2021790) (← links)
- Language and coordination games (Q2059053) (← links)
- Iterated dominance revisited (Q2059064) (← links)
- Agreeing to disagree with conditional probability systems (Q2098948) (← links)
- Optimism and pessimism in strategic interactions under ignorance (Q2100661) (← links)
- Robust perfect equilibrium in large games (Q2138076) (← links)
- An epistemic characterization of MACA (Q2143888) (← links)
- Strategic reasoning in persuasion games: an experiment (Q2173409) (← links)
- Weak belief and permissibility (Q2178012) (← links)
- Iterated elimination procedures (Q2205992) (← links)
- Iterated admissibility through forcing in strategic belief models (Q2228450) (← links)
- The refined best-response correspondence in normal form games (Q2259419) (← links)
- Evolutionary selection against iteratively weakly dominated strategies (Q2273937) (← links)
- Algorithms for cautious reasoning in games (Q2280049) (← links)
- Strategic cautiousness as an expression of robustness to ambiguity (Q2291171) (← links)