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 chooses whole electoral seats for eligible claimants by minimizing one declared discrepancy between the integer assignment and proportional quotas. If the fixed total is \(H\), eligible claimant \(i\) has a positive population or vote weight \(w_i\), and \(W=\sum_i w_i\), its exact quota is \(q_i=Hw_i/W\). An assignment \(a_i\) has whole numbers of seats with \(\sum_i a_i=H\) and must also satisfy the election's eligibility and seat bounds. The objective specifies which of the generally unavoidable quota departures matters. Different objectives can select different assignments; “optimal” alone does not name a uniquely fair rule.^[1]^[2]^[3]

The U.S. Census Bureau documents a population-based House procedure using Huntington–Hill. Charman separately gives a mathematical characterization of that method by an assigned-seat-weighted squared quota departure. The German Federal Returning Officer documents Sainte-Laguë/Schepers for its 96 European Parliament seats; Charman separately connects Sainte-Laguë with Webster and a quota-weighted squared objective. Those official descriptions are evidence of procedures, not official endorsements of the mathematical objectives or universal fairness conclusions.^[2]^[3]^[1]

Structural Signature¶

Signature: fixed integer seat total + eligible claimants and weights + exact proportional quotas + feasible integer assignments + declared discrepancy objective → minimizing assignment or tied optimizer set.

Fixed integer seat total. \(H\) specifies how many indivisible seats are available. Without a fixed integer total, this is a different allocation question.^[1]
Eligible claimants and entitlement weights. State populations or list votes give the relevant shares, subject to the actual election's eligibility rule. Without a weighted claimant set, there is no proportional target.^[2]^[3]
Proportional quota vector. \(q_i=Hw_i/W\) expresses exact fractional entitlements within the defined set. The quotas are targets, not already assigned seats.^[1]
Feasible integer assignments. The \(a_i\) sum to \(H\) and obey applicable floors, ceilings and eligibility. U.S. states receive at least one seat; a German European Parliament list can receive zero.^[2]^[3]
Declared discrepancy objective. A specified function ranks feasible assignments. Its denominator must be defined on that set, and exact ties need an optimizer-set or tie convention.^[1]^[4]
Optimizer and method correspondence. Comparing feasible vectors identifies a minimizer or tied minimizers. A named procedure may have an objective characterization under stated assumptions; its legal operation and the proof of that characterization are distinct claims.^[1]^[2]^[3]

What It Is Not¶

A proportional quota calculation by itself is not optimal apportionment: fractional \(q_i\) still has to become a feasible integer vector under a stated objective. An ordinary rounding or divisor procedure without an identified objective can be a valid apportionment, but calling it optimal requires an objective and its scope. This entry is not a claim that Hamilton, Webster, Huntington–Hill, Adams or a later leximin proposal universally wins every fairness test.^[1]^[4]

It is also not the live Proportionality Prime. That Prime concerns a normative legal fit between an intervention and justified aim; numerical population-to-seat or vote-to-seat proportions do not supply its full signature. Nor is this a generic allocation of any scarce good: the supported identity is electoral integer seats against proportional entitlements.

Scope of Application¶

The directly supported settings are seats among U.S. states weighted by population and German European Parliament seats among eligible party or voter lists weighted by votes. The former has a positive state-seat floor; the latter's official description has 96 seats and no restrictive clause, so a list may receive zero. These differences change the feasible set and which denominator-based objectives can be used without a new convention.^[2]^[3]^[1]

Charman describes several optimization families under their own assumptions. Biró, Kóczy and Sziklai analyze a relative constituency-size departure and a leximin treatment, but their printed feasible set allows zero seats while the displayed departure divides by \(a_i\). That zero-domain gap must be resolved before applying their expression to a zero-seat list. Their 2013 Bundestag context does not supply the rules for the German European Parliament example here, nor do later Bundestag eligibility rules.^[1]^[4]^[3]

Clarity¶

The choice of objective is visible rather than hidden in the word “fair.” Charman's Appendix H characterizes Huntington–Hill by \(\sum_i(a_i-q_i)^2/a_i\) for positive \(a_i\), Webster by \(\sum_i(a_i-q_i)^2/q_i\) for positive \(q_i\), and Hamilton by an unweighted squared departure under its stated constraints. Adams has a different minimax characterization in Appendix E.9. Changing denominator or criterion changes the question being solved; formulas cannot be moved across feasible sets without checking their domains.^[1]

An exact tie may leave more than one minimizing assignment. The answer should then be the optimizer set or an allocation selected by a separately stated tie rule. Nothing in the shared identity guarantees uniqueness, a quota property or monotonicity for every objective.^[1]^[4]

Manages Complexity¶

The six-role test keeps three kinds of rule apart: legal eligibility and bounds, mathematical discrepancy, and selection of an optimizer. One can inspect a disputed seat result by first checking the claimant weights and quotas, then whether the assignment is feasible, and only then whether it minimizes the declared objective. A failure at one stage cannot be repaired by citing a success at another.^[1]^[2]^[3]

The model also makes denominator restrictions checkable before calculation. The U.S. positive-seat floor is compatible with an \(a_i\) denominator. German lists can have zero seats, so a ratio using \(a_i\) needs an explicit positive restriction or extension; Webster's \(q_i\) denominator remains defined for positive-vote eligible lists even when \(a_i=0\).^[1]^[3]^[4]

Abstract Reasoning¶

Suppose two feasible vectors both sum to \(H\). Instead of asking which is “more proportional” without qualification, compute their values under the same declared discrepancy function and the same bounds. A lower value identifies a better vector for that function; equal values are a tie. Repeating the comparison with a different function can yield a different ranking without logical inconsistency, because the evaluative question has changed.^[1]

One can test a proposed objective-method correspondence by asking whether every output of the procedure minimizes the objective over the specified feasible set, including boundary cases and ties. Charman's Huntington–Hill and Webster results support correspondences under their hypotheses. The Census and Federal Returning Officer pages establish what the respective authorities describe operationally; they do not themselves prove the mathematical equivalences.^[1]^[2]^[3]

Knowledge Transfer¶

The role structure transfers between unlike electoral carriers: population-weighted states with a one-seat floor and vote-weighted lists that can receive zero. For each new election, re-establish the eligible claimants, weights, exact quota denominator, legal bounds, chosen objective and tie treatment. The U.S. floor, German 96-seat total and German absence of a restrictive clause are case accents, not interchangeable universal rules.^[2]^[3]

The broader optimization and allocation relations travel beyond elections, which explains the two strict Prime parents. The named specialist identity does not automatically transfer to non-electoral resource allocation; this source set provides no second verified non-electoral carrier for it. A claim that one discrepancy is best in every jurisdiction would also require evidence beyond the correspondences cited here.^[1]^[4]

Examples¶

Canonical: U.S. House state seats under Huntington–Hill¶

The Census Bureau describes assigning House seats among states using population and the Huntington–Hill method. The modeled problem fixes the House total and respects a positive seat for each state. Charman, independently of that operational account, characterizes Huntington–Hill through a sum of squared departures divided by the assigned seats, so its denominator is defined in this positive-seat setting. The official page documents the procedure; Charman supplies the objective correspondence under mathematical constraints.^[2]^[1]

Mapped back: the fixed integer seat total is the House size \(H\); eligible claimants and weights are states and their apportionment populations; quotas are population shares multiplied by \(H\); feasible assignments are positive state seat counts summing to \(H\) under applicable bounds; the declared objective is Charman's \(\sum_i(a_i-q_i)^2/a_i\); the optimizer/method correspondence is Huntington–Hill under that characterization, with a tie convention or full optimizer set needed for exact ties.^[2]^[1]

Applied: German European Parliament lists under Sainte-Laguë/Schepers¶

The Federal Returning Officer describes allocating Germany's 96 European Parliament seats among party and voter lists by the Sainte-Laguë/Schepers method and reports no restrictive clause for this election. The mathematical bridge is separate: Charman identifies Sainte-Laguë with Webster and characterizes Webster by a squared departure weighted by the quota, provided each considered vote quota is positive. This does not mean German election law names that objective.^[3]^[1]

Mapped back: the fixed total is 96 seats; claimants and weights are the eligible lists and their votes; quotas are list vote shares times 96 within the defined vote pool; feasible assignments are nonnegative list seat counts summing to 96, including possible zero counts; the declared objective in the separate Charman characterization is \(\sum_i(a_i-q_i)^2/q_i\) for positive \(q_i\); the optimizer/method correspondence relates official Sainte-Laguë/Schepers to Webster, subject to the mathematical hypotheses and exact ties. No positive-\(a_i\) Huntington–Hill or Biró ratio is imported into this zero-seat case.^[3]^[1]^[4]

