Pith. sign in

REVIEW 1 cited by

The convergence rate of vanishing viscosity approximations 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 2303.14560 v2 pith:LBW27GQ7 submitted 2023-03-25 math.AP math.OCmath.PR

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

Motivated by numerical challenges in first-order mean field games (MFGs) and the weak noise theory for the Kardar-Parisi-Zhang equation, we consider the problem of vanishing viscosity approximations for MFGs. We provide the first results on the convergence rate to the vanishing viscosity limit in mean field games, with a focus on the dimension dependence of the rate exponent. Two cases are studied: MFGs with a local coupling and those with a nonlocal, regularizing coupling. In the former case, we use a duality approach and our results suggest that there may be a phase transition in the dimension dependence of vanishing viscosity approximations in terms of the growth of the Hamiltonian and the local coupling. In the latter case, we rely on the regularity analysis of the solution, and derive a faster rate compared to MFGs with a local coupling. A list of open problems are presented.

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. Optimal rate of convergence in the vanishing viscosity for uniformly convex Hamilton-Jacobi equations

    math.AP 2025-06 conditional novelty 8.0 of 10

    Vanishing viscosity for uniformly convex Hamilton-Jacobi equations converges at the optimal rate O(epsilon log epsilon), improving the old O(sqrt(epsilon)) bound.

Pith tools