When are plurality rule voting games dominance-solvable?
From MaRDI portal
Publication:1420512
DOI10.1016/S0899-8256(03)00050-2zbMath1069.91002WikidataQ70743404 ScholiaQ70743404MaRDI QIDQ1420512
Publication date: 2 February 2004
Published in: Games and Economic Behavior (Search for Journal in Brave)
Related Items
The chairman's paradox revisited, Bargaining through approval, Can the majority lose the election?, Strong and coalition-proof political equilibria under plurality and runoff rule, Multi-stage voting, sequential elimination and Condorcet consistency, Iterative voting and acyclic games, Costly voting with multiple candidates under plurality rule, Cognitive hierarchy and voting manipulation in \(k\)-approval voting, The trembling chairman paradox, Characterising scoring rules by their solution in iteratively undominated strategies, Implementation of Jefferson-d'Hondt rule in the formation of a parliamentary committee, Weak undominance in scoring rule elections, Gibbard-Satterthwaite games for \(k\)-approval voting rules, On stable outcomes of approval, plurality, and negative plurality games, Extreme voting under proportional representation: the multidimensional case, Scoring rule voting games and dominance solvability, The Basic Approval Voting Game, Equilibria of Plurality Voting: Lazy and Truth-Biased Voters
Cites Work
- Unnamed Item
- Unnamed Item
- Tremples in the Bayesian foundations of solution concepts of games
- Order independence for iterated weak dominance
- Maximum games, dominance solvability, and coordination
- Comparison of scoring rules in Poisson voting games
- On the dominance solvability of large Cournot games
- Sophisticated voting and equilibrium refinements under plurality rule
- An experimental study of voting rules and polls in three-candidate elections
- Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model
- An Economic Model of Representative Democracy
