Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young

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 Θ^p₂-level of the Polynomial Hierarchy (PH). Moreover, we show that the problem has a complexity at the Δ^p₂-level of the PH for the analogue of Tideman's procedure with a fixed tie-breaking rule, and at the Σ^p₂-level of the PH for the analogue of Tideman's procedure without a fixed tie-breaking rule.