English
Related papers

Related papers: Almost sure optimal hedging strategy

200 papers

Sharp asymptotic lower bounds of the expected quadratic variation of discretization error in stochastic integration are given. The theory relies on inequalities for the kurtosis and skewness of a general random variable which are themselves…

Probability · Mathematics 2012-04-04 Masaaki Fukasawa

We consider the hedging error of a derivative due to discrete trading in the presence of a drift in the dynamics of the underlying asset. We suppose that the trader wishes to find rebalancing times for the hedging portfolio which enable him…

Probability · Mathematics 2014-07-18 Jiatu Cai , Masaaki Fukasawa , Mathieu Rosenbaum , Peter Tankov

In this work, we consider the hedging error due to discrete trading in models with jumps. Extending an approach developed by Fukasawa [In Stochastic Analysis with Financial Applications (2011) 331-346 Birkh\"{a}user/Springer Basel AG] for…

Risk Management · Quantitative Finance 2014-04-29 Mathieu Rosenbaum , Peter Tankov

We study the approximation of certain stochastic integrals with respect to a d-dimensional diffusion by corresponding stochastic integrals with piece-wise constant integrands. In finance this corresponds to replacing a continuously adjusted…

Probability · Mathematics 2007-05-23 Mika Hujo

Asymptotic error distribution for approximation of a stochastic integral with respect to continuous semimartingale by Riemann sum with general stochastic partition is studied. Effective discretization schemes of which asymptotic conditional…

Probability · Mathematics 2010-04-14 Masaaki Fukasawa

In this paper, we study the behavior of the Hedge algorithm in the online stochastic setting. We prove that anytime Hedge with decreasing learning rate, which is one of the simplest algorithm for the problem of prediction with expert…

Machine Learning · Statistics 2019-07-10 Jaouad Mourtada , Stéphane Gaïffas

In this paper we study simulation based optimization algorithms for solving discrete time optimal stopping problems. This type of algorithms became popular among practioneers working in the area of quantitative finance. Using large…

Optimization and Control · Mathematics 2009-09-22 Denis Belomestny

Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optimal solution. However, in the absence of stochastic noise, the…

Optimization and Control · Mathematics 2022-10-06 Melinda Hagedorn , Florian Jarre

We present a new approach for studying the problem of optimal hedging of a European option in a finite and complete discrete-time market model. We consider partial hedging strategies that maximize the success probability or minimize the…

Pricing of Securities · Quantitative Finance 2009-10-28 Peter G. Lindberg

This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm's iterates under the…

Optimization and Control · Mathematics 2024-07-09 Anik Kumar Paul , Arun D Mahindrakar , Rachel K Kalaimani

The maximum entropy principle is a powerful tool for solving underdetermined inverse problems. This paper considers the problem of discretizing a continuous distribution, which arises in various applied fields. We obtain the approximating…

Numerical Analysis · Mathematics 2020-08-05 Ken'ichiro Tanaka , Alexis Akira Toda

We analyze the stability of general nonlinear discrete-time stochastic systems controlled by optimal inputs that minimize an infinite-horizon discounted cost. Under a novel stochastic formulation of cost-controllability and detectability…

Optimization and Control · Mathematics 2025-04-30 Robert H. Moldenhauer , Dragan Nešić , Mathieu Granzotto , Romain Postoyan , Andrew R. Teel

We present a methodology for obtaining explicit solutions to infinite time horizon optimal stopping problems involving general, one-dimensional, It\^o diffusions, payoff functions that need not be smooth and state-dependent discounting.…

Computational Finance · Quantitative Finance 2012-10-10 Timothy C. Johnson

A new method for stochastic control based on neural networks and using randomisation of discrete random variables is proposed and applied to optimal stopping time problems. The method models directly the policy and does not need the…

Computational Finance · Quantitative Finance 2021-01-11 Thomas Deschatre , Joseph Mikael

This paper studies an optimal control problem for continuous-time stochastic systems subject to reachability objectives specified in a subclass of metric interval temporal logic specifications, a temporal logic with real-time constraints.…

Systems and Control · Computer Science 2015-04-21 Jie Fu , Ufuk Topcu

We study the convergence behavior of the stochastic heavy-ball method with a small stepsize. Under a change of time scale, we approximate the discrete method by a stochastic differential equation that models small random perturbations of a…

Probability · Mathematics 2019-10-21 Wenqing Hu , Chris Junchi Li , Xiang Zhou

In this paper, we present a discretization algorithm for finite horizon risk constrained dynamic programming algorithm in [Chow_Pavone_13]. Although in a theoretical standpoint, Bellman's recursion provides a systematic way to find optimal…

Optimization and Control · Mathematics 2015-01-12 Yin-Lam Chow , Marco Pavone

We study the optimal investment stopping problem in both continuous and discrete case, where the investor needs to choose the optimal trading strategy and optimal stopping time concurrently to maximize the expected utility of terminal…

Mathematical Finance · Quantitative Finance 2020-05-01 Dingqian Sun

We consider a financial model with permanent price impact. Continuous time trading dynamics are derived as the limit of discrete rebalancing policies. We then study the problem of super-hedging a European option. Our main result is the…

Pricing of Securities · Quantitative Finance 2015-03-19 B. Bouchard , G. Loeper , Y. Zou

To design algorithms that reduce communication cost or meet rate constraints and are robust to communication noise, we study convex distributed optimization problems where a set of agents are interested in solving a separable optimization…

Optimization and Control · Mathematics 2023-05-02 Hadi Reisizadeh , Anand Gokhale , Behrouz Touri , Soheil Mohajer
‹ Prev 1 2 3 10 Next ›