Metraipolis › archive › dc_4f8a44f01075

Pairwise comparisons meet optimal transport theory — arXiv:2609.19841

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19841
License (as archived)
CC0-1.0
Archived
2026-10-10T04:20:51.112Z
SHA-256 of the archived text
2c08d4d9e0a7f51cdbdf5343aee93f0d3aa4440133c840161bb1e1c66df01d7a
Stable URL of this page
https://metraipolis.com/documento/dc_4f8a44f01075

How to cite

Pairwise comparisons meet optimal transport theory — arXiv:2609.19841 — arXiv (en), https://arxiv.org/abs/2609.19841 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4f8a44f01075 (Metraipolis archive dc_4f8a44f01075, sha256 2c08d4d9e0a7f51cdbdf5343aee93f0d3aa4440133c840161bb1e1c66df01d7a)
BibTeX
@misc{dc4f8a44f01075,
  title = {Pairwise comparisons meet optimal transport theory — arXiv:2609.19841},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19841},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4f8a44f01075; sha256 2c08d4d9e0a7f51cdbdf5343aee93f0d3aa4440133c840161bb1e1c66df01d7a},
  year = {2026}
}

Archived text

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

In this paper, we reinterpret pairwise comparison theory through the lens of optimal transport. The main contribution is the connection established between pairwise comparison matrices, doubly stochastic scaling, and entropy-regularized transport problems. Using Sinkhorn scaling, we show how consistency, priority derivation, and inconsistency assessment can be studied within a common optimal-transport framework. As methodological consequences of this connection, we obtain a new characterization of consistency, a Sinkhorn-based prioritization method, and an entropy-based inconsistency index. We study these proposals both analytically and numerically and compare them with established methods from the literature

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.19841 — 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-10-10T04:09:28.170Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).