Multiwinner Voting with Interval Preferences under Incomplete Information

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under reduced communication. In this paper, we consider voters with one-dimensional preferences: voters and candidates are associated with points in $\mathbb R$, and each voter’s approval set forms an interval of $\mathbb R$. We put forward a probabilistic preference model, where the voter set consists of different groups; each group is associated with a distribution over an interval of $\mathbb R$, so that each voter draws the endpoints of her approval interval from the distribution associated with her group. We present an algorithm for computing committees that provide Proportional Justified Representation + (PJR+), which proceeds by querying voters’ preferences, and show that, in expectation, it makes $\mathcal{O}(\log k)$ queries per voter, where $k$ is the desired committee size.