Pages that link to "Item:Q1357404"
From MaRDI portal
The following pages link to Order independence for iterated weak dominance (Q1357404):
Displayed 38 items.
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Cournot tâtonnement and dominance solvability in finite games (Q423893) (← links)
- A note on pre-play communication (Q523513) (← links)
- Generalized reinforcement learning in perfect-information games (Q524974) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- On the equivalence of weak dominance and sequential best response (Q705862) (← links)
- Ranking games (Q835803) (← links)
- The power of paradox: some recent developments in interactive epistemology (Q878162) (← links)
- Intrinsic correlation in games (Q938054) (← links)
- Self-admissible sets (Q969128) (← links)
- Dominance solvability of dynamic bargaining games (Q971896) (← links)
- Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting (Q1024769) (← links)
- A learning approach to auctions (Q1270753) (← links)
- Conditional dominance, rationalizability, and game forms (Q1277087) (← links)
- Adaptive learning and iterated weak dominance (Q1288242) (← links)
- A general solution to King Solomon's dilemma (Q1288243) (← links)
- How proper is sequential equilibrium? (Q1357403) (← links)
- Undominated equilibria in games with strategic complementarities (Q1367682) (← links)
- When are plurality rule voting games dominance-solvable? (Q1420512) (← links)
- Corrigendum: Order independence for iterated weak dominance (Q1577965) (← links)
- Dominance solvable English matching auctions. (Q1867792) (← links)
- Language and coordination games (Q2059053) (← links)
- Iterated dominance revisited (Q2059064) (← links)
- The trembling chairman paradox (Q2078032) (← links)
- Characterising scoring rules by their solution in iteratively undominated strategies (Q2168539) (← links)
- Iterated elimination procedures (Q2205992) (← links)
- On the outcome equivalence of backward induction and extensive form rationalizability (Q2259412) (← links)
- Evolutionary selection against iteratively weakly dominated strategies (Q2273937) (← links)
- Revenue comparison of discrete private-value auctions via weak dominance (Q2318124) (← links)
- The role of aggregate information in a binary threshold game (Q2417363) (← links)
- Scoring rule voting games and dominance solvability (Q2452252) (← links)
- Iterated strict dominance in general games (Q2462288) (← links)
- Iterated weak dominance and subgame dominance (Q2571919) (← links)
- Menu mechanisms (Q2675411) (← links)
- AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE (Q5406292) (← links)
- Iterated bounded dominance (Q6140028) (← links)
- Order independence for rationalizability (Q6148581) (← links)
- Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games (Q6199594) (← links)