• Aucun résultat trouvé

Erratum: Optimal stopping time problem in a general framework

N/A
N/A
Protected

Academic year: 2021

Partager "Erratum: Optimal stopping time problem in a general framework"

Copied!
3
0
0

Texte intégral

(1)

HAL Id: hal-01328196

https://hal.archives-ouvertes.fr/hal-01328196

Preprint submitted on 7 Jun 2016

HAL

is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire

HAL, est

destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Erratum: Optimal stopping time problem in a general framework

Magdalena Kobylanski, Marie-Claire Quenez

To cite this version:

Magdalena Kobylanski, Marie-Claire Quenez. Erratum: Optimal stopping time problem in a general

framework. 2016. �hal-01328196�

(2)

Erratum : Optimal stopping time problem in a general framework

Magdalena Kobylanski

Marie-Claire Quenez

The proof of the second point of Proposition B11 given in the Appendix of Kobylanski and Quenez (2012) ([1]) is only valid in the case where the reward process (φ

t

) is right-continuous.

We thus give below the proof in the case where (φ

t

) is only right-upper-semicontinuous.

Proof of the second point of Proposition B11 in the general case:

The proof of the second point is based on Proposition B7 in [1] and on some analytic arguments similar to those used in the proof of Theorem D13 in Karatzas and Shreve (1998) ([2]). Without loss of generality, we can suppose that for each ω, the map t 7→ v

+t

(ω) is right-continuous, the map t 7→ φ

t

(ω) is right-upper-semicontinuous, and t 7→ A

ct

(ω) is continuous.

Let us denote by J (ω) the set on which the nondecreasing function t 7→ A

ct

(ω) is “flat”:

J (ω) := {t ∈]0, T [ , ∃ε > 0 with A

ct−ε

(ω) = A

ct+ε

(ω)}

The set J (ω) is clearly open and hence can be written as a countable union of disjoint intervals:

J (ω) = ∪

i

i

(ω), β

i

(ω)[. We consider

J ˆ (ω) = ∪

i

i

(ω), β

i

(ω)[= {t ∈ [0, T [ , ∃ε > 0 with A

ct

(ω) = A

ct+ε

(ω)}.

The nondecreasing function t 7→ A

ct

(ω) is “flat” on ˆ J (ω), hence

R0T IJˆ(ω)

dA

ct

(ω) =

Pi

(A

cβ

i(ω)

(ω)−

A

cα

i(ω)

(ω)) = 0.

We next show that for almost every ω, H

c

(ω) ⊂ J ˆ (ω), which clearly provides the desired result.

Let us denote by

Q

the set of rationals. By Proposition B7 in [1] applied to constant stopping times θ := t, where t

Q

∩ [0, T [, it follows that for a.e. ω,

{t ∈

Q

∩ [0, T [ s.t. v

t

(ω) > φ

t

(ω)} ⊂ J ˆ (ω). (1) Let us now show that the desired inclusion

H

c

(ω) = {t ∈ [0, T [ s.t. v

t

(ω) > φ

t

(ω)} ⊂ J ˆ (ω) holds for a.e. ω.

To this purpose, we note that for each ω, φ

t

(ω)

>

lim sup

s→t+

φ

s

(ω) for each t, and v

t

(ω) = v

t+

(ω) for each t ∈ H

c

(ω), since v

t

= φ

t

v

t+

(cf. equation (B2) in [1]). Hence, for each ω, H

c

(ω) ⊂ K(ω), where K(ω) := {t ∈ [0, T [ s.t. v

+t

(ω) > lim sup

s→t+

φ

s

(ω)}. It is thus sufficient to show that for a.e. ω,

K(ω) = {t ∈ [0, T [ s.t. v

t+

(ω) > lim sup

s→t+

φ

s

(ω)} ⊂ J ˆ (ω).

(LAMA - UMR 8050) – Université Paris Est [email protected]

Laboratoire de Probabilitès et Modèles Aléatoires (L.P.M.A.) – Université DenisDiderot– Paris 7 [email protected]

1

(3)

Fix ω such that (1) holds and fix t ∈ K(ω). Since v

t+

(ω) > lim sup

s→t+

φ

s

(ω) and since the map t 7→ v

t+

(ω) is right continuous, there exists a non increasing sequence of rationals t

n

(ω) ∈

Q

∩ [0, T [ such that t = lim

n→∞

t

n

(ω) with v

t+

n(ω)

(ω) > φ

tn(ω)

(ω) for each n. Since v

.

(ω)

>

v

.+

(ω), it follows that for each n,

t

n

(ω) ∈ {t ∈

Q

∩ [0, T [ s.t. v

t

(ω) > φ

t

(ω)} ⊂ J ˆ (ω),

where the last inclusion corresponds to (1). Using the equality ˆ J (ω) = ∪

i

i

(ω), β

i

(ω)[ and the fact that t = lim

n→∞

t

n

(ω), we derive that there exist i and n

0

(which both depend on ω) such that for each n

>

n

0

, t

n

(ω) ∈ [α

i

(ω), β

i

(ω)[. It follows that the limit t ∈ [α

i

(ω), β

i

(ω)[, which gives that t ∈ J ˆ (ω). Hence, the inclusion H

c

(ω) ⊂ J ˆ (ω) is proven, which ends the proof of the second point.

References

[1] Kobylanski, M. and Quenez, M.-C. (2012). Optimal stopping time problem in a general framework, Electron.J.Probab. 17, No.72, 1-28.

[2] Karatzas I. and S. E. Shreve (1998), Methods of mathematical finance, Applications of Mathematics (New York), 39, Springer, New York.

Aknowledgement

The authors are grateful to Miryana Grigorova for her helpful comments.

2

Références

Documents relatifs

• Does agreement reduce need for

We give a crossed product con- struction of (stabilized) Cuntz-Li algebras coming from the a-adic numbers and investigate the structure of the associated algebras.. In particular,

We assume a set of function symbols, all of which have a computational interpretation as a PPT algorithm. Then, if M is the set of ground terms constructed using this set of

Studies (Centro Paraguayo de Estudios de Poblaci6n), to help mothers to space their pregnancies. The lack of adequate family planning services has clearly been a cause of

These issues include: extent of the impact of tuberculosis on the community, including its gender-related impact; effective measures to control and eliminate tuberculosis; how

In the cases which were considered in the proof of [1, Proposition 7.6], the case when the monodromy group of a rank 2 stable bundle is the normalizer of a one-dimensional torus

In this note we prove that the essential spectrum of a Schrödinger operator with δ-potential supported on a finite number of compact Lipschitz hypersurfaces is given by [0, +∞)..

In section 4, we point out the sensibility of the controllability problem with respect to the numerical approximation, and then present an efficient and robust semi-discrete scheme