Inicio  /  Algorithms  /  Vol: 14 Par: 1 (2021)  /  Artículo
ARTÍCULO
TITULO

Perpetual American Cancellable Standard Options in Models with Last Passage Times

Pavel V. Gapeev    
Libo Li and Zhuoshu Wu    

Resumen

We derive explicit solutions to the perpetual American cancellable standard put and call options in an extension of the Black?Merton?Scholes model. It is assumed that the contracts are cancelled at the last hitting times for the underlying asset price process of some constant upper or lower levels which are not stopping times with respect to the observable filtration. We show that the optimal exercise times are the first times at which the asset price reaches some lower or upper constant levels. The proof is based on the reduction of the original optimal stopping problems to the associated free-boundary problems and the solution of the latter problems by means of the smooth-fit conditions.

 Artículos similares

       
 
Alireza Rezvanian, S. Mehdi Vahidipour and Ali Mohammad Saghiri    
Artificial immune systems (AIS), as nature-inspired algorithms, have been developed to solve various types of problems, ranging from machine learning to optimization. This paper proposes a novel hybrid model of AIS that incorporates cellular automata (CA... ver más
Revista: Algorithms

 
Lin Guo, Anand Balu Nellippallil, Warren F. Smith, Janet K. Allen and Farrokh Mistree    
When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resou... ver más
Revista: Algorithms

 
Yongyong Zhao, Jinghua Wang, Guohua Cao and Xu Yao    
This study introduces a reduced-order leg dynamic model to simplify the controller design and enhance robustness. The proposed multi-loop control scheme tackles tracking control issues in legged robots, including joint angle and contact-force regulation,... ver más
Revista: Applied Sciences

 
Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh and Mirpouya Mirmozaffari    
In this paper, the problem of finding an assignment of ?n? surgeries to be presented in one of ?m? identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, ... ver más

 
Angel A. Juan, Markus Rabe, Majsa Ammouriova, Javier Panadero, David Peidro and Daniel Riera    
In the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concep... ver más
Revista: Algorithms