A note on strategy elimination in bimatrix games
From MaRDI portal
(Redirected from A note on strategy elimination in bimatrix games)
Recommendations
- The Complexity of Eliminating Dominated Strategies
- Iterated weak dominance in strictly competitive games of perfect information.
- On the order of eliminating dominated strategies
- On the exact polynomial time algorithm for a special class of bimatrix game
- Elimination of dominated strategies and inessential players
Cites work
Cited in
(5)
This page was built for publication: A note on strategy elimination in bimatrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102210)