• 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

A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences

Lang, Jérôme; Xia, Lirong (2009), A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences, IJCAI-09, 21st International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI : Palo Alto (USA), p. 342-347

View/Open
publi1180.pdf (115.5Kb)
Type
Communication / Conférence
Date
2009
Conference country
UNITED STATES
Book title
IJCAI-09, 21st International Joint Conference on Artificial Intelligence
Publisher
AAAI Press / IJCAI
Published in
Palo Alto (USA)
Pages
342-347
Metadata
Show full item record
Author(s)
Lang, Jérôme
Xia, Lirong
Abstract (EN)
Sequential voting rules and correspondences provide a way for agents to make group decisionswhen the set of available options has a multi-issuestructure. One important question about sequentialvoting rules (correspondences) is whether they satisfy two crucial criteria, namely neutrality and efficiency. Recently, Benoit and Kornhauser estab-lished an important result about seat-by-seat votingrules (which are a special case of sequential votingrules): they proved that if the multi-issue domainsatisfies some properties, then the only seat-by-seatrules being either efficient or neutral are dictatorships. However, there are still some cases not covered by their results, including a very importantand interesting case—voting correspondences. Inthis paper, we extend the impossibility theorems byBenoit and Kornhauser to voting correspondences,and obtain a dichotomy theoremon the existence ofefficient or neutral sequential (seat-by-seat) votingrules and correspondences. Therefore, the questionof whether sequential (seat-by-seat) voting rules(correspondences) can be efficient or neutral is nowcompletely answered.
Subjects / Keywords
Sequential voting

Related items

Showing items related by title and author.

  • Thumbnail
    Sequential composition of voting rules in multi-issue domains 
    Lang, Jérôme; Xia, Lirong (2009) Article accepté pour publication ou publié
  • Thumbnail
    Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes 
    Xia, Lirong; Conitzer, Vincent; Lang, Jérôme (2011) Communication / Conférence
  • Thumbnail
    How hard is it to Control Sequential Elections via the Agenda? 
    Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2009) Communication / Conférence
  • Thumbnail
    New candidates welcome! Possible winners with respect to the addition of new candidates 
    Chevaleyre, Yann; Lang, Jérôme; Maudet, Nicolas; Monnot, Jérôme; Xia, Lirong (2012) Article accepté pour publication ou publié
  • Thumbnail
    Voting on multi-issue domains with conditionally lexicographic preferences 
    Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2018) Article accepté pour publication ou publié
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