有限时区上的最优转换和停止问题

讨论了有限时区上的最优转换和停止问题,它是一类同时具备脉冲控制和最优停止特征的最优控制问题.问题的最优值以及最优转换和停止决策可以由具有混合障碍的多维反射倒向随机微分方程的解来刻画.接着考虑了形式更一般的反射倒向随机微分方程并证明了方程解的存在唯一性.     

有限时区上的最优转换和停止问题

讨论了有限时区上的最优转换和停止问题,它是一类同时具备脉冲控制和最优停止特征的最优控制问题.问题的最优值以及最优转换和停止决策可以由具有混合障碍的多维反射倒向随机微分方程的解来刻画.接着考虑了形式更一般的反射倒向随机微分方程并证明了方程解的存在唯一性.     

连续时间随机过程的最优停止理论

§1 引言关于离散时间随机过程的最优停止问题,Chow,Robbins and Siegmund[1]已较系统地给出了研究结果.关于马尔可夫情形的最优停止问题,无论是离散的还是连续的,Shirgyayev[5]都系统地进行了研究.关于一般的连续时间随机过程最优停止的讨论,则是从 Fakejev[3]和 Thompson[8]开始的.     

从树型集上最优停止问题到一般偏序集上最优停止问题

本文讨论了树型集上与偏序集上最优停止问题两者间的关系，证明了最优策略与最优控制变量的一一对应关系，从而导出最优策略．可在最优控制变量中取到．     

秘书问题研究综述：何时停止搜索信息?

秘书问题是一类序贯观察与选择问题,描述了一种动态的信息搜索与决策过程,其问题实质是决定何时停止观察选项、而不是哪一个选项被选择.已有研究成果从解决该问题的策略方法角度,可以分为最优解策略与启发式策略,二者的差异主要体现在理论依据与研究方法上.最优解策略基于决策者完全理性假设,运用数学模型论证了解决该问题的最优决策行为。但许多实证研究发现,人们往往并没有遵循最优决策行为。相比较最优解策略而言,人们通常停止搜索信息太早或者说搜索量太少。这种基于决策者有限理性假设的描述性研究,在解释人们最优选择行为偏离的基础上,提出了解决秘书问题的一些启发式策略.最后,本文通过对已有研究成果的梳理与分析,提出了进一步研究的问题与方向。     

股票债券市场中一般的随机规划问题

本文讨论了股票债券市场中一类具有停时的随机规划问题，给出了投资者在股票债券市场中的最优投资消费决策和投资消费的最优停止时刻的计算方法．     

经典风险模型分红控制过程的最优停止问题

本文在带注资的经典风险模型的最优分红控制过程的基础上,进一步引入最优停止策略.目标是要找到最优的停止时刻,使得到该时刻为止,股东的折现分红与带有一定费用的折现注资二者之差的期望值最大化.通过建立值函数V(x)满足的HJB方程,我们找到了最优停止时刻τ~*.特别的,当索赔服从指数分布时,通过计算最终得到了值函数V(x)和最优停止时刻.τ~*的清晰表达式.     

会见队列的最优排列问题

面对面的会见是进行企业挑选人才的常用手段。当企业面对若干满足基本条件的候选人时,如何排列他们的会见顺序能使企业期望收益最大化,是企业所关心的问题。本文在最优停止理论的基础上研究了序贯观察与选择问题中最优会见队列的排列问题,给出并证明了最优的排列规则。     

一般报酬下的可拒绝秘书问题

本文讨论一般报酬下的秘书问题,每个候选的姑娘以一定的概率拒聘,而拒绝概率依赖于她的绝对名次和到达时刻。在某些附加假设下,得到了最优停止规则。作为特例,分别得到了使选中最好的姑娘的概率最大和使选中的姑娘的绝对名次的数学期望最小的最优停止规则。     

跳-扩散模型下相对收益过程带停时的均值-方差随机控制

针对跳扩散模型下鞅测度不唯一的问题,利用识别定理和Riccati方程研究了跳扩散模型下带停时的均值-方差随机控制问题,得到了相对收益过程最优投资策略的显式解及相应的最优停时,并且给出了在最优停止时间的均值方差有效边界.     

Continuity Properties of Optimal Multiple Stopping Value

