Pith. sign in

REVIEW 2 major objections 2 minor 28 references

Mean field games allow players an option to pay for observing a hidden state, and solutions of the limit model produce approximate Nash equilibria for compatible N-player games.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

Introduces continuous-time finite-horizon mean field games with an option to buy information on a hidden state, connects the model to optimal control with discretionary stopping, gives an explicitly solvable example, and constructs approximate Nash equilibria for compatible N-player games.

T0 review reviewed 2026-06-27 challenge →

load-bearing objection The paper adds an option to buy hidden-state information to mean-field games, reduces it to optimal control with stopping, and supplies one explicit solution plus a limit result for compatible N-player cases. the 2 major comments →

arxiv 2606.09784 v1 pith:E6KUU6V4 submitted 2026-06-08 math.OC math.PR

Mean field games with option to buy information

Bernardo D'Auria , Markus Fischer This is my paper
classification math.OC math.PR
keywords mean field gameshidden stateinformation purchasediscretionary stoppingNash equilibriaoptimal controlfinite horizon
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper defines a class of continuous-time finite-horizon mean field games in which each representative player's objective depends on a hidden state in addition to position, control, and the population distribution. Players may choose to incur a cost to observe this hidden state while controlling their dynamics. The authors reformulate the problem as a mean field optimal control model with discretionary stopping, characterize its solutions, and exhibit an explicitly solvable example. They further show that, for N-player games whose information structure is compatible with the limit, approximate Nash equilibria can be constructed directly from any solution of the mean-field model.

Core claim

We introduce a class of continuous time finite horizon mean field games where the objective function of the representative player depends on a hidden state, in addition to position, control, and the population distribution. While acting on the position dynamics, the agent has the option to pay for seeing the hidden state. We connect the original formulation of our model with a mean field model of optimal control with discretionary stopping, characterize solutions, and give a simple explicitly solvable example. For a class of N-player games with compatible information structure, we show that approximate Nash equilibria can be constructed starting from a solution to the limit model.

What carries the argument

The reformulation of the information-purchase decision as a mean field optimal control problem with discretionary stopping.

Load-bearing premise

N-player games possess an information structure compatible with the mean-field limit so that approximate Nash equilibria can be constructed from a solution of the limit model.

What would settle it

An explicit N-player game with the option to buy hidden-state information whose approximate Nash equilibria cannot be recovered from any solution of the corresponding mean-field model.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Solutions of the mean-field model directly yield approximate Nash equilibria for the associated N-player games.
  • The model admits explicit closed-form solutions in simple cases.
  • The hidden state enters the objective alongside the population distribution and control.
  • The information purchase is encoded as an optimal stopping choice in the control problem.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same reduction might apply to other costly partial-information settings in mean-field games.
  • Applications could include trading or sensor networks where agents decide when to acquire signals.
  • The link to discretionary stopping suggests further study of timing in information acquisition within large populations.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The paper introduces a class of continuous-time finite-horizon mean field games in which the representative player's objective depends on a hidden state in addition to position, control, and the population distribution. Agents control position dynamics and may pay to observe the hidden state. The work connects the model to a mean-field optimal control problem with discretionary stopping, characterizes solutions to the resulting system, supplies an explicitly solvable example, and shows that solutions of the mean-field limit yield approximate Nash equilibria for a compatible class of N-player games.

Significance. If the derivations hold, the paper extends mean-field game theory to partial-information settings with endogenous costly information acquisition and establishes a concrete link to optimal stopping. The explicit example provides an independent verification point, and the construction of approximate equilibria from the limit model addresses a key practical question for finite-player games with asymmetric information. These elements together strengthen the applicability of MFG methods beyond complete-information models.

major comments (2)
  1. [§4] §4 (characterization of solutions): the reduction of the original MFG to the mean-field optimal control problem with stopping is asserted via a formal equivalence, but the verification that the value function satisfies the associated HJB variational inequality (including the free-boundary condition for the stopping time) is only sketched; without the explicit derivation of the adjoint or the verification theorem, it is unclear whether the claimed characterization is complete for general running costs.
  2. [§5] §5 (N-player approximation): the proof that the MFG solution yields an ε-Nash equilibrium for the N-player game relies on the information structure being 'compatible'; however, the precise measurability and filtration conditions that make the limit passage rigorous (e.g., the rate at which the empirical measure converges under the chosen information filtration) are not quantified, leaving the error bound dependent on unstated constants.
