arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1405.4658math.OCmath.PR
收藏

零和对策的遍历性条件

Ergodicity conditions for zero-sum games

Marianne Akian, Stéphane Gaubert, Antoine Hochart

摘要:

零和重复博弈的一个基本问题在于确定单位时间的平均收益是否独立于初态。在“零玩家”游戏的特殊情况下,即,对于具有可加泛函的马尔可夫链,平均遍历定理给出了答案。我们把这个结果推广到重复博弈。我们证明了当且仅当遍历性条件成立时,对于所有依赖于状态的报酬扰动,平均报酬与初态无关。后者的特征在于非线性调和函数(与Shapley算子相关的衰退函数的不动点)的模常数的唯一性,或者,在具有有限动作空间和完美信息的随机对策的特殊情况下,通过涉及有向超图中状态的共轭子集的可达性条件。我们证明了博弈的遍历性条件只依赖于转移概率的支持度,并且当状态数固定时,它可以在多项式时间内被检验。

英文摘要:

A basic question for zero-sum repeated games consists in determining whether the mean payoff per time unit is independent of the initial state. In the special case of "zero-player" games, i.e., of Markov chains equipped with additive functionals, the answer is provided by the mean ergodic theorem. We generalize this result to repeated games. We show that the mean payoff is independent of the initial state for all state-dependent perturbations of the rewards if and only if an ergodicity condition is verified. The latter is characterized by the uniqueness modulo constants of nonlinear harmonic functions (fixed points of the recession function associated to the Shapley operator), or, in the special case of stochastic games with finite action spaces and perfect information, by a reachability condition involving conjugate subsets of states in directed hypergraphs. We show that the ergodicity condition for games only depends on the support of the transition probability, and that it can be checked in polynomial time when the number of states is fixed.

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

↑