arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.14461eess.SYcs.MAcs.SY
收藏

多重图上的对抗线性二次平均场对策

Adversarial Linear-Quadratic Mean-Field Games over Multigraphs

Muhammad Aneeq uz Zaman, Sujay Bhatt, Tamer Başar

摘要:

在本文中,我们提出了一个游戏之间的一个外生的对手和网络的代理商通过多重图连接。多重图由(1)全局图结构和(2)局部图结构组成,全局图结构捕获代理之间的虚拟交互,局部图结构捕获代理之间的物理/局部交互。每个代理的目标是通过最小化与其局部图相关联的局部成本和与全局图相关联的全局成本,以分散的方式与其他代理达成共识。另一方面,外生对手的目标是最大化多图中所有代理的平均成本。我们推导出纳什均衡政策的代理和对手的平均场博弈设置,当代理人口在全球图是任意大的和“齐次混合”假设持有局部图。这种均衡是唯一的,每个代理的均衡马尔可夫政策取决于代理的本地状态,以及代理的本地和全球平均场的影响。

英文摘要:

In this paper, we propose a game between an exogenous adversary and a network of agents connected via a multigraph. The multigraph is composed of (1) a global graph structure, capturing the virtual interactions among the agents, and (2) a local graph structure, capturing physical/local interactions among the agents. The aim of each agent is to achieve consensus with the other agents in a decentralized manner by minimizing a local cost associated with its local graph and a global cost associated with the global graph. The exogenous adversary, on the other hand, aims to maximize the average cost incurred by all agents in the multigraph. We derive Nash equilibrium policies for the agents and the adversary in the Mean-Field Game setting, when the agent population in the global graph is arbitrarily large and the ``homogeneous mixing" hypothesis holds on local graphs. This equilibrium is shown to be unique and the equilibrium Markov policies for each agent depend on the local state of the agent, as well as the influences on the agent by the local and global mean fields.

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

↑