Challenge the Champ 锦标赛中贿赂问题的参数化分析
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
AI总结:
本文研究了 Challenge the champ 锦标赛中的贿赂问题,证明了其在以选手数量为参数时是弱 NP 困难和 W[1] 困难的,并在以不同贿赂值或概率值数量为参数时是固定参数可解的。
摘要:
Challenge the champ 锦标赛是最简单的竞赛形式之一,其中一名(最初选定的)冠军会不断受到其他选手的挑战。如果一名选手击败了冠军,那么该选手就被视为新的(当前)冠军。比赛中的每名选手按照固定顺序挑战当前冠军一次。最后一轮的冠军被视为锦标赛的获胜者。我们研究了一种选手可以被贿赂以降低其战胜初始冠军概率的设定。目标是通过贿赂其他选手,在不超出给定贿赂预算的情况下,最大化初始冠军赢得锦标赛的概率。Mattei 等人 [Journal of Applied Logic, 2015] 表明该问题可以在伪多项式时间内解决,并且在以选手数量为参数时属于 XP。我们证明了该问题是弱 NP 困难的,并且在以选手数量为参数时是 W[1] 困难的。在算法方面,我们证明了当以不同贿赂值的数量或不同概率值的数量为参数时,该问题是固定参数可解的。为此,我们建立了几项具有独立意义的结果。特别地,我们证明了乘积背包问题在以背包中物品数量为参数时是 W[1] 困难的,并且杯型锦标赛的建设性贿赂问题在以选手数量为参数时是 W[1] 困难的。此外,我们提出了一种设计混合整数线性规划的新方法,确保所有变量均为整数的最优解。
英文摘要:
Challenge the champ tournaments are one of the simplest forms of competition, where a (initially selected) champ is repeatedly challenged by other players. If a player beats the champ, then that player is considered the new (current) champ. Each player in the competition challenges the current champ once in a fixed order. The champ of the last round is considered the winner of the tournament. We investigate a setting where players can be bribed to lower their winning probability against the initial champ. The goal is to maximize the probability of the initial champ winning the tournament by bribing the other players, while not exceeding a given budget for the bribes. Mattei et al. [Journal of Applied Logic, 2015] showed that the problem can be solved in pseudo-polynomial time, and that it is in XP when parameterized by the number of players. We show that the problem is weakly NP-hard and W[1]-hard when parameterized by the number of players. On the algorithmic side, we show that the problem is fixed-parameter tractable when parameterized either by the number of different bribe values or the number of different probability values. To this end, we establish several results that are of independent interest. In particular, we show that the product knapsack problem is W[1]-hard when parameterized by the number of items in the knapsack, and that constructive bribery for cup tournaments is W[1]-hard when parameterized by the number of players. Furthermore, we present a novel way of designing mixed integer linear programs, ensuring optimal solutions where all variables are integers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。