An Algorithmic View of Voting

DOI10.1137/15M1046915zbMath1414.91126MaRDI QIDQ2827491

D. Sivakumar, Mohammad Mahdian, Ronald Fagin, Ravi Kumar, Erik Vee

Publication date: 20 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

social choiceapproximation algorithmsrank aggregation

Mathematics Subject Classification ID

Voting theory (91B12) Approximation algorithms (68W25) Social choice (91B14)

Related Items (4)

Rank aggregation: new bounds for MCx ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Voting Procedures, Complexity of ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of Kemeny elections
• Voting schemes for which it can be difficult to tell who won the election
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• A Consistent Extension of Condorcet’s Election Principle
• Rank Aggregation: Together We're Strong
• THE TREATMENT OF TIES IN RANKING PROBLEMS
• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments

This page was built for publication: An Algorithmic View of Voting