Pricing American contingent claims by stochastic linear programming

Date

2009

Authors

Camcı, A.
Pınar, M. Ç.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
39
downloads

Citation Stats

Series

Abstract

We consider pricing of American contingent claims (ACC) as well as their special cases, in a multi-period, discrete time, discrete state space setting. Until now, determining the buyer's price for ACCs required solving an integer programme unlike European contingent claims for which solving a linear programme is sufficient. However, we show that a relaxation of the integer programming problem that is a linear programme, can be used to get the same lower bound for the price of the ACC.

Source Title

Optimization

Publisher

Taylor & Francis

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English