arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.6504cs.CCcs.DSmath.CO
收藏

Set对策的计算复杂性及其理论应用

The Computational Complexity of the Game of Set and its Theoretical Applications

Michael Lampis, Valia Mitsou

摘要:

SET游戏是一种流行的纸牌游戏,其目标是使用特殊套牌中的卡片形成集合。在本文中,我们从计算复杂性的角度研究单轮和多轮变化的游戏,并建立有趣的连接与其他经典的计算问题。具体来说,我们首先表明,一个自然的推广问题,找到一个单一的集,参数化的大小寻求集是W-硬的,我们的减少也适用于自然参数化的完美多维匹配,结果可能是独立的利益。其次,我们观察到,一个版本的游戏,其中一个试图找到最大可能数量的不相交的集从一组给定的卡是一个特殊的情况下,3集包装,我们建立,这种限制仍然是NP完全的。类似地,通过与独立边支配集问题的紧密联系,人们试图找到与所有可能集重叠的最小数量的不相交集的版本被证明是NP完全的。最后,我们研究了一个2人版本的游戏,我们显示了一个密切的连接弧凯尔斯,以及固定参数的可处理性时,参数化的轮数。

英文摘要:

The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and establish interesting connections with other classical computational problems. Specifically, we first show that a natural generalization of the problem of finding a single Set, parameterized by the size of the sought Set is W-hard; our reduction applies also to a natural parameterization of Perfect Multi-Dimensional Matching, a result which may be of independent interest. Second, we observe that a version of the game where one seeks to find the largest possible number of disjoint Sets from a given set of cards is a special case of 3-Set Packing; we establish that this restriction remains NP-complete. Similarly, the version where one seeks to find the smallest number of disjoint Sets that overlap all possible Sets is shown to be NP-complete, through a close connection to the Independent Edge Dominating Set problem. Finally, we study a 2-player version of the game, for which we show a close connection to Arc Kayles, as well as fixed-parameter tractability when parameterized by the number of rounds played.

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

↑