Pith. sign in

REVIEW 2 cited by

Mean-Field Games with Differing Beliefs for Algorithmic Trading

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 1810.06101 v2 pith:2ZNPTZSD submitted 2018-10-14 q-fin.MF

classification q-fin.MF
keywords agentsgamestochastictradingdisagreeequilibriummean-fieldmodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Even when confronted with the same data, agents often disagree on a model of the real-world. Here, we address the question of how interacting heterogenous agents, who disagree on what model the real-world follows, optimize their trading actions. The market has latent factors that drive prices, and agents account for the permanent impact they have on prices. This leads to a large stochastic game, where each agents' performance criteria are computed under a different probability measure. We analyse the mean-field game (MFG) limit of the stochastic game and show that the Nash equilibrium is given by the solution to a non-standard vector-valued forward-backward stochastic differential equation. Under some mild assumptions, we construct the solution in terms of expectations of the filtered states. Furthermore, we prove the MFG strategy forms an $\epsilon$-Nash equilibrium for the finite player game. Lastly, we present a least-squares Monte Carlo based algorithm for computing the equilibria and show through simulations that increasing disagreement may increase price volatility and trading activity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Latency and Liquidity Risk

    q-fin.TR 2019-08 conditional novelty 6.0 of 10

    A liquidity taker's latency-optimal discretion is characterized by δ*_t = 2γE_{t-}[D_T]+γ+α, the solution of a random-measure FBSDE, but the optimality proof and numerical regime contain gaps.

  2. NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes

    math.PR 2026-07 conditional novelty 5.0 of 10

    A finite-sampling neural architecture is dense in the Hilbert space of square-integrable predictable processes and attains best-N-term chaoslet rates for compressible or Malliavin-regular processes.

Pith tools