Approval-based apportionment

Journal article

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by casting approval ballots. This approval-based apportionment setting generalizes traditional apportionment and is a natural restriction of approval-based multiwinner elections, where approval ballots range over individual candidates instead of parties. Using techniques from both apportionment and multiwinner elections, we identify rules that generalize the D’Hondt apportionment method and that satisfy strong axioms which are generalizations of properties commonly studied in the apportionment literature. In fact, the rules we discuss provide representation guarantees that are currently out of reach in the general setting of multiwinner elections: First, we show that core-stable committees are guaranteed to exist and can be found in polynomial time. Second, we demonstrate that extended justified representation is compatible with committee monotonicity (also known as house monotonicity).

Authors: Brill, M; Gölz, P; Peters, D; Schmidt-Kraepelin, U; Wilker, K

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Journal: Mathematical Programming
• Volume: 203
• Issue: 1-2
• Pages: 77-105
• Publication date: 2022-07-26
• DOI: 10.1007/s10107-022-01852-1
• EISSN: 1436-4646
• ISSN: 0025-5610
• Language: English
• Keywords: Apportionment; Core (optical fiber); Law; Representation (politics); Computer science; Operations research; Monotonic function; Politics; Axiom; Mathematical economics; Mathematics; Political science; Generalization