Computational Complexity of Strong and Average Justified Representation

Abstract

We study the approval-based multiwinner election problem where a set of $n$ voters cast approval-based ballots to a set of $m$ candidates, and we are to select a winner committee consisting of $k$ candidates. We consider two axioms: strong justified representation (SJR) and average justified representation (AJR). A winner committee satisfies SJR if the satisfaction for each voter in every $\ell$-cohesive group is at least $\ell$. AJR is a weaker axiom that requires the average satisfaction for each $\ell$-cohesive group to be at least $\ell$. It is well known that a winner committee satisfying AJR may not exist (and neither does SJR). In this paper, we study the computational complexity of the following decision problem: given an approval-based multiwinner election instance, decide if there exists a winner committee satisfying SJR/AJR. We prove that this problem is $Θ_2^p$-complete for SJR, and $Σ_2^p$-complete for AJR. Our results indicate that the decision problem with SJR is more amenable to SAT-based implementations, whereas the decision problem with AJR is substantially harder. As byproducts, we derive some results that are interesting in their own right. Firstly, we show that adding one more adaptive query to an NP oracle on top of polynomially many non-adaptive NP queries does not add more computational power, and the resulting complexity class is still $Θ_2^p$. Secondly, we construct a set system that can be useful in other applications, especially when doing reductions from typical satisfiability problems such as 3SAT.