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

透过视窗看平均报酬与总报酬

Looking at Mean-Payoff and Total-Payoff through Windows

Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin

摘要:

我们考虑了两个玩家在加权有向图上玩的游戏,平均支付和总支付目标,两个经典的定量目标。虽然对于单维游戏的复杂性和记忆的界限,这两个目标相吻合,我们表明,在多维的平均支付游戏,是已知的coNP完全,多维的总支付游戏是不可判定的。我们引入保守的近似这些目标,其中的收益被认为是在一个局部的有限窗口滑动沿播放,而不是整个播放。对于一维,我们表明:(i)如果窗口大小是多项式,决定赢家需要多项式时间,(ii)存在一个有界窗口可以决定在NP $\cap$ coNP,是至少一样难解决的平均支付游戏。对于多维,我们表明:(i)固定窗口大小的问题是EXPTIME-完全的,(ii)没有连续递归算法来确定有界窗口的存在。

英文摘要:

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP $\cap$ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.

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

↑