A note on the full-information poisson arrival selection problem

Aiko Kurushima; Katsunori Ano

doi:10.1239/jap/1067436106

A note on the full-information poisson arrival selection problem

Aiko Kurushima, Katsunori Ano

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	1147-1154
Number of pages	8
Journal	Journal of Applied Probability
Volume	40
Issue number	4
DOIs	https://doi.org/10.1239/jap/1067436106
Publication status	Published - 2003 Dec 1

Keywords

OLA rule
Optimal stopping
Poisson process
Secretary problem

ASJC Scopus subject areas

Statistics and Probability
Mathematics(all)
Statistics, Probability and Uncertainty

Access to Document

10.1239/jap/1067436106

Fingerprint Dive into the research topics of 'A note on the full-information poisson arrival selection problem'. Together they form a unique fingerprint.

Cite this

@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 = dec,

day = "1",

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/1

Y1 - 2003/12/1

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

AN - SCOPUS:0442275887

VL - 40

SP - 1147

EP - 1154

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 4

ER -