An algorithmic view of voting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- A Consistent Extension of Condorcet’s Election Principle
- Aggregating inconsistent information: ranking and clustering
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- Rank aggregation: together we're strong
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- The complexity of Kemeny elections
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(11)- An indifference result for social choice rules in large societies
- Voting procedures, complexity of
- Rank aggregation: new bounds for MCx
- Deepest voting: a new way of electing
- scientific article; zbMATH DE number 125601 (Why is no real title available?)
- A note on permutations and rank aggregation
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Voting rules as error-correcting codes
- Voting by eliminating quantifiers
- Multi-agent Systems and Voting: How Similar Are Voting Procedures
- A survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: An algorithmic view of voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827491)