Hostname: page-component-5db58dd55d-688nx Total loading time: 0 Render date: 2026-05-25T10:21:19.422Z Has data issue: false hasContentIssue false

A best-choice problem with multiple selectors

Published online by Cambridge University Press:  14 July 2016

Hagit Glickman*
Affiliation:
The Hebrew University of Jerusalem
*
Postal address: Department of Statistics, Hebrew University, Jerusalem 91905, Israel. Email address: hagit_glickman@hotmail.com

Abstract

Consider a situation where a known number, n, of objects appear sequentiallyin a random order. At each stage, the present object is presented to d ≥ 2 different selectors, who must jointly decide whether to select or reject it, irrevocably. Exactly one object must be chosen. The observation at stage j is a d-dimensional vector R (j) = (R 1(j),…, R d (j)), where R i (j) is the relative rank of the jth object, by the criterion of the ith selector. The decision whether to stop or not at time j is based on the d-dimensional random vectors R (1),…, R (j). The criteria according to which each selector ranks the objects can either be dependent or independent. Although the goal of each selector is to maximize the probability of choosing the best object from his/her point of view, all d selectors must cooperate and chose the same object. The objective studied here is the maximization of the minimum over the d individual probabilities of choosing the best object. We exhibit the structure of the optimal rule. For independent criteria we give a full description of the rule and show that the optimal value tends to d -d/(d-1), as n → ∞. Furthermore, we show that as n → ∞, the liminf of the values under negatively associated criteria is bounded below by d -d/(d-1).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable