{"paper_id":"2503.11053","title":"Pricing American Parisian Options under General Time-Inhomogeneous Markov Models","authors":["Yuhao Liu","Nian Yang","Gongqiu Zhang"],"paper_date":"2025-03-14","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2503.11053v1","page_url":"https://thequant.space/flowcharts/pricing-american-parisian-options-under-general-time-inhomog/","scores":{"empirical_rigor":7,"math_complexity":9.2,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper develops general CTMC‑based methods for pricing perpetual and finite‑maturity American‑style Parisian down‑in and down‑out options under general time‑inhomogeneous Markov models.","quote":"This paper develops general approaches for pricing various types of American-style Parisian options (down-in/-out, perpetual/finite-maturity) with general payoff functions based on continuous-time Markov chain (CTMC) approximation under general 1D time‑inhomogeneous Markov models.","summary":"This paper develops general approaches for pricing various types of American-style Parisian options (down-in/-out, perpetual/finite-maturity) with general payoff functions based on continuous-time Markov chain (CTMC) approximation under general 1D time-inhomogeneous Markov models. For the down-in…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The payoff function f(·) is Lipschitz‑continuous.","type":"model","stated":"explicit","quote":"Assumption 1. The payoff function f(·) is Lipschitz‑continuous."},{"assumption":"The first moment of quadratic variations of X and Y are Lipschitz‑continuous with constants independent of n and δt.","type":"model","stated":"explicit","quote":"Assumption 2. The first moment of quadratic variations of X and Y as functions of t ≥0, t →E⟨X⟩t , t →E⟨Y⟩t are Lipschitz‑continuous with Lipschitz constants independent of n and δt."},{"assumption":"Uniform boundedness of discounted payoff expectations and vanishing discounted payoff at infinity.","type":"model","stated":"explicit","quote":"Assumption 3. There is a constant C > 0 independent of n and δt such that, E"},{"assumption":"Assumption 4 (not quoted in full) holds for convergence of the joint state Y to X.","type":"model","stated":"explicit","quote":"Proposition 8 (Zhang and Li (2023b) Theorem 3.3). Suppose Assumption 4 holds and Y ⇒X as n →∞ and δt →0."}]},"datasets":{"status":"available","items":[{"name":"Synthetic Black‑Scholes model experiments","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"Table 1: Parameters for the numerical experiments under the Black‑Scholes model."}],"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":"pricing-calibration","findings":[{"finding":"The CTMC algorithms converge as the number of grid points increases, with Richardson extrapolation substantially reducing error.","kind":"theoretical","quote":"Table 2 and Figure 1 show the convergence behaviour of perpetual and finite‑maturity American Parisian down‑in and -out call options under the BS model"},{"finding":"Down‑in cases are much faster to compute than down‑out cases and achieve a satisfactory relative error in less than one minute for all four option types.","kind":"performance","quote":"Overall, the down‑in cases take much less time than the down‑out ones and we achieve a satisfactory level of relative error in less than 1 minute for all the four types of options under the BS model."},{"finding":"The paper proves convergence of the CTMC approximation under general time‑inhomogeneous Markov models and validates accuracy and efficiency via extensive numerical experiments.","kind":"theoretical","quote":"We show the convergence of CTMC approximation for all the types of American Parisian options under general time‑inhomogeneous Markov models, and the accuracy and efficiency of our algorithms are confirmed with extensive numerical experiments."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":35,"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":1,"extracted_at":"2026-11-14T17:42:42Z"},"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/"}