A note on the full-information poisson arrival selection problem

Aiko Kurushima, Katsunori Ano

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)1147-1154
Number of pages8
JournalJournal of Applied Probability
Volume40
Issue number4
DOIs
Publication statusPublished - 2003 Dec
Externally publishedYes

Fingerprint

Stopping rule
Optimal stopping

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 journalArticle

Kurushima, Aiko ; Ano, Katsunori. / A note on the full-information poisson arrival selection problem. In: Journal of Applied Probability. 2003 ; Vol. 40, No. 4. pp. 1147-1154.
@article{495ee40d3e5d4ac78eb451938dae0b0b,
title = "A note on the full-information poisson arrival selection problem",
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.",
keywords = "OLA rule, Optimal stopping, Poisson process, Secretary problem",
author = "Aiko Kurushima and Katsunori Ano",
year = "2003",
month = "12",
doi = "10.1239/jap/1067436106",
language = "English",
volume = "40",
pages = "1147--1154",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "University of Sheffield",
number = "4",

}

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 -