{"paper_id":"2406.05662","title":"Macroscopic Market Making Games via Multidimensional Decoupling Field","authors":["Ivan Guo","Shijia Jin"],"paper_date":"2024-06-09","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2406.05662v2","page_url":"https://thequant.space/flowcharts/macroscopic-market-making-games-via-multidimensional-decoupl/","scores":{"empirical_rigor":2,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes novel stochastic game models for market makers, establishing global well‑posedness of Nash equilibria and associated analytical tools.","quote":"Contribution: This paper proposes novel game models for market makers.","summary":"Building on the macroscopic market making framework as a control problem, this paper investigates its extension to stochastic games. In the context of price competition, each agent is benchmarked against the best quote offered by the others. We begin with the linear case. While constructing the…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Agents are homogeneous in penalty coefficients.","type":"model","stated":"explicit","quote":"(1) The agents are homogeneous in penalty coeﬃcients.","support":"full"},{"assumption":"The intensity function Λ is twice continuously differentiable, strictly decreasing, and satisfies technical bounds.","type":"model","stated":"explicit","quote":"A function Λ : R →R+ belongs to the class of intensity functions Λ if: 1. Λ is twice continuously diﬀerentiable; 2. Λ is strictly decreasing and hence Λ′(x) < 0 for any x ∈R; 3. limx→∞Λ(x) = 0 and −∞< infx∈R Λ(x) Λ′′(x) (Λ′(x))2 ≤supx∈R Λ(x) Λ′′(x) (Λ′(x))2 ≤1. Lemma 3.2 ([20]).","support":"full"},{"assumption":"The game is considered under a Lipschitz formulation extending the linear intensity assumption to general intensity functions.","type":"model","stated":"explicit","quote":"General Market Making Game: Lipschitz Formulations Since the Assumption 2.1 is proposed based on the linear intensity function, we extend such assumption to the case of general intensity functions.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The linear market making game is well‑posed, with the result presented in Theorem 2.7.","kind":"theoretical","quote":"The outline of each section is given as follows: • Section 2 studies the game in a linear setting, of which the well-posedness result is presented in Theorem 2.7.","support":"full"},{"finding":"Global well‑posedness of the nonlinear forward‑backward system (21) is established via a novel non‑smooth analysis method (Theorem 4.7).","kind":"theoretical","quote":"The local well-posedness is well-known, due to the Lipschitz property obtained by a novel version of the implicit function theorem. • To achieve the global well-posedness of (21), the generalized derivatives of the coeﬃcient functions are analysed in Section 4.","support":"partial"},{"finding":"The ordering property reduces the N‑player game to a 4‑player game in the linear setting.","kind":"theoretical","quote":"The ordering property in the stochastic control setting (Theorem 3.8 in [24])—agent with higher inventory tends to place ask orders at a lower price—persists in the equilibrium.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:56:47Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}