Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Polynomial-time Algorithm to Achieve Extended Justified Representation (1703.10415v1)

Published 30 Mar 2017 in cs.GT and cs.DS

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 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.

Citations (8)

Summary

We haven't generated a summary for this paper yet.