OpenAlex ·
Learning Proportional Committees from Violation Feedback
- Published
- Source
- OpenAlex
- DOI
- 10.48550/arxiv.2608.30111
- Original
- Read it at the publisher
- Topics
Abstract
We study violation-feedback learning of proportionally representative approval-based committees. In each round, a learner proposes a committee of size $k$. An oracle either accepts the proposal or adversarially selects a representation violation with respect to a single fixed hidden approval profile. We compare \emph{full-witness feedback}, which reveals the violation level, an omitted candidate, and the affected voter group, with \emph{candidate-only feedback}, which reveals only that candidate. The target notions are proportional justified representation plus (PJR+) and extended justified representation plus (EJR+). In every setting we study, the number of rejected proposals can be bounded solely in terms of $k$, with no dependence on the numbers of voters and candidates. For PJR+, the optimal deterministic and randomized rejection complexities equal $k$ under both feedback models. For EJR+, the picture is more nuanced. Under full-witness feedback, we prove an $Ω(k^{3/2})$ deterministic lower bound and give a deterministic polynomial-time algorithm using $O(k^2\log k)$ rejections. Under candidate-only feedback, randomization achieves $O(k^2\log k)$ expected rejections via uniform random deletion, while deterministic exhaustive branching gives a $2^{O(k^2(\log k)^2)}$ rejection bound. Even with full-witness feedback, randomized learners may require $k$ rejections.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.