Papers › Apportionment with Weighted Seats
Apportionment with Weighted Seats
Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Apportionment is the task of assigning resources to entities with different entitlements in a fair manner, and specifically a manner that is as proportional as possible. The best-known application is the assignment of parliamentary seats to political parties based on their share in the popular vote. Here we enrich the standard model of apportionment by associating each seat with a weight representing the (objective) value of that seat. A seat's weight reflects the fact that different seats might come with different roles, such as chair or treasurer. We define several apportionment methods and natural fairness requirements for this new setting, and we study the extent to which our methods satisfy these requirements. Our findings show that full fairness is harder to achieve than in the standard apportionment setting. Yet, for several natural relaxations of those requirements we can achieve stronger results than in the more expressive model of fair division with entitlements, where the values of objects are subjective.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections