One Man, One Vote, One Price

Abstract Introduced initially to allocate parliamentary seats among states or provinces, apportionment methods can distribute any discrete scarce resource based on a series of claims or budgets such as the states’ voting populations. Here, we focus on the price of representation: how one can turn the claims, such as the number of voters, into a share of the resource, such as parliamentary seats. The D’Hondt method naturally emerges as a competitive equilibrium. We show that the class of parametric divisor methods is fully characterised by a competitive equilibrium augmented by a uniform credit or debt with respect to the original claims. Based on the insight gained from the competitive equilibrium representation, we provide an alternative proof of majorization: divisor methods with smaller parameters favour players with smaller budgets and vice versa . While in a competitive equilibrium, all pay the same price, when the budget allows for the purchase of a few items, leftovers may constitute a substantial part of the original budget. In other words, not all are equally efficient at converting their budgets into items. Optimisation apportionment methods, such as the Leximin, assign individual prices; hence, each budget is fully spent, and focus on minimising price differences. We demonstrate how the D’Hondt and Adams methods can be formulated as optimisation methods and highlight their connection to the Leximin method.

Authors

Institutions

Publication Details

Journal
Annals of Operations Research
Published
2026-02-03
DOI
https://doi.org/10.1007/s10479-026-07068-2
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

One Man, One Vote, One Price

Balázs R. Sziklai, László Á. Kóczy
Annals of Operations Research
Game Theory and Voting Systems
article

One Man, One Vote, One Price

Balázs R. Sziklai, László Á. Kóczy
article en

Abstract

Abstract Introduced initially to allocate parliamentary seats among states or provinces, apportionment methods can distribute any discrete scarce resource based on a series of claims or budgets such as the states’ voting populations. Here, we focus on the price of representation: how one can turn the claims, such as the number of voters, into a share of the resource, such as parliamentary seats. The D’Hondt method naturally emerges as a competitive equilibrium. We show that the class of parametric divisor methods is fully characterised by a competitive equilibrium augmented by a uniform credit or debt with respect to the original claims. Based on the insight gained from the competitive equilibrium representation, we provide an alternative proof of majorization: divisor methods with smaller parameters favour players with smaller budgets and vice versa . While in a competitive equilibrium, all pay the same price, when the budget allows for the purchase of a few items, leftovers may constitute a substantial part of the original budget. In other words, not all are equally efficient at converting their budgets into items. Optimisation apportionment methods, such as the Leximin, assign individual prices; hence, each budget is fully spent, and focus on minimising price differences. We demonstrate how the D’Hondt and Adams methods can be formulated as optimisation methods and highlight their connection to the Leximin method.

Annals of Operations Research
Eötvös Loránd University (HU), Corvinus University of Budapest (HU), Budapest University of Technology and Economics (HU), ELTE Centre for Economic and Regional Studies (HU)
Budapesti Corvinus Egyetem
Openalex Percentile: Top 72%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

One Man, One Vote, One Price — Balázs R. Sziklai, László Á. Kóczy · Annals of Operations Research (2026) | TGRS Research Map | TGRS