English
Related papers

Related papers: A method for pricing American options using semi-i…

200 papers

Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to…

Computational Engineering, Finance, and Science · Computer Science 2021-08-10 Sebastian Becker , Patrick Cheridito , Arnulf Jentzen , Timo Welti

Employing probabilistic techniques we compute best possible upper and lower bounds on the price of an option on one or two assets with continuous piecewise linear payoff function based on prices of simple call options of possibly distinct…

Probability · Mathematics 2008-12-02 Dimitris Bertsimas , Natasha Bushueva

American options are the reference instruments for the model calibration of a large and important class of single stocks. For this task, a fast and accurate pricing algorithm is indispensable. The literature mainly discusses pricing methods…

Computational Finance · Quantitative Finance 2016-11-21 Olena Burkovska , Maximilian Gaß , Kathrin Glau , Mirco Mahlstedt , Wim Schoutens , Barbara Wohlmuth

American options are studied in a general discrete market in the presence of proportional transaction costs, modelled as bid-ask spreads. Pricing algorithms and constructions of hedging strategies, stopping times and martingale…

Pricing of Securities · Quantitative Finance 2008-12-02 Alet Roux , Tomasz Zastawniak

In this paper we introduce a deep learning method for pricing and hedging American-style options. It first computes a candidate optimal stopping policy. From there it derives a lower bound for the price. Then it calculates an upper bound, a…

Computational Finance · Quantitative Finance 2021-03-23 Sebastian Becker , Patrick Cheridito , Arnulf Jentzen

This paper introduces a semi-analytical method for pricing American options on assets (stocks, ETFs) that pay discrete and/or continuous dividends. The problem is notoriously complex because discrete dividends create abrupt price drops and…

Pricing of Securities · Quantitative Finance 2026-01-06 Andrey Itkin

We consider the problem of choosing prices of a set of products so as to maximize profit, taking into account self-elasticity and cross-elasticity, subject to constraints on the prices. We show that this problem can be formulated as…

Optimization and Control · Mathematics 2026-04-30 Maximilian Schaller , Stephen Boyd

Given a batch of human computation tasks, a commonly ignored aspect is how the price (i.e., the reward paid to human workers) of these tasks must be set or varied in order to meet latency or cost constraints. Often, the price is set…

Computer Science and Game Theory · Computer Science 2014-08-28 Yihan Gao , Aditya Parameswaran

We extend the viscosity solution characterization proved in [5] for call/put American option prices to the case of a general payoff function in a multi-dimensional setting: the price satisfies a semilinear re-action/diffusion type equation.…

Probability · Mathematics 2018-11-16 Bruno Bouchard , Ki Chau , Arij Manai , Ahmed Sid-Ali

The problem of determining the European-style option price in the incomplete market has been examined within the framework of stochastic optimization. An analytic method based on the discrete dynamic programming equation (Bellman equation)…

Statistical Mechanics · Physics 2016-08-31 Sergei Fedotov , Sergei Mikhailov

This work addresses the problem of pricing American basket options in a multivariate setting, which includes among others, the Bachelier and the Black-Scholes models. In high dimensions, nonlinear partial differential equation methods for…

Computational Finance · Quantitative Finance 2017-06-05 Christian Bayer , Juho Häppölä , Raúl Tempone

A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…

Optimization and Control · Mathematics 2021-01-26 Shuxiong Wang

We approximate the price of the American put for jump diffusions by a sequence of functions, which are computed iteratively. This sequence converges to the price function uniformly and exponentially fast. Each element of the approximating…

Computational Engineering, Finance, and Science · Computer Science 2008-12-03 Erhan Bayraktar , Hao Xing

We propose a method for pricing American options whose pay-off depends on the moving average of the underlying asset price. The method uses a finite dimensional approximation of the infinite-dimensional dynamics of the moving average…

Pricing of Securities · Quantitative Finance 2010-11-17 Marie Bernhart , Peter Tankov , Xavier Warin

We derive a stochastic gradient algorithm for semidefinite optimization using randomization techniques. The algorithm uses subsampling to reduce the computational cost of each iteration and the subsampling ratio explicitly controls…

Optimization and Control · Mathematics 2011-08-30 Alexandre d'Aspremont

We propose a new methodology for pricing options on flow forwards by applying infinite-dimensional neural networks. We recast the pricing problem as an optimization problem in a Hilbert space of real-valued function on the positive real…

Pricing of Securities · Quantitative Finance 2022-02-24 Fred Espen Benth , Nils Detering , Luca Galimberti

We study perpetual American option pricing problems in an extension of the Black-Merton-Scholes model in which the dividend and volatility rates of the underlying risky asset depend on the running values of its maximum and maximum drawdown.…

Probability · Mathematics 2016-04-12 Pavel V. Gapeev , Neofytos Rodosthenous

The value of an American option is the maximized value of the discounted cash flows from the option. At each time step, one needs to compare the immediate exercise value with the continuation value and decide to exercise as soon as the…

Computational Finance · Quantitative Finance 2023-06-27 Zineb El Filali Ech-Chafiq , Pierre Henry-Labordere , Jérôme Lelong

We consider the problem of minimizing a sum of several convex non-smooth functions. We introduce a new algorithm called the selective linearization method, which iteratively linearizes all but one of the functions and employs simple…

Optimization and Control · Mathematics 2016-08-16 Yu Du , Xiaodong Lin , Andrzej Ruszczynski

We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls. Our algorithms can be extended to some kernelized versions…

Machine Learning · Computer Science 2010-10-22 Kenneth L. Clarkson , Elad Hazan , David P. Woodruff