اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Stopping under G-expectation
65
0
0.0
(
0
)
تأليف
Hanwu Li
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We develop a theory of optimal stopping problems under G-expectation framework. We first define a new kind of random times, called G-stopping times, which is suitable for this problem. For the discrete time case with finite horizon, the value function is defined backwardly and we show that it is the smallest G-supermartingale dominating the payoff process and the optimal stopping time exists. Then we extend this result both to the infinite horizon and to the continuous time case. We also establish the relation between the value function and solution of reflected BSDE driven by G-Brownian motion.
قيم البحث
اقرأ أيضاً
In this paper, we study the optimal multiple stopping problem under the filtration consistent nonlinear expectations. The reward is given by a set of random variables satisfying some appropriate assumptions rather than an RCLL process. We first const
ruct the optimal stopping time for the single stopping problem, which is no longer given by the first hitting time of processes. We then prove by induction that the value function of the multiple stopping problem can be interpreted as the one for the single stopping problem associated with a new reward family, which allows us to construct the optimal multiple stopping times. If the reward family satisfies some strong regularity conditions, we show that the reward family and the value functions can be aggregated by some progressive processes. Hence, the optimal stopping times can be represented as hitting times.
The objective of this paper is to establish the decomposition theorem for supermartingales under the $G$-framework. We first introduce a $g$-nonlinear expectation via a kind of $G$-BSDE and the associated supermartingales. We have shown that this kin
d of supermartingales have the decomposition similar to the classical case. The main ideas are to apply the uniformly continuous property of $S_G^beta(0,T)$, the representation of the solution to $G$-BSDE and the approximation method via penalization.
A real valued function defined on}$mathbb{R}$ {small is called}$g${small --convex if it satisfies the following textquotedblleft generalized Jensens inequalitytextquotedblright under a given}$g${small -expectation, i.e., }$h(mathbb{E}^{g}[X])leq math
bb{E}% ^{g}[h(X)]${small, for all random variables}$X$ {small such that both sides of the inequality are meaningful. In this paper we will give a necessary and sufficient conditions for a }$C^{2}${small -function being}$% g ${small -convex. We also studied some more general situations. We also studied}$g${small -concave and}$g${small -affine functions.
This paper studies optimal Public Private Partnerships contract between a public entity and a consortium, in continuous-time and with a continuous payment, with the possibility for the public to stop the contract. The public (she) pays a continuous r
ent to the consortium (he), while the latter gives a best response characterized by his effort. This effect impacts the drift of the social welfare, until a terminal date decided by the public when she stops the contract and gives compensation to the consortium. Usually, the public can not observe the effort done by the consortium, leading to a principal agents problem with moral hazard. We solve this optimal stochastic control with optimal stopping problem in this context of moral hazard. The public value function is characterized by the solution of an associated Hamilton Jacobi Bellman Variational Inequality. The public value function and the optimal effort and rent processes are computed numerically by using the Howard algorithm. In particular, the impact of the social welfares volatility on the optimal contract is studied.
In this article we study and classify optimal martingales in the dual formulation of optimal stopping problems. In this respect we distinguish between weakly optimal and surely optimal martingales. It is shown that the family of weakly optimal and su
rely optimal martingales may be quite large. On the other hand it is shown that the Doob-martingale, that is, the martingale part of the Snell envelope, is in a certain sense the most robust surely optimal martingale under random perturbations. This new insight leads to a novel randomized dual martingale minimization algorithm that doesnt require nested simulation. As a main feature, in a possibly large family of optimal martingales the algorithm efficiently selects a martingale that is as close as possible to the Doob martingale. As a result, one obtains the dual upper bound for the optimal stopping problem with low variance.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
