PP-2014-13: Endriss, Ulle and de Haan, Ronald and Szeider, Sefan (2014) Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. [Report]
Preview |
Text (Full Text)
PP-2014-13.text.pdf Download (420kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2014-13.abstract.txt Download (1kB) |
Abstract
Many problems arising in computational social choice are of high
computational complexity, and some are located at higher levels of the
Polynomial Hierarchy. We argue that a parameterized complexity
analysis provides a lot of insight about the factors contributing to
the complexity of these problems, and can lead to practically useful
algorithms. As a case study, we consider the problem of agenda safety
in judgment aggregation, consider several natural parameters for this
problem, and determine the parameterized complexity for each of
these. Our analysis is aimed at obtaining fixed-parameter tractable
(fpt) algorithms that use a small number of calls to a SAT solver. We
hope that this work may initiate a structured parameterized complexity
investigation of problems arising in the field of computational social
choice that are located at higher levels of the Polynomial
Hierarchy. A by-product of our case study is the development of
complexity-theoretic techniques to provide lower bounds on the number
of SAT calls needed by fpt-algorithms to solve certain problems.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2014-13 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2014 |
| Uncontrolled Keywords: | computational social choice; judgment aggregation; parameterized complexity |
| Subjects: | Computation |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/501 |
Actions (login required)
 |
View Item |
