Cycles and Intractability in a Large Class of Aggregation Rules

DOI10.1613/jair.5657zbMath1440.91017arXiv1608.03999OpenAlexW2792866926MaRDI QIDQ4639018

William S. Zwicker

Publication date: 2 May 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)

Related Items (2)

An axiomatic characterization of the Borda mean rule ⋮ Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem

This page was built for publication: Cycles and Intractability in a Large Class of Aggregation Rules