Thumbnail - Request a copy

Single-Peaked Consistency and its Complexity

Escoffier, Bruno; Lang, Jérôme; Ozturk, Meltem (2008), Single-Peaked Consistency and its Complexity, in Spyropoulos, Constantine D., ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, 2008, Proceedings, IOS Press : Amsterdam, p. 366-370

Type
Communication / Conférence
Date
2008
Conference country
GREECE
Book title
ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, 2008, Proceedings
Book author
Spyropoulos, Constantine D.
Publisher
IOS Press
Published in
Amsterdam
ISBN
978-1-58603-891-5
Pages
366-370
Metadata
Show full item record
Author(s)
Escoffier, Bruno

Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ozturk, Meltem
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.
Subjects / Keywords
preference aggregation; single-peakedness