arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.14587math.CO
收藏

猜想“Catch 22”的一个反例

A counterexample to conjecture "Catch 22"

Bogdan Butyrin, Vladimir Gurvich, Anton Lutsenko, Mariya Naumova, Maxim Peskin

AI总结:

本文构造了一个3人5结果的有限确定性图形博弈反例,推翻了无Nash均衡博弈中秩向量至少有两个分量不低于2的“Catch 22”猜想,并简短证明了一次性博弈在条件($C_0$)下存在Nash均衡。

摘要:

我们构造了一个在纯平稳策略下没有 Nash 均衡的有限确定性图形(DG)博弈。该博弈有3个玩家 $I=\{1,2,3\}$ 和5个结果:2个终止结果 $a_1$ 和 $a_2$,以及3个循环结果。此外,对其中2个玩家而言,终止结果是最好的:对玩家3是 $a_1$,对玩家1是 $a_2$。因此,秩向量 $r$ 至多为 $(1,2,1)$。这里 $r_i$ 是指对玩家 $i \in I$ 而言,比某个循环结果更差的终止结果的数量。这是对论文“On Nash-solvability of finite $n$-person DG games, Catch 22”(2021)arXiv:2111.06278 中猜想“Catch 22”的一个反例,该猜想认为,对任何无 NE 的博弈,$r$ 中至少有2个分量至少为2。然而,对于具有唯一循环结果的博弈,Catch 22 仍然悬而未决,更不用说一个较弱(且更重要)的猜想了,该猜想声称当 $r = (0^n)$ 时,即 $r$ 的所有 $n$ 个分量均为0时,一个 $n$ 人有限 DG 博弈存在 Nash 均衡(在纯平稳策略下);换言之,当满足以下条件时:\n $\qquad\bullet$ ($C_0$) 对每个玩家而言,任何终止结果都优于每一个循环结果。\n 如果每个玩家控制唯一一个位置,则该博弈为一次性博弈。已知任何满足 ($C_0$) 的一次性博弈都有 Nash 均衡。我们对此结论给出了一个新的且非常简短的证明。然而,不仅是上述两个条件的合取,即便是它们的析取也可能足以保证 Nash 可解性。这仍是悬而未决的问题。

英文摘要:

We construct a finite deterministic graphical (DG) game without Nash equilibria in pure stationary strategies. This game has 3 players $I=\{1,2,3\}$ and 5 outcomes: 2 terminal $a_1$ and $a_2$ and 3 cyclic. Furthermore, for 2 players a terminal outcome is the best: $a_1$ for player 3 and $a_2$ for player 1. Hence, the rank vector $r$ is at most $(1,2,1)$. Here $r_i$ is the number of terminal outcomes that are worse than some cyclic outcome for the player $i \in I$. This is a counterexample to conjecture ``Catch 22" from the paper ``On Nash-solvability of finite $n$-person DG games, Catch 22" (2021) arXiv:2111.06278, according to which, at least 2 entries of $r$ are at least 2 for any NE-free game. However, Catch 22 remains still open for the games with a unique cyclic outcome, not to mention a weaker (and more important) conjecture claiming that an $n$-person finite DG game has a Nash equilibrium (in pure stationary strategies) when $r = (0^n)$, that is, all $n$ entries of $r$ are 0; in other words, when the following condition holds: $\qquad\bullet$ ($C_0$) any terminal outcome is better than every cyclic one for each player. A game is play-once if each player controls a unique position. It is known that any play-once game satisfying ($C_0$) has a Nash equilibrium. We give a new and very short proof of this statement. Yet, not only conjunction but already disjunction of the above two conditions may be sufficient for Nash-solvability. This is still open.

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

↑