The Complexity of Proportionality Degree in Committee Elections

07/07/2022
by   Łukasz Janeczko, et al.
0

Over the last few years, researchers have put significant effort into understanding of the notion of proportional representation in committee election. In particular, recently they have proposed the notion of proportionality degree. We study the complexity of computing committees with a given proportionality degree and of testing if a given committee provides a particular one. This way, we complement recent studies that mostly focused on the notion of (extended) justified representation. We also study the problems of testing if a cohesive group of a given size exists and of counting such groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2018

Undecidable word problem in subshift automorphism groups

This article studies the complexity of the word problem in groups of aut...
research
07/11/2019

Time2Vec: Learning a Vector Representation of Time

Time is an important feature in many applications involving events that ...
research
01/23/2018

Quantified Degrees of Group Responsibility (Extended Abstract)

This paper builds on an existing notion of group responsibility and prop...
research
12/21/2022

Count-Free Weisfeiler–Leman and Group Isomorphism

We investigate the power of counting in Group Isomorphism. We first leve...
research
12/20/2016

Computational Complexity of Testing Proportional Justified Representation

We consider a committee voting setting in which each voter approves of a...
research
04/09/2022

Testability in group theory

This paper is a journal counterpart to our FOCS 2021 paper, in which we ...
research
03/28/2022

27 Open Problems in Kolmogorov Complexity

The paper proposes open problems in classical Kolmogorov complexity. Eac...

Please sign up or login with your details

Forgot password? Click here to reset