Computing kemeny rankings from \(d\)-Euclidean preferences

DOI10.1007/978-3-030-87756-9_10OpenAlexW3209212397MaRDI QIDQ2695434

Anna Rapberger, Thekla Hamm, Martin Lackner

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

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

Related Items (1)

Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Experiments with Kemeny ranking: What works when?
• The complexity of Kemeny elections
• Recognizing one-dimensional Euclidean preference profiles
• Euclidean preferences
• Tackling the rank aggregation problem with evolutionary algorithms
• Algorithms for media
• On the complexity of crossings in permutations
• Fixed-parameter algorithms for Kemeny rankings
• Voting schemes for which it can be difficult to tell who won the election
• A new approach for identifying the Kemeny median ranking
• Multiple genome rearrangement by swaps and by element duplications
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
• A Consistent Extension of Condorcet’s Election Principle
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• Preferences Single-Peaked on a Circle
• Geometric median in nearly linear time
• Aggregating inconsistent information

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