{"paper_id":"2406.09959","title":"Computation of Robust Option Prices via Structured Multi-Marginal Martingale Optimal Transport","authors":["Linn Engström","Sigrid Källblad","Johan Karlsson"],"paper_date":"2024-06-14","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2406.09959v2","page_url":"https://thequant.space/flowcharts/computation-of-robust-option-prices-via-structured-multi-mar/","scores":{"empirical_rigor":3.5,"math_complexity":9.2,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes an efficient computational framework for solving multi‑marginal martingale optimal transport problems, enabling fast computation of robust option price bounds.","quote":"We introduce an efficient computational framework for solving a class of multi‑marginal martingale optimal transport problems, which includes many robust pricing problems of large financial interest.","summary":"We introduce an efficient computational framework for solving a class of multi-marginal martingale optimal transport problems, which includes many robust pricing problems of large financial interest. Such problems are typically computationally challenging due to the martingale constraint, however…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The given marginal distributions are in convex order.","type":"model","stated":"explicit","quote":"We assume that the given marginals µt, for t ∈T ⊆{0, 1, . . . , T}, are in convex order."},{"assumption":"Market data consist of prices of liquidly traded call options for multiple maturities.","type":"market","stated":"explicit","quote":"For market data consisting of prices of liquidly traded call options for multiple maturities, the problem can be formulated as a multi‑marginal martingale optimal transport (MOT) problem."},{"assumption":"Payoff functions can be written as a sum of pairwise‑decoupled terms.","type":"model","stated":"explicit","quote":"interested in pricing path‑dependent derivatives whose payoff function φ"},{"assumption":"Entropic regularisation is applied to the reformulated optimal transport problem.","type":"other","stated":"explicit","quote":"Our method exploits such structures in combination with entropic regularisation, enabling fast computation of optimal solutions"}]},"datasets":{"status":"available","items":[{"name":"Liquidly traded call options (multiple maturities)","provider":null,"kind":"options","access":"unknown","period":null,"universe":null,"quote":"For market data consisting of prices of liquidly traded call options for multiple maturities, the problem can be formulated as a multi‑marginal martingale optimal transport (MOT) problem"},{"name":"Synthetic marginal distributions for numerical examples","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"we, in one of our numerical examples (see Section 5.2), address an MOT problem with more than 50 marginals, where each marginal is supported on a large number of points"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"n/a","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"pricing-calibration","findings":[{"finding":"The algorithm can handle MOT problems with more than 50 marginals, each supported on many points.","kind":"theoretical","quote":"we, in one of our numerical examples (see Section 5.2), address an MOT problem with more than 50 marginals, where each marginal is supported on a large number of points"},{"finding":"Numerical experiments suggest that up to 30 marginals can be used without significant accumulation of Newton residual errors.","kind":"statistical","quote":"Our numerical experiments suggests that 30 marginals can be used without this being an issue"},{"finding":"For the upper‑bound solution with regularisation parameter ε = 0.02, intermediate marginals are close to the terminal marginal, illustrating an early‑transport case.","kind":"theoretical","quote":"The upper bound solution (computed using ε = 0.02) is shown in Figure 2b; for this solution, we note that the intermediate marginals are close to the terminal marginal"},{"finding":"The robust price for the Azéma–Yor martingale comparison example is EQ[XAY_T] = 0.6133.","kind":"other","quote":"The corresponding problem value, the robust price, is EQ[XAY_T] = 0.6133"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":28,"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":0,"unclassified":1},"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":1,"extracted_at":"2026-11-14T18:07:41Z"},"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/"}