2015
DOI: 10.48550/arxiv.1511.01207
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Trajectory based models. Evaluation of minmax pricing bounds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…We emphasize that S W (s 0 , d, c, Q), as characterized above, does not need to be, in general, the set of all trajectories S satisfying the listed constraints in Definition (11); specific examples are described in [12]. Comparing with (4.2), we see that we have allowed F to be an independent variable W .…”
Section: Of Course With An Appropriately Chosen Value For D)mentioning
confidence: 99%
See 4 more Smart Citations
“…We emphasize that S W (s 0 , d, c, Q), as characterized above, does not need to be, in general, the set of all trajectories S satisfying the listed constraints in Definition (11); specific examples are described in [12]. Comparing with (4.2), we see that we have allowed F to be an independent variable W .…”
Section: Of Course With An Appropriately Chosen Value For D)mentioning
confidence: 99%
“…Not imposing (4.3) allows to incorporate 0-neutral nodes which are arbitrage nodes (see Definition 10 and related comments afterwards.) An analysis of these considerations in the context of the example is outside the scope of the paper, details are given in [12]. A natural discretization leading to an implementation of S W (s 0 , c, d, Q) is obtained by introducing real numbers δ , β > 0.…”
Section: Of Course With An Appropriately Chosen Value For D)mentioning
confidence: 99%
See 3 more Smart Citations