科研之友
微信
新浪微博
Facebook
分享链接
摘要
There are n boxes with box i having a quota value m i , i = 1 ... n . Balls arrive sequentially, with each ball having a binary vector X = ( X 1 , X 2 , ... , X n ) attached to it, with the interpretation being that if X-i=1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas.
- 出版日期2015-2
