Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences.
Bruno EscoffierOlivier SpanjaardMagdaléna TydrichováPublished in: CoRR (2021)
Keyphrases
- social choice
- np hard
- np complete
- approximation algorithms
- rank aggregation
- optimal solution
- linear programming
- single peaked
- scheduling problem
- special case
- multi dimensional
- lower bound
- np hardness
- computational complexity
- greedy heuristic
- closely related
- preference relations
- voting rules
- worst case
- decision problems
- ranking functions
- half spaces
- preference learning
- computationally feasible
- language model
- multi agent
- multiattribute utility
- soft constraints
- multiple criteria
- euclidean space
- ranked list
- learning to rank
- web search
- multi objective