arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02628cs.GTcs.CCcs.DMmath.CO
收藏

双人版的分配问题

A two-player version of the assignment problem

Aix-Marseille Université(艾克斯-马赛大学);CNRS, I2M, UMR 7373(法国国家科学研究中心,I2M,UMR 7373);Umeå University(于默奥大学);LaBRI, Université de Bordeaux(拉布里实验室,波尔多大学)

Florian Galliot, Nacim Oijid, Jonas Sénizergues

AI总结:

双人版分配问题研究了两个玩家轮流选择代理后,通过分配任务以最大化效率差的PSPACE完全性及特殊情况下计算方法。

摘要:

我们引入了竞争性分配问题,这是众所周知的分配问题的一个双人版本。给定一组任务和一组具有不同效率的任务的代理,Alice和Bob依次选择代理。一旦所有代理都被选中,Alice和Bob会计算他们各自代理集上的分配问题的最优值s_A和s_B,即他们将各自的代理分配给任务(每个任务最多一个代理,每个代理最多一个任务)以最大化效率之和。游戏的分数则定义为s_A - s_B。Alice旨在最大化分数,而Bob旨在最小化它。这个问题可以建模为体育选秀和纸牌游戏中的情况,或者更一般地,两个实体争夺相同资源并相互竞争的情况。我们证明该问题是PSPACE完全的,即使限制在每个代理最多有两个非零效率的情况下。另一方面,在代理最多有一个非零效率的情况下,该问题在任务数参数下属于XP,并且当只有两个任务时,最优分数可以在线性时间内计算出来。

英文摘要:

We introduce the competitive assignment problem, a two-player version of the well-known assignment problem. Given a set of tasks and a set of agents with different efficiencies for different tasks, Alice and Bob take turns picking agents one by one. Once all agents have been picked, Alice and Bob compute the optimal values $s_A$ and $s_B$ for the assignment problem on their respective sets of agents, i.e. they assign their own agents to tasks (with at most one agent per task and at most one task per agent) so as to maximize the sum of the efficiencies. The score of the game is then defined as $s_A-s_B$. Alice aims at maximizing the score, while Bob aims at minimizing it. This problem can model drafts in sports and card games, or more generally situations where two entities fight for the same resources and then use them to compete against each other. We show that the problem is PSPACE-complete, even restricted to agents that have at most two nonzero efficiencies. On the other hand, in the case of agents having at most one nonzero efficiency, the problem lies in XP parameterized by the number of tasks, and the optimal score can be computed in linear time when there are only two tasks.

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

↑