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

有向图上的零和随机博弈

Zero-sum Random Games on Directed Graphs

Luc Attia, Lyuben Lichev, Dieter Mitsche, Raimundo Saona, Bruno Ziliotto

AI总结:

该文研究顶点带已知有界支撑随机收益的有向图双人零和轮流移动博弈,分别证明有界次指数扩张无环图的博弈值指数收敛、无限d叉树的博弈值双指数收敛的结论。

摘要:

本文研究一类定义在有向图上的双人零和博弈,图的顶点带有支撑集有界的随机收益,且两名参与者均知晓该收益分布。博弈从一个固定顶点出发,参与者轮流沿图的边移动一枚棋子。一方面,针对度数有界且具次指数扩张的有向无环图,我们证明博弈值几乎必然收敛到一个常数,收敛速度为指数级,其速率由扩张性质主导。另一方面,针对不属于上述图类的无限d叉树,我们证明其收敛速度为关于扩张的双指数级。

英文摘要:

This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from a fixed vertex, players take turns to move a token along the edges of the graph. On the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that the value of the game converges almost surely to a constant at an exponential rate dominated in terms of the expansion. On the other hand, for the infinite $d$-ary tree that does not fall into the previous class of graphs, we show convergence at a double-exponential rate in terms of the expansion.

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

↑