Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:09:11.799Z Has data issue: false hasContentIssue false

On-line selection of an acceptable pair

Published online by Cambridge University Press:  14 July 2016

J. Preater*
Affiliation:
Keele University
*
∗ Postal address: Department of Mathematics, Keele University, Keele, Staffordshire ST5 5BG, UK. Email address: j.preater@keele.ac.uk
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.

A sequence of objects with independent, identically distributed qualities is presented to a selector who must choose two on-line, i.e. without anticipation or recall. The selector's aim is to obtain a satisfactory pair as quickly as possible. Two versions of the problem are considered, and optimal selection rules are derived and compared. An investigation is also made of a heuristic rule suitable for a selector who has no prior knowledge of the nature of the object sequence.

Information

Type
Research Article
Copyright
© Applied Probability Trust 2006