吸引子与博弈中学习的吸引子
Sink equilibria and the attractors of learning in games
AI总结:
该研究反驳了复制动态吸引子与sink平衡一一对应的假设,通过局部源和伪凸性条件揭示了吸引子的刻画难题。
摘要:
刻画学习动态的极限行为——即吸引子——是博弈论中最基本的开放问题之一。在最近的相关研究中,曾提出假设认为复制动态的吸引子与博弈的sink平衡——即博弈偏好图的sink强连通分量——是一一对应的,并已确立它们至少在一一对应与多对一对应之间存在联系。在这里,我们证明了一一假设是错误的。我们通过三个定理来驳斥这一假设:第一个定理驳斥了假设的更强形式,而较弱形式则分别在两人博弈和N人博弈(N>2)的情况下被驳斥。通过展示假设的失败,我们指出了刻画复制动态吸引子的障碍,并引入了新的想法来解决这些问题。所有三个反例都源于一个称为局部源的对象——一个位于sink平衡内部的点,但却是'局部排斥'的;我们证明了没有局部源是必要但不充分的条件,以使一一属性成立。我们还补充了一个充分条件:我们引入了sink平衡的一个局部性质,称为伪凸性,并建立了当两人博弈的sink平衡是伪凸时,它们恰好定义了吸引子。伪凸性扩展了之前的案例——如零和博弈和势博弈——其中这一假设已被知成立,并将这些案例重新表述为简单的图性质。
英文摘要:
Characterizing the limit behavior -- that is, the attractors -- of learning dynamics is one of the most fundamental open questions in game theory. In recent work on this front, it was conjectured that the attractors of the replicator dynamic are in one-to-one correspondence with the sink equilibria of the game -- the sink strongly connected components of a game's preference graph -- and it was established that they do stand in at least one-to-many correspondence with them. Here, we show that the one-to-one conjecture is false. We disprove this conjecture over the course of three theorems: the first disproves a stronger form of the conjecture, while the weaker form is disproved separately in the two-player and $N$-player ($N>2$) cases. By showing how the conjecture fails, we lay out the obstacles that lie ahead for characterizing attractors of the replicator, and introduce new ideas with which to tackle them. All three counterexamples derive from an object called a local source -- a point lying within the sink equilibrium, and yet which is `locally repelling'; we prove that the absence of local sources is necessary, but not sufficient, for the one-to-one property to be true. We complement this with a sufficient condition: we introduce a local property of a sink equilibrium called pseudoconvexity, and establish that when the sink equilibria of a two-player game are pseudoconvex then they precisely define the attractors. Pseudoconvexity generalizes the previous cases -- such as zero-sum games and potential games -- where this conjecture was known to hold, and reformulates these cases in terms of a simple graph property.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。