Structural Tensions¶

Criterion choice versus a single fairness label. Absolute, quota-weighted and assigned-seat-weighted departures give different weight to claimants of different size and can select different feasible vectors. Declaring one criterion makes the optimization checkable, while presenting its winner as simply “fairest” suppresses the value choice. The consequence is practical: compare allocations under named criteria and report when their rankings diverge, rather than treating objective-specific optimality as a universal verdict. Charman discusses alternative methods; no all-jurisdiction ranking follows.^[1]

Feasible-set breadth versus denominator domain is a scope diagnostic, not an intrinsic second tradeoff. A positive-seat rule allows an \(a_i\) denominator; a zero-seat list rule does not, absent an extension. Restricting a case to positive seats merely to make a formula work changes its legal feasible set. Biró's displayed nonnegative set and positive-denominator departure illustrate why the domain has to be checked explicitly.^[1]^[4]

Structural–Framed Character¶

The relation is structural within an institutionally framed choice. Its fixed total, quotas, feasible integer vectors, objective and minimizing assignment can be stated mathematically across cases. Evaluative weight: choosing a discrepancy encodes one criterion for what differences matter; minimization does not itself make that criterion uniquely fair. Human-practice dependence: the relevant claimants, vote or population inputs, legal bounds and tie treatment come from electoral practice. Institutional origin: a House or electoral authority defines seats and eligibility; the mathematical characterization can be studied separately from its official procedure. Vocabulary travel: “optimal allocation” is broad, but the named electoral apportionment claim needs quota-targeted whole seats. Import versus recognition: an analyst may recognize an objective characterization of an established method without claiming the authority adopted that objective as its rationale. Its character: a portable optimization-and-allocation structure applied to bounded electoral seat institutions, with its fairness interpretation and feasibility supplied by those institutions.^[1]^[2]^[3]

Structural Core vs. Domain Accent¶

The portable skeleton has two already-live Prime relations. Optimization supplies integer variables, an objective, constraints and a global or tied solution. Allocation supplies a fixed indivisible supply, claimants, feasibility, an assignment and a criterion. Both are necessary here and neither subsumes the other in the live catalog. Remove optimization and a procedure can still assign seats; remove allocation and an objective can still minimize something else. The child combines both with proportional electoral quotas.^[1]

The domain accent is who has a seat claim, how population or votes form exact entitlements, which election's rules constrain assignments, and what fairness objective is declared. Two unlike elections remain inside this specialist institutional practice, so the named entry does not yet clear the Prime bar. A future Prime review would need independently verified non-electoral carriers of quota-targeted integer allocation with the same necessary roles, rather than promoting the electoral label from these two examples. The live Proportionality Prime is a legal normative test and supplies no direct numerical parent edge.

This entry is a kind of Allocation and is a kind of Optimization.

The two strict subsumption edges are Optimization and Allocation. The U.S. and German cases both contain full decision variables, objective, constraints and optimizer, plus finite seat supply, eligible claimants, feasibility and an assignment. Optimization can optimize a non-allocation problem; Allocation can distribute a supply without quota-discrepancy minimization, so both edges carry distinct information.^[1]^[2]^[3]

A numeric entitlement ratio should not be mistaken for the live Proportionality Prime's normative legal fit test. Named Hamilton, Webster, Huntington–Hill and Adams methods are nearby procedural characterizations, not extra strict parents asserted from a shared word. Biró's leximin variant remains source-bounded by its positive-denominator gap.^[1]^[4]

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¶

Proportional quotas: fractional targets \(q_i\), not a completed whole-seat assignment.
Ordinary apportionment: an integer seat procedure without a declared objective and feasible-set optimization claim.
One universal fairness formula: the selected objective determines what “optimal” means in the case; exact ties can leave multiple results.
Unqualified zero-seat ratio objectives: \(q_i/a_i\) and \((a_i-q_i)^2/a_i\) need a positive \(a_i\) or an explicit convention.
The German Bundestag: its separate time-specific eligibility and allocation rules cannot be substituted for the 96-seat European Parliament list example.^[1]^[4]^[3]

References¶

[1] 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. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s ↩t ↩u ↩v ↩w ↩x ↩y ↩z ↩27

[2] 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. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m

[3] 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. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p

[4] 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. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j