{"paper_id":"2611.26119","title":"Feasible sub-replicating portfolios for basket options via the block rearrangement algorithm","authors":["Mohamad Hassan Abou Daya","Carole Bernard","Steven Vanduffel"],"paper_date":"2026-11-19","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2611.26119","page_url":"https://thequant.space/flowcharts/feasible-sub-replicating-portfolios-for-basket-options-via-the-block/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a method to construct feasible sub‑replicating portfolios of vanilla options for basket calls by reducing the n‑asset problem to n two‑asset problems and using the Block Rearrangement Algorithm to approximate the minimizing dependence, with an exact cash component and a quadrature","quote":"We construct sub-replicating portfolios of vanilla options for a basket call when the marginal distributions of the underlying assets are known and their dependence is not. To do so, we reduce the n-asset problem to n two-asset problems of the type solved by Hobson, Laurence, and Wang (2005a), and use the Block Rearrangement Algorithm1 (BRA) to approximate the minimising dependence among the assets.","summary":"We construct sub-replicating portfolios of vanilla options for a basket call when the marginal distributions of the underlying assets are known and their dependence is not. To do so, we reduce the n-asset problem to n two-asset problems of the type solved by Hobson, Laurence, and Wang (2005a), and…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"All analysis is performed under a risk‑neutral measure with zero interest rates, no dividends, and unit weights in the basket.","type":"market","stated":"explicit","quote":"Throughout the paper we work under a risk-neutral measure Q, assume zero interest rates, no dividends, and unit weights in the basket; the extension to non-unit weights and constant interest rates follows by a trivial scaling argument (Laurence and Wang 2005).","support":"full"},{"assumption":"Each marginal distribution of the underlying assets admits a density on (0,∞) with full support and finite mean.","type":"model","stated":"explicit","quote":"For each i = 1, . . . , n, the marginal law of Xi under Q admits a density on (0, ∞) with full support and finite mean.","support":"full"},{"assumption":"The call price function for each asset is strictly positive, strictly decreasing, strictly convex and continuously differentiable.","type":"model","stated":"explicit","quote":"The call price function CXi(k) is therefore strictly positive for every k ⩾0, strictly decreasing, strictly convex on [0, ∞), and continuously dif-ferentiable in k, with derivative ∂kCXi(k) = −Q(Xi > k) = −Q(Xi ⩾k) (the two coincide because {Xi = k} has measure zero under the density). Remark 2.2.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"log‑normal marginal distributions","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":"three‑asset and six‑asset baskets","quote":"In log-normal examples with three and six assets the bracket has a relative width of at most 0.1%, and the corresponding sub-replicating portfolios are sparse, using only two strikes per asset, while the resulting bounds are tighter than those obtained from a general-purpose multi-marginal optimal-transport algorithm with strikes on a grid.","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":"R1","candidates":{"front_matter":"n/a","evidence_card":"no","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"In log‑normal examples with three and six assets the lower‑upper bound bracket has a relative width of at most 0.1% (and 0.02% for six assets).","kind":"theoretical","quote":"In log-normal examples with three and six assets the bracket has a relative width of at most 0.1%, and the corresponding sub-replicating portfolios are sparse, using only two strikes per asset, while the resulting bounds are tighter than those obtained from a general-purpose multi-marginal optimal-transport algorithm with strikes on a grid. The price of the portfolio under the original marginals is a lower bound,","support":"partial"},{"finding":"Using only two strikes per asset, the sub‑replicating portfolios achieve higher lower bounds than grid‑based methods that use 32 to 256 strikes per asset.","kind":"performance","quote":"With two strikes per asset our lower bounds are higher than theirs with 32 to 256 grid strikes per asset and our upper bounds are considerably tighter.","support":"full"},{"finding":"Adding additional grid strikes to the two‑strike portfolios does not improve the lower bound, indicating strike location is crucial.","kind":"theoretical","quote":"Moreover, adding grid strikes to ours does not improve our lower bound. This shows that the location of the strikes, and not their number, is crucial for obtaining tight bounds.","support":"full"},{"finding":"The BRA‑based dependence structure and the resulting portfolio are optimal for the original marginals to within 10⁻¹¹ quadrature accuracy.","kind":"theoretical","quote":"Our bracket closes: the two bounds differ by less than 10−11, which is the accuracy of the quadrature, so the BRA dependence structure and the portfolio are optimal for the original marginals to that accuracy.","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":18,"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":true,"code_url":"https://github.com/MohamadAbouDaya/Subreplication","note":null},"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":3,"extracted_at":"2026-11-20T11:38:31Z"},"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/"}