{"paper_id":"2307.06450","title":"Stochastic Delay Differential Games: Financial Modeling and Machine Learning Algorithms","authors":["Robert Balkin","Hector D. Ceniceros","Ruimeng Hu"],"paper_date":"2023-07-12","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2307.06450v1","page_url":"https://thequant.space/flowcharts/stochastic-delay-differential-games-financial-modeling-and/","scores":{"empirical_rigor":6,"math_complexity":9.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a numerical methodology for finding the closed-loop Nash equilibrium of stochastic delay differential games by parameterizing each player’s control with recurrent neural networks and training them via a deep fictitious play algorithm.","quote":"In this paper, we propose a numerical methodology for finding the closed-loop Nash equilibrium of stochastic delay differential games through deep learning. Our approach involves parameterizing the controls of each player using distinct recurrent neural networks.","summary":"In this paper, we propose a numerical methodology for finding the closed-loop Nash equilibrium of stochastic delay differential games through deep learning. These games are prevalent in finance and economics where multi-agent interaction and delayed effects are often desired features in a model…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The initial path of the state is chosen so that the tax‑adjusted wealth Zi0 = Xi0 + aYi0 is positive.","type":"model","stated":"explicit","quote":"(43) We are assuming that the initial path Xi t = ζi(t) for t ≤0 is chosen so that Zi 0 = Xi 0 + aY i 0 > 0.","support":"full"},{"assumption":"Each player’s control belongs to an admissible set Ai of closed‑loop, FX‑progressively measurable strategies.","type":"model","stated":"explicit","quote":"We know that in the continuous version, each player’s control lives in the admissible set Ai (2), which contains suitable FX t -progressively measurable strategies, i.e, closed-loop controls.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"synthetic benchmark problems with known closed‑form solutions","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"This includes the new class of problems that we introduce and solve in this paper as well as the model introduced in [5] to study the systemic risk in bank lending. By considering both new and existing problems, we assess the accuracy of our proposed method using their closed-form solutions as benchmarks.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"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 deep learning algorithm successfully approximates the true Nash equilibrium controls; the trajectories of the trained LSTM controls closely match those of the true controls after training.","kind":"theoretical","quote":"The derivation, interpretation, and proofs for these problems are presented in Appendices A and B. From the numerical experiments we conducted, we have observed compelling evidence that our proposed algorithm successfully approximates the true Nash equilibrium controls. The trajectories of the trained controls closely match those of the true controls after training.","support":"full"},{"finding":"During training, the relative 2‑norm error between the predicted and true Nash equilibrium costs drops below 10⁻⁵ in some cases.","kind":"performance","quote":"This is demonstrated by a decrease in the relative 2-norm error between these vectors throughout the training process, with relative errors reaching values lower than 10−5 in some cases.","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":13,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"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-14T20:02:02Z"},"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/"}