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.
| Original language | English |
|---|---|
| Pages (from-to) | 1147-1154 |
| Number of pages | 8 |
| Journal | Journal of Applied Probability |
| Volume | 40 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2003 Dec |
| Externally published | Yes |
Fingerprint
Keywords
- OLA rule
- Optimal stopping
- Poisson process
- Secretary problem
ASJC Scopus subject areas
- Mathematics(all)
- Statistics and Probability
Cite this
A note on the full-information poisson arrival selection problem. / Kurushima, Aiko; Ano, Katsunori.
In: Journal of Applied Probability, Vol. 40, No. 4, 12.2003, p. 1147-1154.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A note on the full-information poisson arrival selection problem
AU - Kurushima, Aiko
AU - Ano, Katsunori
PY - 2003/12
Y1 - 2003/12
N2 - 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.
AB - 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.
KW - OLA rule
KW - Optimal stopping
KW - Poisson process
KW - Secretary problem
UR - http://www.scopus.com/inward/record.url?scp=0442275887&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0442275887&partnerID=8YFLogxK
U2 - 10.1239/jap/1067436106
DO - 10.1239/jap/1067436106
M3 - Article
VL - 40
SP - 1147
EP - 1154
JO - Journal of Applied Probability
JF - Journal of Applied Probability
SN - 0021-9002
IS - 4
ER -