Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
Jiehua Chen, Christian Hatschka

TL;DR
This paper introduces a unified cooperative-game framework to analyze the stability of multi-winner approval voting rules under utility transfer models, exploring core existence and computation.
Contribution
It formalizes multi-winner voting as a cooperative game with transferable and non-transferable utilities, studying core properties across several voting rules.
Findings
NTU-core aligns with prior core-stable committees for PAV/approval utility.
TU-core for multi-winner voting is introduced and analyzed.
The paper provides insights into core existence and computational aspects for four voting rules.
Abstract
Multi-winner approval voting selects a size- committee that aggregates voters' approval preferences over a set of alternatives. A central question is coalitional stability: No coalition should be able to pick a committee -- of size at most its proportional share -- under which every coalition member has strictly more approved alternatives. This notion, introduced by Aziz et al. (2017) as core-stable committees, is naturally interpreted as a core notion with non-transferable utility. We introduce multi-winner voting games, a cooperative-game framework that unifies prior work and supports a systematic study of two utility-transfer models across different voting rules. Players are voters. Each coalition has a proportional seat cap and may only propose admissible committees up to that size. Fixing a multi-winner rule, each admissible committee induces a utility vector for the members…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
