arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14966cs.GTcs.DS
收藏

在具有概率结果的挑战冠军比赛中实现稳健的价值最大化

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes

Tata Institute of Fundamental Research(塔塔基础研究所);Indian Institute of Petroleum and Energy(印度石油与能源研究所);The Institute of Mathematical Sciences, HBNI(HBNI数学科学研究所);Indian Institute of Technology Jodhpur(焦特普尔印度理工学院)

Umang Bhaskar, Juhi Chaudhary, Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman

AI总结:

本文研究了在具有概率结果的挑战冠军比赛中实现稳健价值最大化的问题,探讨了非自适应算法的局限性以及自适应算法在近似最优价值不风险中的作用。

摘要:

挑战冠军是一种简单的比赛格式,其中玩家的顺序——称为种子——被决定。该顺序中的第一个玩家是初始冠军,面对下一个玩家。每场比赛的结果决定当前冠军,该冠军将面对顺序中的下一个玩家。每个玩家也有一个受欢迎程度,每场比赛的价值是胜者的受欢迎程度。在比赛中的价值最大化之前已研究过,当每场比赛结果确定性时。然而,比赛结果通常是概率性的,而不是确定性的。我们研究了在挑战冠军比赛中实现稳健的价值最大化,当比赛的胜利可能具有概率性时。也就是说,我们寻求最大化获得的总价值,无论概率性比赛的结果如何。我们显示,即使在简单的二进制设置中,对于非自适应算法,最优的稳健价值——我们称之为VnaR,或价值不风险——也是难以近似。然而,如果我们允许自适应算法,根据先前比赛的结果决定挑战者的顺序,或者限制具有概率性结果的比赛,我们可以获得接近最优VnaR的良好近似。

英文摘要:

Challenge the Champ is a simple tournament format, where an ordering of the players -- called a seeding -- is decided. The first player in this order is the initial champ, and faces the next player. The outcome of each match decides the current champion, who faces the next player in the order. Each player also has a popularity, and the value of each match is the popularity of the winner. Value maximization in tournaments has been previously studied when each match has a deterministic outcome. However, match outcomes are often probabilistic, rather than deterministic. We study robust value maximization in Challenge the Champ tournaments, when the winner of a match may be probabilistic. That is, we seek to maximize the total value that is obtained, irrespective of the outcome of probabilistic matches. We show that even in simple binary settings, for non-adaptive algorithms, the optimal robust value -- which we term the \textsc{VnaR}, or the value not at risk -- is hard to approximate. However, if we allow adaptive algorithms that determine the order of challengers based on the outcomes of previous matches, or restrict the matches with probabilistic outcomes, we can obtain good approximations to the optimal \textsc{VnaR}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