Issue |
ESAIM: ProcS
Volume 56, 2017
Enlargement of filtrations
|
|
---|---|---|
Page(s) | 111 - 135 | |
DOI | https://doi.org/10.1051/proc/201756111 | |
Published online | 04 September 2017 |
Martingale representation processes and applications in the market viability under information flow expansion
Laboratoire de Mathématiques et Modélisation d'Evry, Université d'Evry Val D'Essonne, France
* E-mail: shiqi.song@univ-evry.fr
When the martingale representation property holds, we call any local martingale which realizes the representation a representation process. There are two properties of the representation process which can greatly facilitate the computations under the martingale representation property. On the one hand, the representation process is not unique and there always exists a representation process which is locally bounded and has pathwise orthogonal components outside of a predictable thin set. On the other hand, the jump measure of a representation process satisfies the finite predictable constraint, which implies the martingale projection property. In this paper, we give a detailed account of these properties. As application, we will prove that, under the martingale representation property, the full viability of an expansion of market information flow implies the drift multiplier assumption.
© EDP Sciences, SMAI 2017
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.