Consider n initially empty boxes, numbered 1 through n. Balls arrive sequentially. Each ball has a binary n-vector attached to it, with the interpretation that the ball is eligible to be put in box i if component i of its vector is equal to 1. An arriving ball can be put in any empty box for which it is eligible. Assuming that components of the vector are independent Bernoulli random variables with initially unknown probabilities, our primary interest is to compare several policies to determine which leads to a stochastically smaller number of observed balls until all boxes are filled.
Bibliographical noteFunding Information:
Funding: Financial support from the Israel Science Foundation [Grant 286/13 with University of Haifa] and the National Science Foundation Division of Civil, Mechanical, and Manufacturing Innovation [Grant CMMI1662442 with University of Southern California] is gratefully acknowledged.
Copyright: © 2020 INFORMS
- Sequential assignment problem
- Stochastic model application
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research