论文标题

平均现场团队和具有相关类型的游戏

Mean field teams and games with correlated types

论文作者

Vasal, Deepanshu

论文摘要

传统上,平均野外游戏被定义为〜[1,2]是每个玩家具有独立于各个玩家的私人类型的大规模相互作用的模型。在本文中,我们介绍了一种新的模型,其中包括\ emph {相关类型}的新模型,其中有大量同质玩家依次制定战略决策,并且每个玩家都会通过总体人口状态受到其他玩家的影响。每个玩家都有一个私人类型,只有她观察到的任何$ n $播放器的类型是通过内核$ q $关联的。所有玩家通常都观察到相关的平均田中人口状态,代表任何$ n $ players相关的联合类型的经验分布。我们将平均场团队最佳策略(MFTO)定义为球员的策略,这些策略最大程度地提高了球员的总预期联合奖励。我们还在诸如耦合的贝尔曼动态编程后方方程和相关平均场状态的Fokker Planck向后方程的游戏中定义了平均场平衡(MFE),其中MFE中的玩家策略都取决于她的私人类型,私有类型和当前的平均均值场群体状态。我们为存在这种均衡提供了足够的条件。我们还提出了相当于主方程的向后递归方法,分别计算团队和游戏的所有MFTO和MFE。此方法中的每个步骤都包括解决团队问题的优化问题以及游戏的定点方程。我们提供了足够的条件,可以保证每次$ t $的游戏定点方程的存在。

Mean field games have traditionally been defined~[1,2] as a model of large scale interaction of players where each player has a private type that is independent across the players. In this paper, we introduce a new model of mean field teams and games with \emph{correlated types} where there are a large population of homogeneous players sequentially making strategic decisions and each player is affected by other players through an aggregate population state. Each player has a private type that only she observes and types of any $N$ players are correlated through a kernel $Q$. All players commonly observe a correlated mean-field population state which represents the empirical distribution of any $N$ players' correlated joint types. We define the Mean-Field Team optimal Strategies (MFTO) as strategies of the players that maximize total expected joint reward of the players. We also define Mean-Field Equilibrium (MFE) in such games as solution of coupled Bellman dynamic programming backward equation and Fokker Planck forward equation of the correlated mean field state, where a player's strategy in an MFE depends on both, her private type and current correlated mean field population state. We present sufficient conditions for the existence of such an equilibria. We also present a backward recursive methodology equivalent of master's equation to compute all MFTO and MFEs of the team and game respectively. Each step in this methodology consists of solving an optimization problem for the team problem and a fixed-point equation for the game. We provide sufficient conditions that guarantee existence of this fixed-point equation for the game for each time $t$.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源