A generalized coupon collecting model as a parsimonious optimal stochastic assignment model

Sheldon Ross () and David Wu ()

Annals of Operations Research, 2013, vol. 208, issue 1, 133-146

Abstract: There is a given set of n boxes, numbered 1 thru n. Coupons are collected one at a time. Each coupon has a binary vector x 1 ,…,x n attached to it, with the interpretation being that the coupon is eligible to be put in box i if x i =1,i=1…,n. After a coupon is collected, it is put in a box for which it is eligible. Assuming the successive coupon vectors are independent and identically distributed from a specified joint distribution, the initial problem of interest is to decide where to put successive coupons so as to stochastically minimize N, the number of coupons needed until all boxes have at least one coupon. When the coupon vector X 1 ,…,X n is a vector of independent random variables, we show, if P(X i =1) is nondecreasing in i, that the policy π that always puts an arriving coupon in the smallest numbered empty box for which it is eligible is optimal. Efficient simulation procedures for estimating P π (N>r) and E π [N] are presented; and analytic bounds are determined in the independent case. We also consider the problem where rearrangements are allowed. Copyright Springer Science+Business Media, LLC 2013

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1086-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:208:y:2013:i:1:p:133-146:10.1007/s10479-012-1086-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-012-1086-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().