Please use this identifier to cite or link to this item: https://doi.org/10.1137/110844179
DC FieldValue
dc.titleOptimal stock selling based on the global maximum
dc.contributor.authorDai, M.
dc.contributor.authorYang, Z.
dc.contributor.authorZhong, Y.
dc.date.accessioned2014-10-28T02:42:37Z
dc.date.available2014-10-28T02:42:37Z
dc.date.issued2012
dc.identifier.citationDai, M., Yang, Z., Zhong, Y. (2012). Optimal stock selling based on the global maximum. SIAM Journal on Control and Optimization 50 (4) : 1804-1822. ScholarBank@NUS Repository. https://doi.org/10.1137/110844179
dc.identifier.issn03630129
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103878
dc.description.abstractWe aim to determine an optimal stock selling time to minimize the expectation of the square error between the selling price and the global maximum price over a given period. Assuming that stock price follows the geometric Brownian motion, we formulate the problem as an optimal stopping time problem or, equivalently, a variational inequality problem. We provide a partial differential equation (PDE) approach to characterize the resulting free boundary that corresponds to the optimal selling strategy. The monotonicity and smoothness of the free boundary are addressed as well. © 2012 Society for Industrial and Applied Mathematics.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1137/110844179
dc.sourceScopus
dc.subjectGlobal maximum
dc.subjectOptimal selling strategy
dc.subjectSquare error
dc.subjectVariational inequality
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1137/110844179
dc.description.sourcetitleSIAM Journal on Control and Optimization
dc.description.volume50
dc.description.issue4
dc.description.page1804-1822
dc.description.codenSJCOD
dc.identifier.isiut000309999000004
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.