# Query-Based Committee Selection

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

## Key facts

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

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

- [Efficient Ensemble Selection from Binary and Pairwise Feedback](https://mlsanity.com/paper/2605.09588/) (2026)

## Abstract (arXiv)

Purpose: Multiwinner voting rules typically require full knowledge of voter preferences, which becomes impractical in large-scale or attention-limited settings. This paper investigates how accurately a winning committee can be approximated when voter preferences are elicited using a limited budget of structured queries. Methods: We introduce a query-based framework for multiwinner elections in which voter preferences are elicited through refinement queries over subsets of candidates under a limited budget. We analyse several cost functions that model the cognitive effort needed to answer such queries, propose axiomatic properties for evaluating them, and experimentally evaluate simple query-based committee selection rules across multiple election models. Results: Experimental results show that strategies based on recursively splitting candidate sets provide the best trade-off between elicitation cost and committee accuracy. Across several statistical models, these strategies approximate the outcome of k-Borda elections significantly more efficiently than alternative query types. Conclusion: The results demonstrate that well-designed query strategies can substantially reduce the amount of preference information required while still producing high-quality committee outcomes, suggesting that query-based elicitation is a promising approach for scalable multiwinner decision-making.