Isomorphic Distances Among Elections
From MaRDI portal
Publication:5042228
DOI10.1007/978-3-030-50026-9_5OpenAlexW3036344388MaRDI QIDQ5042228
Nimrod Talmon, Piotr Faliszewski, Piotr Skowron, Stanisław Szufa, Arkadii M. Slinko
Publication date: 19 October 2022
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_5
Related Items (2)
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules ⋮ Iterative deliberation via metric aggregation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of Kemeny elections
- Distance rationalization of voting rules
- Anyone but him: the complexity of precluding an alternative
- Voting schemes for which it can be difficult to tell who won the election
- Some measures of closeness to unanimity and their implications
- How hard is it to control an election?
- The computational difficulty of manipulating an election
- Protecting elections by recounting ballots
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Control complexity in Bucklin and fallback voting: an experimental analysis
- On the complexity of achieving proportional representation
- The Impartial, Anonymous, and Neutral Culture Model: A Probability Model for Sampling Public Preference Structures
- Approximate Graph Isomorphism
- When are elections with few candidates hard to manipulate?
- Swap Bribery
- How Hard Is Bribery in Elections?
- Condorcet Social Choice Functions
- Exact analysis of Dodgson elections
- New Approximations for Coalitional Manipulation in Scoring Rules
- Graph Similarity and Approximate Isomorphism
- Handbook of Computational Social Choice
- Robustness among multiwinner voting rules
This page was built for publication: Isomorphic Distances Among Elections
