• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

How Hard is it to Compute Majority-Preserving Judgment Aggregation Rules?

Thumbnail
Date
2014
Dewey
Recherche opérationnelle
Sujet
social choice
DOI
http://dx.doi.org/10.3233/978-1-61499-419-0-501
Conference name
21st European Conference on Artificial Intelligence (ECAI'14)
Conference date
08-2014
Conference city
Prague
Conference country
Czech Republic
Book title
ECAI'14 Proceedings of the Twenty-first European Conference on Artificial Intelligence
Author
Schaub, Torsten; Friedrich, Gerhard; O'Sullivan, Barry
Publisher
Ios Press
Publisher city
Amsterdam
Year
2014
Pages number
1232
ISBN
978-1-61499-418-3
URI
https://basepub.dauphine.fr/handle/123456789/16450
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Slavkovik, Marija
status unknown
Type
Communication / Conférence
Item number of pages
501-506
Abstract (EN)
Several recent articles have studied judgment aggregation rules under the point of view of the normative properties they satisfy. However, a further criterion to choose between rules is their computational complexity. Here we review a few rules already proposed and studied in the literature, and identify the complexity of computing the outcome.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.