Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T01:13:09.287Z Has data issue: false hasContentIssue false

Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations

Published online by Cambridge University Press:  14 July 2016

Aiko Kurushima*
Affiliation:
Tokyo University of Science
Katsunori Ano*
Affiliation:
Institute of Applied Mathematics
*
∗ Postal address: Department of Industrial Management and Engineering, Faculty of Engineering, Tokyo University of Science, 1-14-6 Kudan-kita, Chiyoda-ku, Tokyo, 102-0073, Japan. Email address: kul@ms.kagu.tus.ac.jp
∗∗ Postal address: Department of Applied Probability, Asakusabashi, Taito-ku, Tokyo, Japan. Email address: kano@iapm.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 G λ(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 i (r) onwards. The value of s i (r) can be obtained for each r and i as the unique root of a deterministic equation.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2009