minor comments (2)
  1. [§2] The notation for the hidden-state process and the information-acquisition cost is introduced without a dedicated preliminary subsection; a short paragraph collecting all processes, filtrations, and cost parameters would improve readability.
  2. [§6] In the explicit example of §6, the closed-form expressions for the optimal control and stopping time are given, but the verification that they indeed solve the HJB equation is omitted; adding a short direct substitution check would strengthen the claim of explicit solvability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and constructive feedback. We address each major comment below and will incorporate revisions accordingly.

read point-by-point responses

  1. Referee: [§4] §4 (characterization of solutions): the reduction of the original MFG to the mean-field optimal control problem with stopping is asserted via a formal equivalence, but the verification that the value function satisfies the associated HJB variational inequality (including the free-boundary condition for the stopping time) is only sketched; without the explicit derivation of the adjoint or the verification theorem, it is unclear whether the claimed characterization is complete for general running costs.

    Authors: We agree that the current presentation sketches the verification. In the revised manuscript, we will provide a detailed derivation of the adjoint and a full verification theorem for the HJB variational inequality, applicable to general running costs. revision: yes

  2. Referee: [§5] §5 (N-player approximation): the proof that the MFG solution yields an ε-Nash equilibrium for the N-player game relies on the information structure being 'compatible'; however, the precise measurability and filtration conditions that make the limit passage rigorous (e.g., the rate at which the empirical measure converges under the chosen information filtration) are not quantified, leaving the error bound dependent on unstated constants.

    Authors: The manuscript defines the compatible information structure, but we acknowledge that explicit quantification of the convergence rates and error bounds is not provided. We will add these details in the revision to make the constants explicit. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines a new class of continuous-time finite-horizon mean-field games in which the representative agent's objective depends on a hidden state and includes an option to purchase information about it. It then maps this formulation to a mean-field optimal-control problem with discretionary stopping, supplies an explicit solvable example, and proves that, for N-player games whose information structure is compatible with the mean-field limit, approximate Nash equilibria can be recovered from a solution of the limit model. None of these steps reduces by definition, by fitting, or by self-citation to its own inputs; the explicit example supplies an independent check, and the compatibility assumption is stated explicitly rather than derived from prior self-referential results. The derivation chain is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities are identifiable from the abstract alone.

reviewed 2026-06-27 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Mean field games with option to buy information." pith.science (2026). https://pith.science/paper/E6KUU6V4

@misc{pith2026260609784,
  author       = {Pith},
  title        = {Pith review of: Mean field games with option to buy information},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/E6KUU6V4}},
  note         = {Machine review of arXiv:2606.09784}
}
Share X Bluesky LinkedIn Reddit HN
abstract

