Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
Eliciting single-peaked preferences using comparison queries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Information and Computation
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Clone structures in voters' preferences
Proceedings of the 13th ACM Conference on Electronic Commerce
Triadic consensus: a randomized algorithm for voting in a crowd
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Empirical analysis of plurality election equilibria
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Kemeny elections with bounded single-peaked or single-crossing width
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Multi-dimensional single-peaked consistency and its approximations
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Multiwinner elections under preferences that are single-peaked on a tree
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
Single-peaked preferences over multidimensional binary alternatives
Discrete Applied Mathematics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is single-peakedness. In this paper we focus on the problem of determining whether a given profile is single-peaked with respect to some axis, and on the computation of such an axis. This problem has already been considered in [2]; we give here a more efficient algorithm and address some related issues, such as the number of orders that may be compatible with a given profile, or the communication complexity of preference aggregation under the single-peakedness assumption.