Pathwise dynamic programming

Christian Bender, Christian Gärtner, Nikolaus Schweizer

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

We present a novel method for deriving tight Monte Carlo confidence intervals for solutions of stochastic dynamic programming equations. Taking some approximate solution to the equation as an input, we construct pathwise recursions with a known bias. Suitably coupling the recursions for lower and upper bounds ensures that the method is applicable even when the dynamic program does not satisfy a comparison principle. We apply our method to three nonlinear option pricing problems, pricing under bilateral counterparty risk, under uncertain volatility, and under negotiated collateralization.
Original languageEnglish
Pages (from-to)965-995
JournalMathematics of Operations Research
Volume43
Issue number3
DOIs
Publication statusPublished - Aug 2018

Keywords

  • stochastic dynamic programming
  • Monte Carlo
  • confidence bounds
  • option pricing

Fingerprint Dive into the research topics of 'Pathwise dynamic programming'. Together they form a unique fingerprint.

Cite this