Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  DYNAMICAL PROGRAMMING
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
Przegląd Statystyczny
|
2006
|
vol. 53
|
issue 1
49-68
EN
In this paper we deal with quantile hedging of derivatives in the stochastic volatility (SV) models. We assume that temporary volatility of the stock prices is AR(1) process (autoregressive process of order 1). Then we formulate the problem of maximizing the expected success coefficient regarded that the cost of the hedging is limited. We describe how to solve this problem using dynamical programming method. Then we show empirical results for Polish stock market and compare the quality of the quantile hedging with the hedging based on Black-Scholes model
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.