arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.1750cs.CCcs.GT
收藏

任意有限偏序集对策的胜者判定是PSPACE-完全的

Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete

Daniel Grier

摘要:

偏序集博弈是在偏序集上进行的两人博弈,参与者交替选择偏序集的一个元素,删除它和所有大于它的元素。第一个不能选择偏序集的元素的参与者输了。多项式时间算法存在于某些限制类的偏序集游戏,如尼姆游戏。然而,直到最近,人们才知道任意有限偏序集博弈的复杂性只存在于NC ^1和PSPACE之间。我们解决这个矛盾,证明了决定一个任意有限偏序集游戏的赢家是PSPACE完全的。为此,我们给出了一个明确的减少节点Kayles,PSPACE完全游戏中,玩家争相选择一个独立集在一个图。

英文摘要:

A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the poset loses. Polynomial time algorithms exist for certain restricted classes of poset games, such as the game of Nim. However, until recently the complexity of arbitrary finite poset games was only known to exist somewhere between NC^1 and PSPACE. We resolve this discrepancy by showing that deciding the winner of an arbitrary finite poset game is PSPACE-complete. To this end, we give an explicit reduction from Node Kayles, a PSPACE-complete game in which players vie to chose an independent set in a graph.

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

↑