Isomorphic Distances Among Elections
From MaRDI portal
Publication:5042228
DOI10.1007/978-3-030-50026-9_5OpenAlexW3036344388MaRDI QIDQ5042228FDOQ5042228
Authors: Piotr Faliszewski, Piotr Skowron, Stanisław Szufa, Nimrod Talmon, Arkadii 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
Cites Work
- Voting schemes for which it can be difficult to tell who won the election
- Condorcet Social Choice Functions
- The complexity of Kemeny elections
- The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures
- When are elections with few candidates hard to manipulate?
- Some measures of closeness to unanimity and their implications
- Anyone but him: the complexity of precluding an alternative
- How hard is it to control an election?
- The computational difficulty of manipulating an election
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Where are the hard manipulation problems?
- Swap bribery
- How hard is bribery in elections?
- Exact analysis of Dodgson elections
- Handbook of Computational Social Choice
- On the complexity of achieving proportional representation
- Title not available (Why is that?)
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Distance rationalization of voting rules
- Robustness among multiwinner voting rules
- Approximate graph isomorphism
- Graph similarity and approximate isomorphism
- New Approximations for Coalitional Manipulation in Scoring Rules
- Protecting elections by recounting ballots
Cited In (2)
Uses Software
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)
