اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputing wedge probabilities: finite time horizon case
75
0
0.0
(
0
)
تأليف
Dmitry Muravey
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an alternative to the well-known Andersons formula for the probability that a first exit time from the planar region between two slopping lines -a_1 t -b_1 and a_2 t + b_2 by a standard Brownian motion is greater than T. As the Andersons formula, our representation is an infinite series from special functions. We show that convergence rate of both formulas depends only on terms (a_1 + a_2)(b_1 + b_2) and (b_1 + b_2)^2 /T and deduce simple rules of appropriate representations choose. We prove that for any given set of parameters a_1, b_1, a_2, b_2, T the sum of first 6 terms ensures precision 10^{-16}.
قيم البحث
اقرأ أيضاً
In this paper, we consider the optimal stopping problem on semi-Markov processes (SMPs) with finite horizon, and aim to establish the existence and computation of optimal stopping times. To achieve the goal, we first develop the main results of finit
e horizon semi-Markov decision processes (SMDPs) to the case with additional terminal costs, introduce an explicit construction of SMDPs, and prove the equivalence between the optimal stopping problems on SMPs and SMDPs. Then, using the equivalence and the results on SMDPs developed here, we not only show the existence of optimal stopping time of SMPs, but also provide an algorithm for computing optimal stopping time on SMPs. Moreover, we show that the optimal and -optimal stopping time can be characterized by the hitting time of some special sets, respectively.
We investigate the probability that an insurance portfolio gets ruined within a finite time period under the assumption that the r largest claims are (partly) reinsured. We show that for regularly varying claim sizes the probability of ruin after rei
nsurance is also regularly varying in terms of the initial capital, and derive an explicit asymptotic expression for the latter. We establish this result by leveraging recent developments on sample-path large deviations for heavy tails. Our results allow, on the asymptotic level, for an explicit comparison between two well-known large-claim reinsurance contracts, namely LCR and ECOMOR. We finally assess the accuracy of the resulting approximations using state-of-the-art rare event simulation techniques.
In this paper we study a class of risk-sensitive Markovian control problems in discrete time subject to model uncertainty. We consider a risk-sensitive discounted cost criterion with finite time horizon. The used methodology is the one of adaptive robust control combined with machine learning.
This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations atoms are prescribed. Nec
essary and sufficient optimality conditions are established, and the rate of convergence (as the number of atoms goes to infinity) is discussed. In view of emerging mathematical and statistical applications, special attention is given to the case of best uniform approximations (i.e., all atoms having equal weight). The approach developed in this paper is elementary; it is based on best approximations of (monotone) $L^r$-functions by step functions, and thus different from, yet naturally complementary to, the classical Voronoi partition approach.
These notes are the second half of the contents of the course given by the second author at the Bachelier Seminar (8-15-22 February 2008) at IHP. They also correspond to topics studied by the first author for her Ph.D.thesis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
