Thumbnail - Request a copy

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

Lang, Jérôme; Slavkovik, Marija (2014), How Hard is it to Compute Majority-Preserving Judgment Aggregation Rules?, in Schaub, Torsten; Friedrich, Gerhard; O'Sullivan, Barry, ECAI'14 Proceedings of the Twenty-first European Conference on Artificial Intelligence, Ios Press : Amsterdam, p. 501-506. 10.3233/978-1-61499-419-0-501

Type
Communication / Conférence
Date
2014
Conference title
21st European Conference on Artificial Intelligence (ECAI'14)
Conference date
2014-08
Conference city
Prague
Conference country
Czech Republic
Book title
ECAI'14 Proceedings of the Twenty-first European Conference on Artificial Intelligence
Book author
Schaub, Torsten; Friedrich, Gerhard; O'Sullivan, Barry
Publisher
Ios Press
Published in
Amsterdam
ISBN
978-1-61499-418-3
Number of pages
1232
Pages
501-506
Publication identifier
Metadata
Show full item record
Author(s)
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Slavkovik, Marija
Department of Information Science and Media Studies [Bergen] [UiB]
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.
Subjects / Keywords
social choice