On swap-distance geometry of voting rules.
Svetlana ObraztsovaEdith ElkindPiotr FaliszewskiArkadii M. SlinkoPublished in: AAMAS (2013)
Keyphrases
- scoring rules
- computationally hard
- computational social choice
- relative position
- information retrieval
- cartesian product
- voting rules
- euclidean distance
- distance measure
- graph cuts
- distance function
- partial order
- three dimensional
- multi dimensional
- simulated annealing
- geodesic distance
- rank aggregation
- special case
- computational complexity
- data structure
- machine learning