Approximate Nash equilibrium from a mean-field optimal-control minimizer

Let (m,mv)(m,m\mathbf v) be a minimizer of the dual optimal-control problem, and let η\eta be the induced probability measure on continuous trajectories Γ=C([0,T];TN)\Gamma=C([0,T];\mathbb T^N), with et#η=m(t)e_t\#\eta=m(t). Let βˉ:Ω×TNΓ\bar\beta:\Omega\times\mathbb T^N\to\Gamma be a measurable map representing the disintegrated trajectory measures, so that

ΓG(γ)dη(γ)=Ω×TNG(βˉ(ω,x))dP(ω)m0(dx).\int_\Gamma G(\gamma)\,d\eta(\gamma)=\int_{\Omega\times\mathbb T^N}G(\bar\beta(\omega,x))\,d\mathbb P(\omega)m_0(dx).

The induced strategy βˉ\bar\beta is an open-loop strategy, meaning that it depends only on the random parameter ω\omega and the initial position x0x_0. Approximate Nash-equilibrium conjecture. Under certain assumptions on kk, for every ϵ>0\epsilon>0 and all sufficiently large nn, the strategy βˉ\bar\beta satisfies

Jin(βi,(βˉ)ji)Jin(βˉ,(βˉ)ji)ϵ{\bf J}_i^n(\beta^i,(\bar\beta)_{j\neq i})\geq {\bf J}_i^n(\bar\beta,(\bar\beta)_{j\neq i})-\epsilon

for every strategy βi\beta^i of player ii and every i=1,,ni=1,\ldots,n. This asserts that the mean-field optimal-control solution provides an approximate Nash equilibrium for the associated finite-player differential game; the precise assumptions on kk and the proof of the approximation are not supplied in the stated conjecture.

Sources & referencesView supporting material

Primary source

Philip Jameson Graber, “Optimal control of first-order Hamilton-Jacobi equations with linearly bounded Hamiltonian”, arXiv:1309.7189 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.