超图子平均场对策
Hypergraphon Mean Field Games
摘要:
我们提出了一种方法来建模大规模的多智能体动态系统,允许不仅仅是对代理之间的相互作用,使用平均场博弈的理论和超图的概念,这是作为大型超图的限制。据我们所知,我们是超图平均场游戏的第一个工作。再加上一个扩展到多层设置,我们得到的非线性,弱相互作用的动态代理的大型系统的限制性描述。在理论方面,我们证明了所得到的超图子平均场博弈的良好基础,表现出存在性和近似纳什性质。在应用方面,我们扩展了数值和学习算法来计算超图子平均场平衡。为了验证我们的方法经验,我们认为社会谣言传播模型,在那里我们给代理人的内在动机传播谣言不知情的代理人,和流行病控制问题。
英文摘要:
We propose an approach to modelling large-scale multi-agent dynamical systems allowing interactions among more than just pairs of agents using the theory of mean field games and the notion of hypergraphons, which are obtained as limits of large hypergraphs. To the best of our knowledge, ours is the first work on mean field games on hypergraphs. Together with an extension to a multi-layer setup, we obtain limiting descriptions for large systems of non-linear, weakly-interacting dynamical agents. On the theoretical side, we prove the well-foundedness of the resulting hypergraphon mean field game, showing both existence and approximate Nash properties. On the applied side, we extend numerical and learning algorithms to compute the hypergraphon mean field equilibria. To verify our approach empirically, we consider a social rumor spreading model, where we give agents intrinsic motivation to spread rumors to unaware agents, and an epidemics control problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。