随机博弈中的连通性与均衡
Connectivity and equilibrium in random games
摘要:
我们研究了博弈交互图的结构如何影响纯纳什均衡的存在性。特别是,对于一个固定的相互作用图,我们感兴趣的是是否有纯纳什均衡时,随机效用表分配给球员。我们提供的条件下,可能存在的平衡和补充条件,使平衡的存在非常不可能的图的结构。我们的结果对许多确定性图有直接的影响,并推广了完全图上随机博弈的已知结果。特别是,我们的研究结果意味着,有界度图有纯纳什均衡的概率是指数小的图形的大小,并产生一个简单的算法,找到一个大的图形家庭的小不存在证书。然后证明了在任意强连通的n阶图中,若扩张为$(1+Ω(1))\log_2(n)$,则平衡点的个数的分布渐近地接近参数为1的泊松分布,即$n \to +\infty$ .
英文摘要:
We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure Nash equilibria arising when random utility tables are assigned to the players. We provide conditions for the structure of the graph under which equilibria are likely to exist and complementary conditions which make the existence of equilibria highly unlikely. Our results have immediate implications for many deterministic graphs and generalize known results for random games on the complete graph. In particular, our results imply that the probability that bounded degree graphs have pure Nash equilibria is exponentially small in the size of the graph and yield a simple algorithm that finds small nonexistence certificates for a large family of graphs. Then we show that in any strongly connected graph of n vertices with expansion $(1+Ω(1))\log_2(n)$ the distribution of the number of equilibria approaches the Poisson distribution with parameter 1, asymptotically as $n \to +\infty$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。