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

团队间的平均场博弈

Mean-field games among teams

Jayakumar Subramanian, Akshat Kumar, Aditya Mahajan

AI总结:

本文提出了团队间平均场博弈模型,引入平均场马尔可夫完美均衡(MF-MPE)并利用动态规划分解对其进行表征,同时证明无限种群团队博弈的MF-MPE更易计算且能近似有限种群情形。

摘要:

本文提出了一个团队间博弈的模型。每个团队由同质智能体群体组成。团队内的智能体是合作的,而各团队之间则相互竞争。动力学与成本通过每个团队中智能体状态的实证分布(或平均场)耦合在一起。假设所有智能体都能观测到该平均场。智能体具有非对称信息(也称为非经典信息结构)。我们提出了基于平均场的该博弈Team-Nash均衡的精炼,称之为平均场马尔可夫完美均衡(MF-MPE)。我们识别出一种动态规划分解来表征MF-MPE。随后,我们考虑每个团队拥有大量参与者的情况,并提出一种平均场近似,将大种群团队间的博弈近似为无限种群团队间的博弈。我们证明,无限种群团队间博弈的MF-MPE更容易计算,并且为有限种群团队间博弈的MF-MPE提供了近似。

英文摘要:

In this paper, we present a model of a game among teams. Each team consists of a homogeneous population of agents. Agents within a team are cooperative while the teams compete with other teams. The dynamics and the costs are coupled through the empirical distribution (or the mean field) of the state of agents in each team. This mean-field is assumed to be observed by all agents. Agents have asymmetric information (also called a non-classical information structure). We propose a mean-field based refinement of the Team-Nash equilibrium of the game, which we call mean-field Markov perfect equilibrium (MF-MPE). We identify a dynamic programming decomposition to characterize MF-MPE. We then consider the case where each team has a large number of players and present a mean-field approximation which approximates the game among large-population teams as a game among infinite-population teams. We show that MF-MPE of the game among teams of infinite population is easier to compute and is an $\varepsilon$-approximate MF-MPE of the game among teams of finite population.

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

↑