Control of Condorcet voting: complexity and a relation-algebraic approach
From MaRDI portal
Publication:319803
DOI10.1016/j.ejor.2015.04.025zbMath1346.91069OpenAlexW1887172536MaRDI QIDQ319803
Henning Schnoor, Rudolf Berghammer
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.025
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Computing the minimal covering set
- Anyone but him: the complexity of precluding an alternative
- Single transferable vote resists strategic voting
- How hard is it to control an election?
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Extending Condorcet's rule
- Tournament solutions and majority voting
- Exact complexity of the winner problem for Young elections
- Computing tournament solutions using relation algebra and RelView
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- When are elections with few candidates hard to manipulate?
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Manipulation of Voting Schemes: A General Result
- Exact analysis of Dodgson elections
- Automated Verification of Relational While-Programs
- Computer Algebra in Scientific Computing
This page was built for publication: Control of Condorcet voting: complexity and a relation-algebraic approach
