Optimal Sequential Selection of Secretaries (Q3703579)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Sequential Selection of Secretaries |
scientific article; zbMATH DE number 3930713 |
Statements
Optimal Sequential Selection of Secretaries (English)
0 references
1985
0 references
secretary selection
0 references
sequential choice
0 references
optimal stopping
0 references
queue of applicants
0 references
asymptotically optimal procedure
0 references
0.8207495212554932
0 references
0.8204972147941589
0 references
0.799130916595459
0 references
The problem is to select as rapidly as possible a pre-specified number of secretaries (sequentially and without recall) from a queue of applicants. Each candidate makes demands in each of several currencies, and we know the joint probability distribution of these demands. We also have a given total budget in each currency. We consider procedures that minimize the expected number of interviews and derive an asymptotically optimal procedure. Derivation of this procedure depends on the following result. Given a probability measure F on the positive orthant Q and a point \(\rho_ 0\in Q\), consider a region \(A\subset Q\) whose center of gravity lies below \(\rho_ 0\) coordinatewise. Then F(A) is maximal when A is a simplicial section \(A=\{\rho:\rho \cdot \theta \leq r\}\), where \(r\geq 0\) and \(\theta\) is a unit vector in Q. The original motivation for this problem arose in connection with a scheme for selecting optical fibers.
0 references