Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.1433

Exact retrospective Monte Carlo computation of arithmetic average Asian options

Benjamin Jourdain·Mohamed Sbai
View original source ↗Read source document ↗Export metadata ↓

Abstract

Taking advantage of the recent litterature on exact simulation algorithms (Beskos, Papaspiliopoulos and Roberts) and unbiased estimation of the expectation of certain fonctional integrals (Wagner, Beskos et al. and Fearnhead et al.), we apply an exact simulation based technique for pricing continuous arithmetic average Asian options in the Black and Scholes framework. Unlike existing Monte Carlo methods, we are no longer prone to the discretization bias resulting from the approximation of continuous time processes through discrete sampling. Numerical results of simulation studies are presented and variance reduction problems are considered.

Explore related subjects

q-fin.CPmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Jourdain, Mohamed Sbai. 2010-02-08. Exact retrospective Monte Carlo computation of arithmetic average Asian options. https://arxiv.org/abs/0704.1433

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Synthetic American Option Pricing via Jump-HMM-Driven Heston Implied Volatility

Valuing American options along simulated stock paths requires an implied volatility (IV) for every option on every date. A stock-return model alone does not provide it. We built a simulator that assigned IV to American options on simulated dates for any chosen stock model. We fitted parametric and neural IV surfaces to vendor option quotes for 31 tickers. Each surface predicted IV from moneyness and time to expiration. Stock paths came from a jump hidden Markov model with capped daily returns. Each day, every option's implied variance moved partway toward its surface prediction, following the form of the Heston variance equation. Random shocks tended to raise IV when the stock fell. A binomial tree converted IV into option values and price sensitivities. Neural surfaces fitted by sector or ticker matched the quotes more closely than one parametric surface. Their errors still varied by date and carried into dollar prices. Repricing identical stock paths under five ways of updating IV changed option values before expiration, and the worst simulated short-position losses at a fixed horizon. Payoffs at expiration did not change. In forecasts of later Goldman Sachs and Eli Lilly option prices, stochastic IV did little better than fixed IV. Rerunning the forecasts with the realized stock paths pointed to stock prediction as a major source of option-price error. The hidden Markov model and an adaptive-volatility model predicted stock prices about as accurately as assuming no change, and tuning found no gain from predicting direction. The adaptive-volatility model improved predicted price ranges for Eli Lilly but not Goldman Sachs. The simulator supported reproducible comparisons of IV and stock assumptions but did not forecast better than simpler alternatives. Complete option histories and prices consistent across strikes are needed before simulated prices can replace market data.

q-fin.CP↗
arXiv2026

Dynamic Inverse Optimization under Drift and Shocks: Theory, Regret Bounds, and Applications

Operational decisions often reflect priorities that evolve gradually and may shift abruptly after disruptions. We develop a dynamic inverse optimization framework for recovering time-varying preference parameters from observed allocation trajectories. The framework separates an offline temporally regularized trajectory formulation from an online mirror-descent estimator for streaming recovery, thereby linking inverse optimization with online convex optimization under nonstationarity. We establish sufficient conditions for local identifiability and existence, static regret of $O(\sqrt{T})$, dynamic regret of $O(\sqrt{T}(1+V_T))$ for the online estimator, and a residual-to-parameter stability bound governed by the conditioning of the projected inverse map. The analysis distinguishes uniqueness of the inverse explanation, conditioning of the recovery map, existence of a batch trajectory solution, and sequential performance under a moving comparator. Controlled experiments on two stylized allocation benchmarks examine noiseless recoverability, finite-horizon regret, gradual drift, observational noise, abrupt shocks, and temporal coupling. These experiments are interpreted as finite-sample diagnostics rather than proofs of asymptotic bounds. Across the tested settings, temporal coupling moderates the trade-off between static under-adaptation and excessive variation from independent period-by-period inversion. The resulting framework provides an interpretable foundation for online inverse optimization and nonstationary decision analytics under evolving priorities. It also clarifies when structural recovery and sequential adaptation require distinct guarantees.

q-fin.CP↗
arXiv2026

Optimal automation under overdispersed discrete risk: thresholds and hysteresis in a Negative Binomial model

Decision-making under clustered uncertainty requires models that accommodate discrete overdispersed risk and endogenous control mechanisms. Standard approaches often impose equi-dispersion or Gaussian assumptions and treat control as exogenous or binary, limiting structural realism. In this paper, we developed a stochastic optimization framework in which risk follows a dynamic Negative Binomial process with time-varying success probability, generating persistent overdispersion and temporal dependence. A continuous control variable mitigated non-tail and tail exposure under convex implementation and adjustment costs. Analytical results showed that overdispersion reshapes the optimal policy, generating interior solutions, dispersion-dependent thresholds, and regime-dependent hysteresis effects that do not arise under equi-dispersed specifications. Simulation evidence confirms that overdispersion amplifies tail risk and induces nonlinear responses. An empirical analysis using daily S&P 500 index data documents significant overdispersion and persistent clustering. The results provide a structural basis for integrating discrete risk modeling with dynamic operational decisions under uncertainty.

q-fin.CP↗