• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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

Related items

Showing items related by title and author.

  • Thumbnail
    Quelques aspects algorithmiques du raisonnement sur les préférences unimodales 
    Escoffier, Bruno; Lang, Jérôme; Ozturk, Meltem (2008) Communication / Conférence
  • Thumbnail
    Conference Program Design with Single-Peaked and Single-Crossing Preferences 
    Fotakis, Dimitris; Gourvès, Laurent; Monnot, Jérôme (2016) Communication / Conférence
  • Thumbnail
    Bounded Single-Peaked Width and Proportional Representation 
    Cornaz, Denis; Galand, Lucie; Spanjaard, Olivier (2012) Communication / Conférence
  • Thumbnail
    Bounded single-peaked width and proportional representation 
    Cornaz, Denis; Galand, Lucie; Spanjaard, Olivier (2012) Communication / Conférence
  • Thumbnail
    Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions 
    Allouche, Tahar; Escoffier, Bruno; Moretti, Stefano; Ozturk, Meltem (2020) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo