Optimal Apportionment¶

Allocate a fixed number of electoral seats by minimizing a declared quota discrepancy over feasible integer assignments.

Version: v1 · 2026-10-07 · History
Domain-specific #: 13970
Domain group: Social Sciences
Origin domain: Political Science
Subdomain: Electoral Apportionment → Political Science
Aliases: Optimal electoral apportionment

Core Idea¶

Optimal apportionment assigns a fixed number of whole electoral seats to eligible claimants by minimizing a declared discrepancy from proportional quotas. With total seats \(H\), positive claimant weights \(w_i\), and \(W=\sum_i w_i\), quota \(q_i=Hw_i/W\) is fractional; assigned seats \(a_i\) are integers summing to \(H\) and must obey the election's eligibility and seat bounds. Different objectives can prefer different feasible assignments. “Optimal” therefore needs a named criterion and does not mean universally fairest.[^ref-01ae4a575c32]

Scope of Application¶

The sourced cases are U.S. House seats apportioned among states by population and Germany's 96 European Parliament seats distributed among party or voter lists by votes. U.S. states have a positive-seat floor; German lists can receive zero. Those feasible sets matter when an objective divides by assigned seats. Official pages describe procedures, while Charman separately proves mathematical objective correspondences; the officials do not claim those objectives as their legal rationale.[^{ref-51640d9da9c5][}ref-1c68789395f8][^ref-01ae4a575c32]

Clarity¶

Look for a fixed indivisible seat supply, eligible weighted claimants, exact quotas, feasible whole-seat vectors, a discrepancy objective, and a minimizing assignment or full tied optimizer set. For positive assigned seats, Charman characterizes Huntington–Hill by a sum of squared quota departures divided by \(a_i\). For positive quotas, Webster uses squared departures divided by \(q_i\) and is known in Europe as Sainte-Laguë. The positive factors in his full formulas do not alter the minimizer.[^ref-01ae4a575c32]

A tie need not yield one uniquely selected assignment; report the optimizer set or an additional tie rule. Biró, Kóczy and Sziklai print a nonnegative feasible set but use a departure with \(a_i\) in the denominator. That expression needs a positive-seat restriction or explicit extension before it can be applied to a zero-seat list.[^{ref-01ae4a575c32][}ref-ad5a91f554ab]

Manages Complexity¶

Check legal eligibility and bounds first, then compute quotas, and only then compare feasible assignments under the same objective. Changing the denominator or feasible set changes the optimization problem.[^{ref-01ae4a575c32][}ref-51640d9da9c5][^ref-1c68789395f8]

Abstract Reasoning¶

If two assignments use the same seat total and both satisfy the election's rules, evaluate each under the declared discrepancy. A lower value wins for that criterion; equal values tie. Different criteria can rank them differently.[^ref-01ae4a575c32]

Knowledge Transfer¶

Carry the role test from population-weighted states to vote-weighted lists, but rebuild the vote pool, eligibility, quota denominator, seat bounds, objective and tie convention each time. The portable parents are Optimization and Allocation: this entry minimizes an objective under constraints while assigning a finite supply to claimants. The identity remains electoral and quota-targeted.[^{ref-01ae4a575c32][}ref-51640d9da9c5][^ref-1c68789395f8]

Example¶

U.S. House: The Census Bureau describes Huntington–Hill state-seat allocation using apportionment populations. Each state receives at least one seat. Charman separately characterizes that method through \(\sum_i(a_i-q_i)^2/a_i\) on a positive-seat feasible set. Here \(H\) is the House total, claimants are states, quotas are population shares, and the objective ranks feasible integer seat vectors. Exact ties still need a tie convention or full optimizer set.[^{ref-51640d9da9c5][}ref-01ae4a575c32]

German European Parliament: The Federal Returning Officer describes distributing Germany's 96 seats among lists with Sainte-Laguë/Schepers and no restrictive clause. Charman identifies Sainte-Laguë with Webster and characterizes it by \(\sum_i(a_i-q_i)^2/q_i\) when each considered quota is positive. Lists may receive zero seats while that quota-denominator objective remains defined. The positive-\(a_i\) formula and Bundestag rules do not apply here.[^{ref-1c68789395f8][}ref-01ae4a575c32][^ref-ad5a91f554ab]

Relationships to Other Abstractions¶

Current abstraction Optimal Apportionment Domain-specific

Parents (2) — more general patterns this builds on

Optimal Apportionment is a kind of Allocation Prime

Every admitted case assigns a fixed indivisible seat supply to eligible electoral claimants under a criterion.
Optimal Apportionment is a kind of Optimization Prime

Every admitted case minimizes a specified quota discrepancy over a constrained integer seat vector.

Hierarchy paths (2) — routes to 2 parentless roots

Optimal Apportionment → Allocation → Scarcity → Constraint

Show alternative path (1)

Neighborhood in Abstraction Space¶

Optimal Apportionment sits in a sparse region of the domain-specific corpus (96^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

A fractional quota alone is not a completed seat assignment. An integer apportionment rule without a stated objective is not automatically optimal in this narrower sense. No one discrepancy formula wins every fairness question. A zero-seat case cannot use an \(a_i\)-denominator expression without resolving its domain.[^{ref-01ae4a575c32][}ref-ad5a91f554ab]

References¶

[^ref-01ae4a575c32]: A. E. Charman, The Census and the Second Law, An Entropic Approach to Optimal Apportionment for the U.S. House of Representatives, arXiv:1712.09440v3 (2021). Original title uses a colon after “Law”; comma in linked label is a citation-binder transcription. See §3.2, Appendix E.9 and E.11, and Appendix H.3.2–H.3.5, especially equations 290, 292 and 296. [^ref-51640d9da9c5]: U.S. Census Bureau, Methods of Apportionment, official historical methods page, state-seat introduction and Huntington–Hill section. This source describes the operational U.S. method, not an optimization proof. [^ref-1c68789395f8]: The Federal Returning Officer, Distribution of seats, last updated 21 January 2025, “European Parliament elections” section. The separate Bundestag discussion on this page is not the European Parliament case used here. [^ref-ad5a91f554ab]: P. Biró, L. Á. Kóczy and B. Sziklai, Fair apportionment in the view of the Venice Commission’s recommendation, Mathematical Social Sciences 77 (2015): 32–41, author manuscript, PDF p.7 equation 1 and pp.12–14 §4/Theorem 5. The manuscript's printed nonnegative allotment set and \(a_i\) denominator create an unresolved zero-seat domain issue.