Model uncertainty and the pricing of American options (Q503400): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors study American options under the conditions of model uncertainty. This uncertainty implies some flexibility in option pricing. The paper quantifies the potential value of this flexibility by identifying the supremum of the price of an American option when the class of all models consistent with a family of European call prices is considered. To solve the problem, a duality between pricing and hedging problems is established. The main theoretical result of the paper is that in the presence of a finite set of European call options, the supremum of the value of an American claim is equal to the cost of the cheapest superreplicating strategy. The proof demonstrates that the search for the cheapest strategy within a particular sub-family of replicating strategies (an upper bound on the price), and the search for the model which places the highest value on the American option within a particular sub-family of models, are the primal and dual of the same finite linear program, and have the same optimal value. Hence the cheapest superreplicating strategy lies in the chosen sub-family, and the model which gives the highest value to the American option is from the given sub-family of models. The methodology provides a viable method of computing the bound in practice.
Property / review text: The authors study American options under the conditions of model uncertainty. This uncertainty implies some flexibility in option pricing. The paper quantifies the potential value of this flexibility by identifying the supremum of the price of an American option when the class of all models consistent with a family of European call prices is considered. To solve the problem, a duality between pricing and hedging problems is established. The main theoretical result of the paper is that in the presence of a finite set of European call options, the supremum of the value of an American claim is equal to the cost of the cheapest superreplicating strategy. The proof demonstrates that the search for the cheapest strategy within a particular sub-family of replicating strategies (an upper bound on the price), and the search for the model which places the highest value on the American option within a particular sub-family of models, are the primal and dual of the same finite linear program, and have the same optimal value. Hence the cheapest superreplicating strategy lies in the chosen sub-family, and the model which gives the highest value to the American option is from the given sub-family of models. The methodology provides a viable method of computing the bound in practice. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Yuliya S. Mishura / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91G20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60G40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6674107 / rank
 
Normal rank
Property / zbMATH Keywords
 
American option
Property / zbMATH Keywords: American option / rank
 
Normal rank
Property / zbMATH Keywords
 
model-free pricing
Property / zbMATH Keywords: model-free pricing / rank
 
Normal rank
Property / zbMATH Keywords
 
robust hedging
Property / zbMATH Keywords: robust hedging / rank
 
Normal rank
Property / zbMATH Keywords
 
duality between pricing and hedging problems
Property / zbMATH Keywords: duality between pricing and hedging problems / rank
 
Normal rank
Property / zbMATH Keywords
 
replicating strategies
Property / zbMATH Keywords: replicating strategies / rank
 
Normal rank
Property / zbMATH Keywords
 
model risk
Property / zbMATH Keywords: model risk / rank
 
Normal rank
Property / zbMATH Keywords
 
rational bounds
Property / zbMATH Keywords: rational bounds / rank
 
Normal rank

Revision as of 00:56, 1 July 2023

scientific article
Language Label Description Also known as
English
Model uncertainty and the pricing of American options
scientific article

    Statements

    Model uncertainty and the pricing of American options (English)
    0 references
    0 references
    0 references
    12 January 2017
    0 references
    The authors study American options under the conditions of model uncertainty. This uncertainty implies some flexibility in option pricing. The paper quantifies the potential value of this flexibility by identifying the supremum of the price of an American option when the class of all models consistent with a family of European call prices is considered. To solve the problem, a duality between pricing and hedging problems is established. The main theoretical result of the paper is that in the presence of a finite set of European call options, the supremum of the value of an American claim is equal to the cost of the cheapest superreplicating strategy. The proof demonstrates that the search for the cheapest strategy within a particular sub-family of replicating strategies (an upper bound on the price), and the search for the model which places the highest value on the American option within a particular sub-family of models, are the primal and dual of the same finite linear program, and have the same optimal value. Hence the cheapest superreplicating strategy lies in the chosen sub-family, and the model which gives the highest value to the American option is from the given sub-family of models. The methodology provides a viable method of computing the bound in practice.
    0 references
    American option
    0 references
    model-free pricing
    0 references
    robust hedging
    0 references
    duality between pricing and hedging problems
    0 references
    replicating strategies
    0 references
    model risk
    0 references
    rational bounds
    0 references

    Identifiers