Convexification for a Coefficient Inverse Problem of Mean Field Games

Jingzhi Li; Michael V. Klibanov; Zhipeng Yang

Convexification for a Coefficient Inverse Problem of Mean Field Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2310.08878 v1 pith:W2XGCTIY submitted 2023-10-13 math.NA cs.NA

Michael V. Klibanov , Jingzhi Li , Zhipeng Yang This is my paper · ORCID

classification math.NAcs.NA

keywords coefficientconvexificationdatafieldgamesinversemeannumerical

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

The globally convergent convexification numerical method is constructed for a Coefficient Inverse Problem for the Mean Field Games System. A coefficient characterizing the global interaction term is recovered from the single measurement data. In particular, a new Carleman estimate for the Volterra integral operator is proven, and it stronger than the previously known one. Numerical results demonstrate accurate reconstructions from noisy data.

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

Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problems
cs.LG 2025-05 conditional novelty 6.0 of 10

GPPI-AS offers a mesh-free, closed-form policy iteration solver for HJB and mean field game forward and inverse problems, with Schwarz acceleration cutting iterations roughly in half.

Pith tools