Pith. sign in

REVIEW 1 cited by

On an inverse boundary problem for mean field games

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.09110 v2 pith:QFNA3EKK submitted 2022-12-18 math.AP math.OC

classification math.APmath.OC
keywords inverseproblemboundaryfieldgamesmeanmfgsprobability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we propose and study an inverse boundary problem for the mean field games (MFGs) governed by the first-order master equation in a bounded domain. We establish the unique identifiability result by showing that the running cost function within any given proper (state) space-time subdomain is uniquely determined by the MFG boundary data of this subdomain. There are several salient features of our study. The MFG system couples two nonlinear parabolic PDEs with one forward in time and the other one backward in time, and moreover there is a probability measure constraint. These make the inverse problem study new to the literature and highly challenging. We develop an effective and efficient scheme in tackling the inverse problem including the high-order variation in the probability space around a nontrivial distribution, and the construction of a novel class of CGO solutions to serve as the ``probing modes". Our study opens up a new field of research on inverse problems for MFGs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Truncated Differentiation Through Primal-Dual Solvers for Inverse Potential Mean-Field Games

    math.OC 2026-07 conditional novelty 6.0 of 10

    Truncated backpropagation through the final r PDHG iterations (JFB-r) gives a surrogate-gradient view, converges to the implicit gradient under fixed active-set/exact-detach conditions, and reduces memory/runtime in i...

Pith tools