Exercising control when confronted by a (Brownian) spider
File(s)
Published version
Author(s)
Ernst, Philip
Type
Journal Article
Abstract
We consider the Brownian ‘‘spider,’’ a construct introduced in Dubins and Schwarz (1988) and in Barlow
and Pitman (1989). In this note, the author proves the ‘‘spider’’ bounds by using the dynamic programming
strategy of guessing the optimal reward function and subsequently establishing its optimality by proving
its excessiveness.
and Pitman (1989). In this note, the author proves the ‘‘spider’’ bounds by using the dynamic programming
strategy of guessing the optimal reward function and subsequently establishing its optimality by proving
its excessiveness.
Date Issued
2016-07
Date Acceptance
2016-05-06
Citation
Operations Research Letters, 2016, 44 (4), pp.487-490
ISSN
0167-6377
Publisher
Elsevier BV
Start Page
487
End Page
490
Journal / Book Title
Operations Research Letters
Volume
44
Issue
4
Copyright Statement
© 2016 The Author(s). Published by Elsevier B.V.
This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
Identifier
https://www.sciencedirect.com/science/article/pii/S0167637716300281?via%3Dihub
Subjects
0102 Applied Mathematics
0103 Numerical and Computational Mathematics
1503 Business and Management
Operations Research
Publication Status
Published