{"paper_id":"2402.16724","title":"Alternative models for FX: pricing double barrier options in regime-switching Lévy models with memory","authors":["Svetlana Boyarchenko","Sergei Levendorskiĭ"],"paper_date":"2024-02-26","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2402.16724v1","page_url":"https://thequant.space/flowcharts/alternative-models-for-fx-pricing-double-barrier-options-in/","scores":{"empirical_rigor":2,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper introduces regime‑switching Lévy models with memory and a modified numerical method that evaluates Wiener‑Hopf factors only for the current stochastic state, keeping the same number of main time‑consuming blocks as in Markovian regime‑switching models.","quote":"We introduce the class of regime-switching Lévy models with memory, which take into account the evolution of the stochastic parameters in the past. This requires the evaluation of the Wiener-Hopf factors and numerical realization of operators for each state.","summary":"This paper is a supplement to our recent paper Alternative models for FX, arbitrage opportunities and efficient pricing of double barrier options in Lévy models\". We introduce the class of regime-switching Lévy models with memory, which take into account the evolution of the stochastic parameters…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The process “remembers” only the last N states visited.","type":"model","stated":"explicit","quote":"ALTERNATIVE MODELS FOR FX AND DOUBLE BARRIER OPTIONS IN L´EVY MODELS 3 assume that the process “remembers” only the last N states visited.","support":"full"},{"assumption":"If the process Y approximates a diffusion, transition rates λ_{s,h}=0 unless s equals h₀±1, reducing the number of histories.","type":"model","stated":"explicit","quote":"If the process Y approximates a diﬀusion, then an additional natural restriction is λs,h = 0 unless s ∈{h0 −1, h0 + 1}, and #HN < m · 2N.","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":"Using the modified method, CPU time decreases and accuracy increases when calculations are performed in the dual space.","kind":"performance","quote":"The CPU time decreases and accuracy increases if the calculations are in the dual space as in [9].","support":"full"},{"finding":"Evaluation of value functions for each history can be easily parallelized because the same operators are applied to different functions.","kind":"performance","quote":"At each step of the iteration procedure, the evaluation of a value function with the subscript h ∈HN(s) is easily parallelized - the same operators are applied to diﬀerent functions - and the other operations in the iteration procedure are evaluation of scalar products of precalculated arrays of transition rates and value functions calculated at the previous step of the iteration procedure.","support":"full"},{"finding":"If the Wiener‑Hopf blocks depended on the full past history, CPU time would become extremely large or parallelization would be complicated.","kind":"theoretical","quote":"These main blocks are time-consuming, hence, if they are diﬀerent for each history, the CPU time becomes extremely large or parallelization complicated.","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":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-14T19:58: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/"}