|
Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2018, Volume 10, Issue 4, Pages 59–99
(Mi mgta227)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
A guaranteed deterministic approach to superhedging: financial market model,trading constraints and Bellman–Isaacs equations
Sergey N. Smirnov Department of System Analysis, Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University
Abstract:
A guaranteed deterministic problem setting of super-replication with discrete time is proposed, as an alternative to the traditional probabilistic approach based on the use of the reference measure. Within the proposed framework, the reference measure is not needed, and aim of hedging of contingent claim is to guarantee coverage of possible payout under the option contract for all admissible scenarios. These scenarios are given by means of a priori given compacts, that depend on the prehistory of prices: the increments of the price at each moment of time must lie in the corresponding compacts. The presentation focuses on achieving clarity, without aiming the greatest possible generality; this is the reason for the nature of a number of assumptions. The absence of transaction costs is assumed, the market is considered both with trade restrictions, and without trade restrictions. The game-theoretical
approach immediately allows us to write down the corresponding Bellman–Isaac equations using economic interpretation of the problem.
Keywords:
guaranteed estimates, deterministic price dynamics, super-replication, option, arbitrage, absence of arbitrage opportunities, Bellman–Isaacs equations, multi-valued mapping.
Citation:
Sergey N. Smirnov, “A guaranteed deterministic approach to superhedging: financial market model,trading constraints and Bellman–Isaacs equations”, Mat. Teor. Igr Pril., 10:4 (2018), 59–99
Linking options:
https://www.mathnet.ru/eng/mgta227 https://www.mathnet.ru/eng/mgta/v10/i4/p59
|
Statistics & downloads: |
Abstract page: | 531 | Full-text PDF : | 255 | References: | 51 |
|