Pages that link to "Item:Q3140533"
From MaRDI portal
The following pages link to The Complexity of Eliminating Dominated Strategies (Q3140533):
Displaying 19 items.
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- On the order of eliminating dominated strategies (Q911490) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Order independence for iterated weak dominance (Q1357404) (← links)
- Undominated equilibria in games with strategic complementarities (Q1367682) (← links)
- Chess-like games are dominance solvable in at most two steps (Q1593744) (← links)
- Dominant strategy implementability and zero length cycles (Q2074053) (← links)
- Computer science and decision theory (Q2271874) (← links)
- On iterated dominance, matrix elimination, and matched paths (Q3113741) (← links)
- Effort Games and the Price of Myopia (Q3392306) (← links)
- Determinancy with Complicated Strategies (Q3715108) (← links)
- (Q3719380) (← links)
- Elimination of dominated strategies and inessential players (Q4682531) (← links)
- On the hardness of dominant strategy mechanism design (Q6083523) (← links)