Metraipolis › archive › dc_ef491e974a88

The maximum concentration of results in incomplete round-robin tournaments — arXiv:2611.01750

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01750
License (as archived)
CC0-1.0
Archived
2026-11-03T18:29:43.653Z
SHA-256 of the archived text
115b3322fc86f6ee673134ed56c502468da07b6f57f88adbdffaa0cbd7c6a9bb
Stable URL of this page
https://metraipolis.com/documento/dc_ef491e974a88

How to cite

The maximum concentration of results in incomplete round-robin tournaments — arXiv:2611.01750 — arXiv (en), https://arxiv.org/abs/2611.01750 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef491e974a88 (Metraipolis archive dc_ef491e974a88, sha256 115b3322fc86f6ee673134ed56c502468da07b6f57f88adbdffaa0cbd7c6a9bb)
BibTeX
@misc{dcef491e974a88,
  title = {The maximum concentration of results in incomplete round-robin tournaments — arXiv:2611.01750},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01750},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef491e974a88; sha256 115b3322fc86f6ee673134ed56c502468da07b6f57f88adbdffaa0cbd7c6a9bb},
  year = {2026}
}

Archived text

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

The Herfindahl--Hirschman Index (HHI), a standard measure of market concentration, is widely used to quantify competitive balance in sports tournaments. To enable comparisons over time or across leagues, both its minimum and maximum should be known. The minimum is usually trivial. Our paper provides results on the maximum HHI in incomplete round-robin tournaments, where the set of matches is represented by a regular but not complete undirected graph. We prove that the lower bound of maximum HHI is reached when the tournament consists of independent round-robin groups, while the upper bound of maximum HHI is reached when the set of matches is represented by a bipartite graph. Maximising HHI is computationally difficult even for highly structured graph types corresponding to real-world tournaments, where the teams are partitioned into pots and play the same number of matches against opponents from every pot. The complexity of the problem does not depend on the scoring system or the number of opponents from a pot.

Tema degli esploratori: economia dei servizi IA (elenco arXiv econ.GN, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; General Economics (econ.GN); Theoretical Economics (econ.TH); Physics and Society (physics.soc-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.01750 — 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:11:37.689Z dalla pagina https://arxiv.org/list/econ.GN/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).