The following pages link to Admissibility in Games (Q5456469):
Displayed 21 items.
- 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)
- 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)
- 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)
- Hierarchies of ambiguous beliefs (Q2455662) (← links)
- Iterated strict dominance in general games (Q2462288) (← links)
- Transparent Restrictions on Beliefs and Forward-Induction Reasoning in Games with Asymmetric Information (Q2867522) (← links)
- A Dynamic Analysis of Interactive Rationality (Q3094011) (← links)