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

平价博弈的拉宾指数

The Rabin index of parity games

Michael Huth, Jim Huan-Pu Kuo, Nir Piterman

摘要:

我们研究的描述性的复杂性,考虑到他们的游戏图的着色,而忽略了他们的所有权结构的平价游戏。有色博弈图被识别,如果它们确定相同的获胜区域和策略,对于所有的所有权结构的节点。奇偶对策的Rabin指数是所有等价着色函数的最大色的最小值。我们表明,决定拉宾指数是否至少是k是在PTIME为k=1,但NP-困难的所有固定的k > 1。我们提出了一个EXPTIME算法,通过简化其输入着色函数来计算拉宾指数。当用循环检测代替简单循环时,该算法的输出在多项式时间内过逼近Rabin指数。实验结果表明,这种近似在实际中得到了很好的结果。

英文摘要:

We study the descriptive complexity of parity games by taking into account the coloring of their game graphs whilst ignoring their ownership structure. Colored game graphs are identified if they determine the same winning regions and strategies, for all ownership structures of nodes. The Rabin index of a parity game is the minimum of the maximal color taken over all equivalent coloring functions. We show that deciding whether the Rabin index is at least k is in PTIME for k=1 but NP-hard for all fixed k > 1. We present an EXPTIME algorithm that computes the Rabin index by simplifying its input coloring function. When replacing simple cycle with cycle detection in that algorithm, its output over-approximates the Rabin index in polynomial time. Experimental results show that this approximation yields good values in practice.

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

↑