Maximizing the expected duration of owning a relatively best object in a Poisson process with rankable observations

Aiko Kurushima, Katsunori Ano

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Suppose that an unknown number of objects arrive sequentially according to a Poisson process with random intensity λ on some fixed time interval [0, T]. We assume a gamma prior density Gsλ(r. 1/a) for λ. Furthermore, we suppose that all arriving objects can be ranked uniquely among all preceding arrivals. Exactly one object can be selected. Our aim is to find a stopping time (selection time) which maximizes the time during which the selected object will stay relatively best. Our main result is the following. It is optimal to select the ith object that is relatively best and arrives at some time s (r) i onwards. The value of s (r) i can be obtained for each r and i as the unique root of a deterministic equation.

Original languageEnglish
Pages (from-to)402-414
Number of pages13
JournalJournal of Applied Probability
Volume46
Issue number2
DOIs
Publication statusPublished - 2009 Jun
Externally publishedYes

Fingerprint

Poisson process

Keywords

  • Duration problem
  • Optimal stopping problem
  • Poisson arrival
  • Secretary problem

ASJC Scopus subject areas

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

Cite this

Maximizing the expected duration of owning a relatively best object in a Poisson process with rankable observations. / Kurushima, Aiko; Ano, Katsunori.

In: Journal of Applied Probability, Vol. 46, No. 2, 06.2009, p. 402-414.

Research output: Contribution to journalArticle

@article{c94c5a9b39224ed58c3f38083424ccb0,
title = "Maximizing the expected duration of owning a relatively best object in a Poisson process with rankable observations",
abstract = "Suppose that an unknown number of objects arrive sequentially according to a Poisson process with random intensity λ on some fixed time interval [0, T]. We assume a gamma prior density Gsλ(r. 1/a) for λ. Furthermore, we suppose that all arriving objects can be ranked uniquely among all preceding arrivals. Exactly one object can be selected. Our aim is to find a stopping time (selection time) which maximizes the time during which the selected object will stay relatively best. Our main result is the following. It is optimal to select the ith object that is relatively best and arrives at some time s (r) i onwards. The value of s (r) i can be obtained for each r and i as the unique root of a deterministic equation.",
keywords = "Duration problem, Optimal stopping problem, Poisson arrival, Secretary problem",
author = "Aiko Kurushima and Katsunori Ano",
year = "2009",
month = "6",
doi = "10.1239/jap/1245676096",
language = "English",
volume = "46",
pages = "402--414",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "University of Sheffield",
number = "2",

}

TY - JOUR

T1 - Maximizing the expected duration of owning a relatively best object in a Poisson process with rankable observations

AU - Kurushima, Aiko

AU - Ano, Katsunori

PY - 2009/6

Y1 - 2009/6

N2 - Suppose that an unknown number of objects arrive sequentially according to a Poisson process with random intensity λ on some fixed time interval [0, T]. We assume a gamma prior density Gsλ(r. 1/a) for λ. Furthermore, we suppose that all arriving objects can be ranked uniquely among all preceding arrivals. Exactly one object can be selected. Our aim is to find a stopping time (selection time) which maximizes the time during which the selected object will stay relatively best. Our main result is the following. It is optimal to select the ith object that is relatively best and arrives at some time s (r) i onwards. The value of s (r) i can be obtained for each r and i as the unique root of a deterministic equation.

AB - Suppose that an unknown number of objects arrive sequentially according to a Poisson process with random intensity λ on some fixed time interval [0, T]. We assume a gamma prior density Gsλ(r. 1/a) for λ. Furthermore, we suppose that all arriving objects can be ranked uniquely among all preceding arrivals. Exactly one object can be selected. Our aim is to find a stopping time (selection time) which maximizes the time during which the selected object will stay relatively best. Our main result is the following. It is optimal to select the ith object that is relatively best and arrives at some time s (r) i onwards. The value of s (r) i can be obtained for each r and i as the unique root of a deterministic equation.

KW - Duration problem

KW - Optimal stopping problem

KW - Poisson arrival

KW - Secretary problem

UR - http://www.scopus.com/inward/record.url?scp=67949088300&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67949088300&partnerID=8YFLogxK

U2 - 10.1239/jap/1245676096

DO - 10.1239/jap/1245676096

M3 - Article

AN - SCOPUS:67949088300

VL - 46

SP - 402

EP - 414

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 2

ER -