Computational Complexity of Testing Proportional Justified Representation

12/20/2016
by   Haris Aziz, et al.
0

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are selected. Aziz et al. (2015) proposed two representation axioms called justified representation and extended justified representation. Whereas the former can be tested as well as achieved in polynomial time, the latter property is coNP-complete to test and no polynomial-time algorithm is known to achieve it. Interestingly, Sánchez-Fernández et al. (2016) proposed an intermediate property called proportional justified representation that admits a polynomial-time algorithm to achieve. The complexity of testing proportional justified representation has remained an open problem. In this paper, we settle the complexity by proving that testing proportional justified representation is coNP-complete. We complement the complexity result by showing that the problem admits efficient algorithms if any of the following parameters are bounded: (1) number of voters (2) number of candidates (3) maximum number of candidates approved by a voter (4) maximum number of voters approving a given candidate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2022

Partial Vertex Cover on Graphs of Bounded Degeneracy

In the Partial Vertex Cover (PVC) problem, we are given an n-vertex grap...
research
02/25/2018

The Complexity of the Possible Winner Problem over Partitioned Preferences

The Possible-Winner problem asks, given an election where the voters' pr...
research
02/03/2023

Robust and Verifiable Proportionality Axioms for Multiwinner Voting

When selecting a subset of candidates (a so-called committee) based on t...
research
05/26/2023

Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery

Determining the complexity of election attack problems is a major resear...
research
09/11/2015

Multi-Attribute Proportional Representation

We consider the following problem in which a given number of items has t...
research
10/16/2020

Proportional Representation under Single-Crossing Preferences Revisited

We study the complexity of determining a winning committee under the Cha...
research
07/07/2022

The Complexity of Proportionality Degree in Committee Elections

Over the last few years, researchers have put significant effort into un...

Please sign up or login with your details

Forgot password? Click here to reset