arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.0523math.COcs.DM
收藏

离散Voronoi博弈的优势

Advantage in the discrete Voronoi game

Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote

摘要:

我们研究了离散Voronoi博弈,其中两个玩家交替地要求t轮图的顶点。最后,剩余的顶点被划分,使得每个玩家接收更接近他或她声称的顶点的顶点。我们证明了有图的第二个球员得到几乎所有的顶点在这个游戏中,但这是不可能的有界度图。对于树,第一个玩家可以得到至少四分之一的顶点,我们给出的例子中,她只能得到略多于三分之一。我们做了一些一般性的观察,将多轮游戏的结果与同一图上的单轮游戏的结果联系起来。

英文摘要:

We study the discrete Voronoi game, where two players alternately claim vertices of a graph for t rounds. In the end, the remaining vertices are divided such that each player receives the vertices that are closer to his or her claimed vertices. We prove that there are graphs for which the second player gets almost all vertices in this game, but this is not possible for bounded-degree graphs. For trees, the first player can get at least one quarter of the vertices, and we give examples where she can get only little more than one third of them. We make some general observations, relating the result with many rounds to the result for the one-round game on the same graph.

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

↑