Optimal and asymptotically optimal decision rules for sequential screening and resource allocation

IEEE Transactions on Automatic Control

Volumn 46, Issue 5, 2001, Pages 687-697

  Pronzato, L ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Dynamic programming; Resource allocation; Sequential experimental design; Sequential screening; Stochastic assignment

Indexed keywords

ASYMPTOTIC STABILITY; CLOSED LOOP CONTROL SYSTEMS; COMPUTER SIMULATION; DECISION THEORY; DYNAMIC PROGRAMMING; FEEDBACK CONTROL; JOB ANALYSIS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RESOURCE ALLOCATION;

OPTIMAL DECISION RULES; SEQUENTIAL EXPERIMENTAL DESIGN; SEQUENTIAL SCREENING; STOCHASTIC ASSIGNMENT;

OPTIMAL CONTROL SYSTEMS;

EID: 0035331698     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.920787     Document Type: Article

References (31)

1. A sequential stochastic assignment problem
2. The compact muon solenoid, technical proposal, trigger and data acquisition
3. Who solved the secretary problem?
4. The secretary problem and its extensions: A review
5. Strategies in the secretary problem
6. Dynamic programming and decision theory
7. A secretary problem with uncertain employment
8. A secretary problem with uncertain employment and best choice of available candidates
9. A secretary problem with uncertain employment when the number of offers is restricted
10. A secretary problem with rank-dependent rejection probability when the number of offers is limited
11. The secretary problem with a call option
12. Recognizing the maximum of a random sequence based on relative rank with backward solicitation
13. A full-information best-choice problem with finite memory
14. Exact results for a secretary problem
15. Duration of a secretary problem
16. Recognizing both the maximum and the second maximum of a sequence
17. Asymptotically optimal policies for the stochastic sequential assignment problem
18. Dual effect, certainty equivalence, and separation in stochastic control
19. On a problem of L. Moser
20. On a problem of Cayley
21. A resource allocation problem in a random environment
22. A Markov chain version of the secretary problem
23. Sequential selection of observations in randomly generated experiments