Pages that link to "Item:Q1867561"
From MaRDI portal
The following pages link to Iterated weak dominance in strictly competitive games of perfect information. (Q1867561):
Displaying 10 items.
- 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)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Chess-like games are dominance solvable in at most two steps (Q1593744) (← links)
- An extensive game as a guide for solving a normal game (Q1815193) (← links)
- The role of aggregate information in a binary threshold game (Q2417363) (← links)
- Iterated strict dominance in general games (Q2462288) (← links)
- Iterated weak dominance and subgame dominance (Q2571919) (← links)
- Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games (Q6199594) (← links)
- Well-founded extensive games with perfect information (Q6642563) (← links)
