Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem

DOI10.1016/j.tcs.2021.07.004OpenAlexW3186826618MaRDI QIDQ2072062

Tom Portoleau, Olivier Spanjaard, Hugo Gilbert

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.06226

zbMATH Keywords

computational complexitycomputational social choicegeneralized Kemeny ruleweighted majority graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

In memory of Jérôme Monnot ⋮ A non-utilitarian discrete choice model for preference aggregation

Uses Software

• PrefLib
• PerMallows
• VSRank

Cites Work

• Unnamed Item
• Unnamed Item
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Fixed-parameter algorithms for Kemeny rankings
• Voting schemes for which it can be difficult to tell who won the election
• Assent-maximizing social choice
• NON-NULL RANKING MODELS. I
• Condorcet Social Choice Functions
• A Consistent Extension of Condorcet’s Election Principle
• Ranking Median Regression: Learning to Order through Local Consensus
• Cycles and Intractability in a Large Class of Aggregation Rules
• Reducibility among Combinatorial Problems
• Introduction to the Theory of Voting

This page was built for publication: Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem