Computing kemeny rankings from d-Euclidean preferences

DOI10.1007/978-3-030-87756-9_10MaRDI QIDQ2695434zbMATH OpenOpenAlexFDO

Authors Thekla Hamm, Martin Lackner, Anna Rapberger

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-87756-9_10

zbMATH Keywords

computational complexityEuclidean preferencesKemeny's voting rulerank aggregation algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory (91B06) Social choice (91B14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Recommendations

• Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
• Quantification of preferences in the problem of ranking multidimensional alternatives
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• Fixed-parameter algorithms for Kemeny rankings
• Deriving rankings from incomplete preference information: a comparison of different approaches
• Comparing ranking methods: complete RCI preference and multiplicative preference relations
• Strategyproof and efficient preference aggregation with Kemeny-based criteria

Cites work

• A Consistent Extension of Condorcet’s Election Principle
• A new approach for identifying the Kemeny median ranking
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• Advances in the spatial theory of voting.
• Aggregating inconsistent information: ranking and clustering
• Algorithms for media
• Axiomatic foundations for ranking systems
• Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Euclidean preferences
• Experiments with Kemeny ranking: What works when?
• Fixed-parameter algorithms for Kemeny rankings
• Geometric median in nearly linear time
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• Multiple genome rearrangement by swaps and by element duplications
• On the complexity of crossings in permutations
• On the Shoshan-Zwick algorithm for the all-pairs shortest path problem
• Preferences Single-Peaked on a Circle
• Recognizing one-dimensional Euclidean preference profiles
• Tackling the rank aggregation problem with evolutionary algorithms
• The complexity of Kemeny elections
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(2)

• Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances

This page was built for publication: Computing kemeny rankings from \(d\)-Euclidean preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695434)