We introduce a class of continuous time finite horizon mean field games where the objective function of the representative player depends on a hidden state, in addition to position, control, and the population distribution. While acting on the position dynamics, the agent has the option to pay for seeing the hidden state. We connect the original formulation of our model with a mean field model of optimal control with discretionary stopping, characterize solutions, and give a simple explicitly solvable example. For a class of $N$-player games with compatible information structure, we show that approximate Nash equilibria can be constructed starting from a solution to the limit model.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references · 3 canonical work pages

  1. [1]

    Aliprantis and K.C

    C.D. Aliprantis and K.C. Border. I nfinite D imensional A nalysis. A Hitchhiker's Guide . Springer, 3rd edition, 2006

    2006

  2. [3]

    Denseness of adapted processes among causal couplings

    M. Beiglb \"o ck and D. Lacker. Denseness of adapted processes among causal couplings. arxiv:1805.03185v3 [math.PR] , May 2020

    work page arXiv 2020

  3. [4]

    Bensoussan and P

    A. Bensoussan and P. Yam. Mean field approach to stochastic control with partial information. ESAIM: COCV , 27: 0 89, 27 pages, 2021

    2021

  4. [5]

    Bergault, P

    P. Bergault, P. Cardaliaguet, and C. Rainer. Mean field games in a Stackelberg problem with an informed major player. SIAM J. Control Optim., 62 0 (3): 0 1737--1765, 2024

    2024

  5. [6]

    Bertucci

    C. Bertucci. Mean field games with incomplete information. arXiv:2205.07703 [math.AP] , 2022

    work page arXiv 2022

  6. [7]

    Billingsley

    P. Billingsley. Convergence of Probability Measures. Wiley Series in Probability and Statistics. J. Wiley & Sons, New York, 1968

    1968

  7. [8]

    Campbell and Y

    S. Campbell and Y. Zhang. A mean field game of sequential testing. arXiv:2403.18297 [math.OC] , 2024

    work page arXiv 2024

  8. [9]

    Carmona, F

    R. Carmona, F. Delarue, and D. Lacker. Mean field games with common noise. Ann. Probab., 44 0 (6): 0 3740--3803, 2016

    2016

  9. [10]

    Carmona, F

    R. Carmona, F. Delarue, and D. Lacker. Mean field games of timing and models for bank runs. Appl. Math. Optim., 76: 0 217--260, 2017

    2017

  10. [11]

    Casgrain and S

    P. Casgrain and S. Jaimungal. Mean field games with differing beliefs for algorithmic trading. Math. Finance, 30: 0 995--1034, 2020

    2020

  11. [12]

    Ceci and B

    C. Ceci and B. Bassan. Mixed optimal stopping and stochastic control problems with semicontinuous final reward for diffusion processes. Stochastics Stochastics Rep. 76 0 (4): 0 323--337, 2004

    2004

  12. [13]

    De Angelis and A

    T. De Angelis and A. Milazzo. Dynamic programming principle for classical and singular stochastic control with discretionary stopping. Appl. Math. Optim., 88: 0 7, 48 pages, 2023

    2023

  13. [14]

    R.M. Dudley. Real Analysis and Probability. Cambridge Studies in Advanced Mathematics. Cambridge University Press, New York, 2nd edition, 2002

    2002

  14. [15]

    Dumitrescu, M

    R. Dumitrescu, M. Leutscher, P. Tankov. Control and optimal stopping Mean Field Games: a linear programming approach. Electron. J. Probab., 26: 0 157, 49 pages, 2021

    2021

  15. [16]

    Dumitrescu, M

    R. Dumitrescu, M. Leutscher, P. Tankov. Linear programming fictitious play algorithm for mean field games with optimal stopping and absorption. ESAIM: M2AN , 57: 0 953--990, 2023

    2023

  16. [17]

    Dupuis and R

    P. Dupuis and R. Ellis. A Weak Convergence Approach to the Theory of Large Deviations. Wiley Series in Probability and Statistics. J. Wiley & Sons, New York, 1997

    1997

  17. [18]

    El Asri, S

    B. El Asri, S. Hamadene, and K. Oufdil. On the stochastic control-stopping problem. J. Differ.\ Equations, 336: 387--426, 2022

    2022

  18. [19]

    Gy\" o ngy and N

    I. Gy\" o ngy and N. Krylov. Existence of strong solutions for It\^ o 's stochastic equations via approximations. Probab.\ Theory Relat.\ Fields, 105: 143--158, 1996

    1996

  19. [20]

    Huang, R.P

    M. Huang, R.P. Malham \'e , and P.E. Caines. Large population stochastic dynamic games: Closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle. Commun. Inf. Syst., 6 0 (3): 0 221--252, 2006

    2006

  20. [21]

    Jacod and J

    J. Jacod and J. M \'e min. french Sur un type de convergence interm \'e diaire entre la convergence en loi et la convergence en probabilit \'e . S \'e minaire de probabilit \'e s de Strasbourg , 15: 529--546, 1981

    1981

  21. [22]

    Kallenberg

    O. Kallenberg. F oundations of M odern P robability . Probability and Its Applications. Springer, 3rd edition, 2021

    2021

  22. [23]

    Ioannis Karatzas and Steven E. Shreve. Brownian Motion and Stochastic Calculus, volume 113 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2nd edition, 1991

    1991

  23. [24]

    D. Lacker. Limit theory for controlled McKean-Vlasov dynamics. SIAM J.\ Control Optim. , 55:\,3, 1641--1672, 2017

    2017

  24. [25]

    D. Lacker. On the convergence of closed-loop Nash equilibria to the mean field game limit. Ann. Appl. Probab. 30(4): 1693--1761, 2020

    2020

  25. [26]

    Lasry and P.-L

    J.-M. Lasry and P.-L. Lions. Mean field games. Japan. J. Math., 2 0 (1): 0 229--260, 2007

    2007

  26. [27]

    L. Mazliak. Mixed control problem under partial observation. Appl. Math. Optim., 27: 0 57--84, 1993

    1993

  27. [28]

    H. Pham. Optimal stopping of controlled jump diffusion processes: a viscosity solution approach. J. Math. Systems Estimation Control, 8 0 (1): 0 1--27, 1998

    1998

  28. [29]

    Shmaya and B

    E. Shmaya and B. Ziliotto. Bayesian learning in mean field games. SIAM J.\ Control Optim., 63 0 (3): 0 1783--1797, 2025

    2025

This paper was first reviewed by grok-4.3 on June 27, 2026.