Metraipolis › archive › dc_ea75a4e13d03

Characterizing Necessary Losers to Explain Tournaments Solutions — arXiv:2608.23446

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.23446
License (as archived): CC0-1.0
Archived: 2026-10-18T07:41:57.604Z
SHA-256 of the archived text: a80642689489f16e3e9ad16ae9ac744a29cded1812377b2c921f55d3d8a6f787
Stable URL of this page: https://metraipolis.com/documento/dc_ea75a4e13d03

How to cite

Characterizing Necessary Losers to Explain Tournaments Solutions — arXiv:2608.23446 — arXiv (en), https://arxiv.org/abs/2608.23446 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea75a4e13d03 (Metraipolis archive dc_ea75a4e13d03, sha256 a80642689489f16e3e9ad16ae9ac744a29cded1812377b2c921f55d3d8a6f787)

BibTeX

@misc{dcea75a4e13d03,
  title = {Characterizing Necessary Losers to Explain Tournaments Solutions — arXiv:2608.23446},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.23446},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea75a4e13d03; sha256 a80642689489f16e3e9ad16ae9ac744a29cded1812377b2c921f55d3d8a6f787},
  year = {2026}
}

Archived text

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

We study the problem of formally explaining why a candidate was not selected by a given tournament rule, by identifying sub-tournaments in which the candidate loses independently of how the rest of the tournament is completed. We define destructive minimal supports as any minimal sub-tournament satisfying this property, which in formal explainable artificial intelligence corresponds to abductive explanations for the question "Why does the loser lose the tournament?". For six common tournament solutions (maximin, uncovered set and its weighted variant, top cycle, Copeland, and Borda) we provide characterizations of when a candidate is either a necessary loser or a possible winner, we determine the size of the smallest destructive minimal supports, complemented by polynomial-time algorithms for their computation except for the case of Borda and Copeland rules which we conjecture to also be polynomial.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-25 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.23446 — 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-18T07:37:52.779Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).