# Committees providing EJR can be computed efficiently

arXiv: https://arxiv.org/abs/1704.00356 · HTML: https://mlsanity.com/paper/1704.00356/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Apr 2017.

## Built on by (most cited first, 1 of 1)

- [Data as Voters: Core Set Selection Using Approval-Based Multi-Winner Voting](https://mlsanity.com/paper/2304.09995/) (2023)

## Abstract (arXiv)

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