CORC  > 江苏大学
A Recursive Algorithm for Selling at the Ultimate Maximum in Regime-Switching Models
Liu, Yue[1]; Privault, Nicolas[2]
刊名METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY
2018
卷号20期号:1页码:369-384
关键词Optimal stopping Markovian regime switching Non-monotone free boundary Recursive approximation
ISSN号1387-5841
DOIhttp://dx.doi.org/10.1007/s11009-017-9558-3
URL标识查看原文
收录类别SCI(E)
WOS记录号WOS:000424302700015
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/5339187
专题江苏大学
作者单位1.[1]Jiangsu Univ, Sch Finance & Econ, Zhenjiang 212013, Peoples R China.
2.[2]Nanyang Technol Univ, Sch Phys & Math Sci, 21 Nanyang Link, Singapore 637371, Singapore.
推荐引用方式
GB/T 7714
Liu, Yue[1],Privault, Nicolas[2]. A Recursive Algorithm for Selling at the Ultimate Maximum in Regime-Switching Models[J]. METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY,2018,20(1):369-384.
APA Liu, Yue[1],&Privault, Nicolas[2].(2018).A Recursive Algorithm for Selling at the Ultimate Maximum in Regime-Switching Models.METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY,20(1),369-384.
MLA Liu, Yue[1],et al."A Recursive Algorithm for Selling at the Ultimate Maximum in Regime-Switching Models".METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY 20.1(2018):369-384.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace