PP-2015-23: Endriss, Ulle and de Haan, Ronald (2015) Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. [Report]
Preview |
Text (Full Text)
PP-2015-23.text.pdf Download (296kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2015-23.abstract.txt Download (1kB) |
Abstract
Judgment aggregation is a collective decision making framework where the opinions of a group of agents is combined into a collective opinion. This can be done using many different judgment aggregation procedures. We study the computational complexity of computing the group opinion for several of the most prominent judgment aggregation procedures. In particular, we show that the complexity of this winner determination problem for analogues of the Kemeny rule, the Slater rule and the Young rule lies at the \Theta_2^p-level of the Polynomial Hierarchy (PH). Moreover, we show that the problem has a complexity at the \Delta_2^p-level of the PH for the analogue of Tideman's procedure with a fixed tie-breaking rule, and at the \Sigma_2^p-level of the PH for the analogue of Tideman's procedure without a fixed tie-breaking rule.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2015-23 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2015 |
| Uncontrolled Keywords: | computational social choice, judgment aggregation, computational 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/534 |
Actions (login required)
 |
View Item |
