On the density of proper efficient points

Wantao, Fu

doi:10.1090/s0002-9939-96-03162-0

Cited by 12 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…+ with A a compact, convex set in R n . This theorem was extended to cover more general topological vector spaces (see [2,3,9,10,11,22,23]). In [22], Sterna-Karwat proved that in a normed vector space Z, there exists a C-approximating sequence of cones if and only if…”

mentioning

confidence: 99%

See 1 more Smart Citation

On the density of properly maximal claims in financial markets with transaction costs

Jacka¹,

Berkaoui²

2007

Ann. Appl. Probab.

View full text Add to dashboard Cite

We consider trading in a financial market with proportional transaction costs. In the frictionless case, claims are maximal if and only if they are priced by a consistent price process-the equivalent of an equivalent martingale measure. This result fails in the presence of transaction costs. A properly maximal claim is one which does have this property. We show that the properly maximal claims are dense in the set of maximal claims (with the topology of convergence in probability). This is an electronic reprint of the original article published by the Institute of Mathematical Statistics in The Annals of Applied Probability, 2007, Vol. 17, No. 2, 716-740. This reprint differs from the original in pagination and typographic detail. 1 2 S. JACKA AND A. BERKAOUI this is achieved by seeking maximal claims-claims Y which are maximal in A with respect to the partial order(see [6,7,8]). It follows from Kramkov's celebrated result on optional decompositions ([20]) that, at least in a discrete-time context, a claim X in A is maximal if and only if it is priced at 0 by some EMM. It also follows that this is true if and only if [A, X], the cone generated by A and −X, is arbitrage-free, in which case its closure is also arbitrage-free. Consequently (see [13] or [6]), one may obtain a hedging strategy for a maximal claim by martingale representation.Regrettably, when there are transaction costs, just as A may be arbitragefree butĀ contain an arbitrage, so, in this context, a claim X may be maximal and yet the closure of [A, X] contain an arbitrage.In the language of optimization theory, a maximal claim such that the closure of [A, X] is arbitrage-free is said to be proper efficient with respect to L 0,+ . We shall refer to such claims as properly maximal. We shall show in Theorem 2.9 that a properly maximal claim is priced by some consistent price process and that martingale representation can be used to obtain a hedging strategy. It is then of interest (for hedging purposes) as to whether one can approximate maximal claims by properly maximal claims. This is a problem with a long and distinguished history in optimization theory, going back to [1]. We give a positive answer (up to randomization) in Theorem 4.11: the collection of properly maximal claims is dense in the set of maximal claims.In a continuous time framework, the problem is more delicate. Indeed, the task of defining a notion of admissible trading strategy, that has a meaningful financial interpretation, is still in progress. A first solution has been given by Kabanov [15], Kabanov and Last [18] and Kabanov and Stricker [19], where the efficient friction assumption was made. More precisely, an admissible self-financing trading strategy was defined as an adapted, vector-valued, cádlág process of finite variation whose increments lie in the corresponding trading/solvency cones and whose terminal value is bounded from below by a constant with respect to the order induced by the terminal solvency cone. Campi and Schachermayer [4] extend these results to bid-ask pro...

show abstract

mentioning

confidence: 99%

“…The case of a locally convex vector space was discussed by, among others, Fu Wantao in [23]. He solved the density problem by supposing that the convex cone C admits a base B.…”

mentioning

confidence: 99%