Lévy模型下单次和递归最优停时的阈值型策略的最优性
On the optimality of threshold type strategies in single and recursive optimal stopping under Lévy models
摘要:
在[Surya07 ']的精神下,我们发展了一种平均问题方法来证明具有连续可加泛函(CAF)折扣的Lévy模型的最优停时的阈值型策略的最优性.在谱负模型下,我们专门研究了奖励函数和随机贴现的条件,在那里我们提出了两个本地时间和占用时间贴现的例子。然后,我们应用这种方法递归最优停时的问题,并提出了一些重要的结果的最佳阈值,这是只知道在少数特殊情况下的定性性质更简单,更整洁的证明。
英文摘要:
In the spirit of [Surya07'], we develop an average problem approach to prove the optimality of threshold type strategies for optimal stopping of Lévy models with a continuous additive functional (CAF) discounting. Under spectrally negative models, we specialize this in terms of conditions on the reward function and random discounting, where we present two examples of local time and occupation time discounting. We then apply this approach to recursive optimal stopping problems, and present simpler and neater proofs for a number of important results on qualitative properties of the optimal thresholds, which are only known under a few special cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。