2018
DOI: 10.1007/s00332-018-9507-5
|View full text |Cite
|
Sign up to set email alerts
|

Population Games and Discrete Optimal Transport

Abstract: We propose a new evolutionary dynamics for population games with a discrete strategy set, inspired by the theory of optimal transport and Mean field games. The dynamics can be described as a Fokker-Planck equation on a discrete strategy set. The derived dynamics is the gradient flow of a free energy and the transition density equation of a Markov process. Such process provides models for the behavior of the individual players in population, which is myopic, greedy and irrational. The stability of the dynamics … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 36 publications
0
7
0
Order By: Relevance
“…This structure can be made mathematically rigorous and general to work for probability measures with finite second moments by using tools in metric geometry [5]. Under such a setting, the gradient flow with respect to the L 2 -Wasserstein metric tensor, known as the Wasserstein gradient flow, is welldefined and has been seen deep connections to fluid dynamics [11] [40], differential geometry [25] and mean-field games [16] [17].…”
Section: Introductionmentioning
confidence: 99%
“…This structure can be made mathematically rigorous and general to work for probability measures with finite second moments by using tools in metric geometry [5]. Under such a setting, the gradient flow with respect to the L 2 -Wasserstein metric tensor, known as the Wasserstein gradient flow, is welldefined and has been seen deep connections to fluid dynamics [11] [40], differential geometry [25] and mean-field games [16] [17].…”
Section: Introductionmentioning
confidence: 99%
“…\end{equation}According to the results in ref. [36], the inner product of two potential gradient normalΦ,trueΦ̂$\nabla \Phi , \nabla \hat{\Phi }$ over ρfalse(tfalse)$\bm {\rho }(t)$ can be written as false(normalΦ,trueΦ̂false)ρfalse(tfalse)badbreak=12false(i,jfalse)scriptE(normalΦinormalΦj)(trueΦ̂itrueΦ̂j)θij(ρfalse(tfalse)),\begin{equation} (\nabla \Phi ,\nabla \hat{\Phi })_{{\bm {\rho }(t)}} = \frac{1}{2}\sum \limits _{(i,j) \in \mathcal {E}}(\Phi ^i - \Phi ^j)(\hat{\Phi }^i - \hat{\Phi }^j)\theta ^{ij}({\bm {\rho }(t)}), \end{equation}where 12$\frac{1}{2}$ is because each edge is summed twice. Here, θij(ρfalse(tfalse))$\theta ^{ij}({\bm {\rho }(t)})$ is the weight for each edge, i.e.…”
Section: Mean‐field Game Based Approach For Aoi Minimisationmentioning
confidence: 99%
“…Therefore, a metric, i.e. Wasserstein metric [36], is adopted to quantify the performance over the strategy graph G$\mathcal {G}$.…”
Section: Mean‐field Game Based Approach For Aoi Minimisationmentioning
confidence: 99%
“…With the state space in (2) and the inner product in Definition 2, we can construct the Riemannian manifold (P o (S), g W ) [30], [27]. In this regard, we can give the proof of Theorem 1 as follows:…”
Section: Appendix a Proof Of Theoremmentioning
confidence: 99%