Skip to main content Accessibility help
Home

# A best-choice problem with multiple selectors

## Abstract

Consider a situation where a known number, n, of objects appear sequentially in 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).

## Corresponding author

Postal address: Department of Statistics, Hebrew University, Jerusalem 91905, Israel. Email address: hagit_glickman@hotmail.com

## References

Hide All
Assaf, D., and Samuel-Cahn, E. (1998). Optimal multivariate stopping rules. J. Appl. Prob. 35, 693706.
Chow, Y. S., Robbins, H., and Siegmund, D. (1971). Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston.
Ferguson, T. S. (1989). Who solved the secretary problem? Statist. Sci. 4, 282289.
Gilbert, J., and Mosteller, F. (1966). Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 3573.
Glickman, H. (1999). Cooperative stopping rules in multivariate problems. Submitted.
Gnedin, A. V. (1982). Multicriterial problem of optimum stopping of the selection process (translated from Russian). Automat. Remote Control 42, 981986.
Joag-Dev, K., and Proschan, F. (1983). Negative association of random variables, with applications. Ann. Statist. 11, 286295.
Lehmann, E. L. (1966). Some concepts of dependence. Ann. Math. Statist. 43, 11371153.
Presman, E. L., and Sonin, I. M. (1975). Equilibrium points in a game related to the best choice problem. Theory Prob. Appl. 20, 770781.
Rinott, Y., and Samuel-Cahn, E. (1987). Comparisons of optimal stopping values and prophet inequalities for negatively dependent random variables. Ann. Statist. 15, 14821490.
Rinott, Y., and Samuel-Cahn, E. (1991). Orderings of optimal stopping values and prophet inequalities for certain multivariate distributions. Multivariate Anal. 37, 104114.
Sakaguchi, M. (1980). Non-zero-sum games related to the secretary problem. J. Operat. Res. Soc. Japan 23, 287293.
Samuels, S. M. (1991). Secretary problems. In Handbook of Sequential Analysis, eds Ghosh, B. K. and Sen, P. K. Marcel Dekker, New York, pp. 381405.
Samuels, S. M., and Chotlos, B. (1986). A multiple criteria optimal selection problem. In Adaptive Statistical Procedures and Related Topics (IMS Lecture Notes–-Monograph Series 8), ed. Van Ryzin, J., pp. 62-78.
Stadje, W. (1980). Efficient stopping of a random series of partially ordered points. In Multiple Criteria Decision Making Theory and Applications (Lecture Notes in Econ. Math. Systems 177), eds Fandel, G. and Gal, T. Springer, New York, pp. 430–447.

## Metrics

### Full text viewsFull text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

### Abstract viewsAbstract views reflect the number of visits to the article landing page.

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed