Abstract
Given two optional positive bounded processesYandY′, defined on a probability space, and a non-negative reala,the problem is to maximize the average rewardE(YT) among all the stopping timesTverifying the following constraint:The problem is solved by Lagrangian saddlepoint techniques in the set of randomized stopping times including the set of stopping times.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.