This article is concerned with the optimal multiple stopping problem for discrete time finite stage stochastic processes. We study lower semicontinuity and continuity properties of optimal stopping values with respect to the topology of convergence in distribution. Also, we formulate the multiple stopping version of the prophet inequality for the optimal stopping problem and apply the lower semicontinuity property of optimal stopping values to the prophet inequality for the optimal multiple stopping problem.     

Approximation of optimal stopping problems

We consider optimal stopping of independent sequences. Assuming that the corresponding imbedded planar point processes converge to a Poisson process we introduce some additional conditions which allow to approximate the optimal stopping problem of the discrete time sequence by the optimal stopping of the limiting Poisson process. The optimal stopping of the involved Poisson processes is reduced to a differential equation for the critical curve which can be solved in several examples. We apply this method to obtain approximations for the stopping of iid sequences in the domain of max-stable laws with observation costs and with discount factors.     

Lower semicontinuity property of multiparameter optimal stopping value and its application to multiparameter prophet inequalities

This paper is concerned with the optimal stopping problem for discrete time multiparameter stochastic processes with the index set Nd. The optimal stopping value of a discrete time multiparameter integrable stochastic process whose negative part is uniformly integrable, is lower semicontinuous for the topology of convergence in distribution. The multiparameter version of prophet inequality for the one-parameter optimal stopping problem is formulated and the lower semicontinuity property of the optimal stopping value is applied to the multiparameter prophet inequality.     

Optimal Stopping Problem with a Vector-Valued Reward Function

In this note, using the well-known method of scalarization, we give an explicit characterization of the Pareto optimal stopping time for a vector-valued optimal stopping problem with only two reward functions. The present problem is a natural generalization of the classical McDonald-Siegel optimal stopping problem.     

Risk-sensitive stopping problems for continuous-time Markov chains

In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty equivalent of the stopping reward minus cost over the time horizon. We derive optimality equations for the value functions and prove the existence of optimal stopping times. The exponential utility is treated as a special case. In contrast to risk-neutral stopping problems it may be optimal to stop between jumps of the Markov chain. We briefly discuss the influence of the risk sensitivity on the optimal stopping time and consider a special house selling problem as an example.     

Reflected BSDEs and robust optimal stopping for dynamic risk measures with jumps

We study the optimal stopping problem for dynamic risk measures represented by Backward Stochastic Differential Equations (BSDEs) with jumps and its relation with reflected BSDEs (RBSDEs). The financial position is given by an RCLL adapted process. We first state some properties of RBSDEs with jumps when the obstacle process is RCLL only. We then prove that the value function of the optimal stopping problem is characterized as the solution of an RBSDE. The existence of optimal stopping times is obtained when the obstacle is left-upper semi-continuous along stopping times. Finally, we investigate robust optimal stopping problems related to the case with model ambiguity and their links with mixed control/optimal stopping game problems. We prove that, under some hypothesis, the value function is equal to the solution of an RBSDE. We then study the existence of saddle points when the obstacle is left-upper semi-continuous along stopping times.     

Optimal decision under ambiguity for diffusion processes

In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary optimal stopping problems for one-dimensional Brownian motions we reduce the problem to the geometric problem of finding the smallest majorant of the reward function in a two-parameter function space. In a second part we solve optimal stopping problems when the underlying process may crash down. These problems are reduced to one optimal stopping problem and one Dynkin game. Examples are discussed.     

A model for optimal stopping in advertisement

In this work we propose a model for optimal advertisement in new product diffusion based on the Bass model and assuming that the effect of the environmental pressure in the diffusion of the product is subject to a stochastic dependence. The optimal stopping problem is reduced to a free boundary problem which is analyzed and solved numerically, in order to determine an optimal stopping rule for the advertisement campaign. The numerical solution is obtained through a policy iteration like contraction scheme, the convergence properties of which are studied in detail. Furthermore, the expected time until the optimal stopping of the campaign is estimated. Finally, a combined optimal stopping and control problem for the optimization of the advertisement effectiveness is also proposed and solved numerically. Our results are expected to provide useful guidelines for campaign managers, for the choice of effectiveness and duration of an advertisement campaign.     

Optimal stopping problem in a model with compensated refusal of reward

We consider the optimal stopping problem with a possible compensated refusal of reward. We discuss functionals of exponential Brownian motion. The optimal stopping time is defined on the set of all finite stopping times. The functionals under consideration correspond to payments for standard American options.