Article contents
A note on the full-information Poisson arrival selection problem
Published online by Cambridge University Press: 14 July 2016
Abstract
This note studies a Poisson arrival selection problem for the full-information case with an unknown intensity λ which has a Gamma prior density G(r, 1/a), where a>0 and r is a natural number. For the no-information case with the same setting, the problem is monotone and the one-step look-ahead rule is an optimal stopping rule; in contrast, this note proves that the full-information case is not a monotone stopping problem.
MSC classification
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 2003
References
- 3
- Cited by