2006
DOI: 10.1016/j.jedc.2004.11.003
|View full text |Cite
|
Sign up to set email alerts
|

Effective securities in arbitrage-free markets with bid–ask spreads at liquidation: a linear programming characterization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…(b) By Part (a), we can replace E byẼ without changing the value of (3). BothẼ and M C are bounded convex sets, so we can change the order of max and min without affecting the value in (3). For each fixed Q ∈ M, the objective function is linear in e, thus its max is achieved on the boundary ofẼ that is for e ∈ E, yielding the second part of the equality.…”
Section: Downloaded By [Bilkent University] At 06:11 14 July 2014mentioning
confidence: 99%
See 1 more Smart Citation
“…(b) By Part (a), we can replace E byẼ without changing the value of (3). BothẼ and M C are bounded convex sets, so we can change the order of max and min without affecting the value in (3). For each fixed Q ∈ M, the objective function is linear in e, thus its max is achieved on the boundary ofẼ that is for e ∈ E, yielding the second part of the equality.…”
Section: Downloaded By [Bilkent University] At 06:11 14 July 2014mentioning
confidence: 99%
“…In this work, we apply a linear programming method to price American options in a discrete and incomplete market model. The linear programming theory has been used in contexts of completeness by Naik [1], Ortu [2] and by Baccara et al [3]. As it is well known, we are no longer able to exhibit a unique price for derivatives.…”
Section: Introductionmentioning
confidence: 99%