An algorithm for calculating the set of superhedging portfolios in markets with transaction costs

Andreas L\"ohne and Birgit Rudloff

Papers from arXiv.org

Abstract: We study the explicit calculation of the set of superhedging portfolios of contingent claims in a discrete-time market model for d assets with proportional transaction costs. The set of superhedging portfolios can be obtained by a recursive construction involving set operations, going backward in the event tree. We reformulate the problem as a sequence of linear vector optimization problems and solve it by adapting known algorithms. The corresponding superhedging strategy can be obtained going forward in the tree. Examples are given involving multiple correlated assets and basket options. Furthermore, we relate existing algorithms for the calculation of the scalar superhedging price to the set-valued algorithm by a recent duality theory for vector optimization problems. The main contribution of the paper is to establish the connection to linear vector optimization, which allows to solve numerically multi-asset superhedging problems under transaction costs.

Date: 2011-07, Revised 2013-12
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Published in International Journal of Theoretical and Applied Finance 17 (2) 1450012 (33 pages), (2014)

Downloads: (external link)
http://arxiv.org/pdf/1107.5720 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1107.5720

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().