Characterizing Necessary Losers to Explain Tournaments Losers· 解释比赛失败者
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-tournaments satisfying this property, which in formal explainable artificial intelligence correspond 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
研究淘汰赛中某选手必败的原因及最小破坏支持集的识别。
- 核心方法
- 定义了最小破坏支持集（destructive minimal supports）的概念，这是选手在部分比赛中必败且不受其他比赛结果影响的最小子集。并通过六种常见赛制（maximin, uncovered set, 加权uncovered set, top-cycle, Copeland, Borda）分析了选手必败或可能获胜的条件。
- 适合谁读
- 研究者、工程师
- 要解决的问题
- 论文探讨了如何形式化地解释一个选手为何在特定赛制下未被选中，即必败的原因。
- 关键实验
- 未提供
- 主要贡献
- 提供了计算最小破坏支持集的多项式时间算法，有助于形式化解释AI决策过程。
- 意义与局限
- 该研究为解释AI决策透明度提供了新的视角和工具，特别是在竞赛公平性和结果解释性方面。但算法仅限于特定赛制，具有一定的局限性。