Isomorphic Distances Among Elections
From MaRDI portal
Publication:5042228
Cites work
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- Anyone but him: the complexity of precluding an alternative
- Approximate graph isomorphism
- Condorcet Social Choice Functions
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Distance rationalization of voting rules
- Exact analysis of Dodgson elections
- Graph similarity and approximate isomorphism
- Handbook of Computational Social Choice
- How hard is bribery in elections?
- How hard is it to control an election?
- New Approximations for Coalitional Manipulation in Scoring Rules
- On the complexity of achieving proportional representation
- Protecting elections by recounting ballots
- Robustness among multiwinner voting rules
- Some measures of closeness to unanimity and their implications
- Swap bribery
- The complexity of Kemeny elections
- The computational difficulty of manipulating an election
- The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures
- Voting schemes for which it can be difficult to tell who won the election
- When are elections with few candidates hard to manipulate?
- Where are the hard manipulation problems?
Cited in
(2)
This page was built for publication: Isomorphic Distances Among Elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042228)