Metraipolis › archive › dc_d66f81fddd97

Inverse optimization for divisor methods of apportionment — arXiv:2611.02720

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02720
License (as archived)
CC0-1.0
Archived
2026-11-03T18:45:40.597Z
SHA-256 of the archived text
e97209d0925b367cdee61faea967e3a5214b20676a4e5cd1be95fa04986ef492
Stable URL of this page
https://metraipolis.com/documento/dc_d66f81fddd97

How to cite

Inverse optimization for divisor methods of apportionment — arXiv:2611.02720 — arXiv (en), https://arxiv.org/abs/2611.02720 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d66f81fddd97 (Metraipolis archive dc_d66f81fddd97, sha256 e97209d0925b367cdee61faea967e3a5214b20676a4e5cd1be95fa04986ef492)
BibTeX
@misc{dcd66f81fddd97,
  title = {Inverse optimization for divisor methods of apportionment — arXiv:2611.02720},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02720},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d66f81fddd97; sha256 e97209d0925b367cdee61faea967e3a5214b20676a4e5cd1be95fa04986ef492},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02720. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The apportionment problem is to allocate a fixed number of seats among regions in proportion to their populations. In this paper, we propose an inverse optimization approach to evaluate how fairly an observed apportionment treats each region. It is well known that every divisor method can be formulated as a separable discrete convex minimization problem. We introduce a weighted divisor method, in which a nonnegative weight is assigned to each region, as the forward problem. Then we formulate an inverse optimization problem that finds the weight vector closest to the all-one vector in the $\ell_1$-norm such that the observed apportionment is optimal for the forward problem. We show that the optimal weight vector is always unique and has a closed-form expression as the median of three values that depend on a single parameter. Based on this result, the inverse optimization problem is reduced to a one-dimensional monotone equation, and it can be solved in $O(n \log n)$ time, where $n$ is the number of regions. We also apply the proposed approach to the apportionment of the single-member districts of the House of Representatives of Japan.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.02720 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:14:37.789Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).