2000 character limit reached
Committees providing EJR can be computed efficiently (1704.00356v3)
Published 2 Apr 2017 in cs.GT and cs.CC
Abstract: We identify a whole family of approval-based multi-winner voting rules that satisfy PJR. Moreover, we identify a subfamily of voting rules within this family that satisfy EJR. All these voting rules can be computed in polynomial time as long as the subalgorithms that characterize each rule within the family are polynomial. One of the voting rules that satisfy EJR can be computed in $O(n m k)$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.