A Polynomial-time Algorithm to Achieve Extended Justified Representation
Computer Science and Game Theory
2017-03-31 v1 Data Structures and Algorithms
Abstract
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 to be selected. In particular we focus on the axiomatic property called extended justified representation (EJR). Although a committee satisfying EJR is guaranteed to exist, the computational complexity of finding such a committee has been an open problem and explicitly mentioned in multiple recent papers. We settle the complexity of finding a committee satisfying EJR by presenting a polynomial-time algorithm for the problem. Our algorithmic approach may be useful for constructing other voting rules in multi-winner voting.
Cite
@article{arxiv.1703.10415,
title = {A Polynomial-time Algorithm to Achieve Extended Justified Representation},
author = {Haris Aziz and Shenwei Huang},
journal= {arXiv preprint arXiv:1703.10415},
year = {2017}
}