Dominance Solvable Voting Schemes: A Comment
From MaRDI portal
Cited in
(8)- Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting
- Dominance elimination procedures on finite alternative games
- Chess-like games are dominance solvable in at most two steps
- Non-cooperative implementation: A survey of recent results
- Iterated weak dominance in strictly competitive games of perfect information.
- The role of aggregate information in a binary threshold game
- Iterated weak dominance and subgame dominance
- Dominance solvability of dynamic bargaining games
This page was built for publication: Dominance Solvable Voting Schemes: A Comment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3930967)