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

关于图上的博弈

On a game on graphs

Felix Günther, Irina Mustata

摘要:

我们从下面这个著名的游戏开始:两个玩家把一张纸放在额头上,上面写着一个正整数。数字是连续的,每个玩家只能看到另一个的数字。在每个时间步中,他们要么什么也不说,要么告诉他们有多少。他们两个最终会在一定时间后计算出他们的数字。游戏是合作而不是竞争,并采用常识和相互知识的概念。我们将这个博弈推广到任意的(有向和无向)单图,并试图确定他们中的一个或两个将找出解决方案,以及他们需要多长时间找到它。我们给出了两个玩家的情况下的完整答案,即使他们都被允许在游戏开始前讨论。

英文摘要:

We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step, they either say nothing or tell what number they have. Both of them will eventually figure out their number after a certain amount of time. The game is rather cooperative than competitive, and employs the notions of common knowledge and mutual knowledge. We generalize this game to arbitrary (directed and non-directed) simple graphs and try to establish for which graphs one or both of them will figure out the solution, and how long they do need to find it. We give a complete answer for the case of two players, even if they are both allowed to discuss before the start of the game.

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

↑