×

Buyer’s quantile hedge portfolios in discrete-time trading. (English) Zbl 1281.91144

Summary: The problem of quantile hedging for American claims is studied from the perspective of the buyer of a contingent claim by minimizing the ‘expected failure ratio’. After a general study of the problem in infinite-state spaces, we pass to finite dimensions and examine the properties of the resulting finite-dimensional optimization problems. In finite-state probability spaces we obtain a bilinear programming formulation that admits an exact linearization using binary exercise variables. Numerical results with S&P 500 index options demonstrate the computational viability of the formulations.

MSC:

91G10 Portfolio theory
91G20 Derivative securities (option pricing, hedging, etc.)

Software:

GAMS; CONOPT
Full Text: DOI

References:

[1] DOI: 10.1007/978-1-4757-2836-1 · doi:10.1007/978-1-4757-2836-1
[2] DOI: 10.1137/1.9780898718829 · Zbl 0986.90032 · doi:10.1137/1.9780898718829
[3] Brooke A, GAMS: A User’s Guide (1992)
[4] DOI: 10.1080/02331930902819188 · Zbl 1167.90599 · doi:10.1080/02331930902819188
[5] DOI: 10.1111/1467-9965.00107 · Zbl 0993.91021 · doi:10.1111/1467-9965.00107
[6] Drud A, CONOPT Solver Manual (2007)
[7] DOI: 10.1007/s007800050062 · Zbl 0977.91019 · doi:10.1007/s007800050062
[8] DOI: 10.1007/s101070100257 · Zbl 1074.91018 · doi:10.1007/s101070100257
[9] DOI: 10.1142/S0219024905002925 · Zbl 1100.91045 · doi:10.1142/S0219024905002925
[10] DOI: 10.1080/1350486032000102924 · Zbl 1090.91054 · doi:10.1080/1350486032000102924
[11] DOI: 10.1016/j.jmaa.2004.01.010 · Zbl 1085.91032 · doi:10.1016/j.jmaa.2004.01.010
[12] DOI: 10.2307/2330879 · doi:10.2307/2330879
[13] Pennanen T, Arbitrage pricing of American contingent claims in incomplete markets – A convex optimization approach.
[14] DOI: 10.1080/14697680601158700 · Zbl 1151.91532 · doi:10.1080/14697680601158700
[15] DOI: 10.1080/13504860701352206 · Zbl 1151.91537 · doi:10.1080/13504860701352206
[16] DOI: 10.1080/14697680802169787 · Zbl 1158.91388 · doi:10.1080/14697680802169787
[17] Schrijver A, Theory of Linear and Integer Programming (1986)
[18] DOI: 10.1214/aoap/1029962873 · Zbl 0966.91042 · doi:10.1214/aoap/1029962873
[19] Van Tiel J, Convex Analysis: An Introductory Text (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.