Abstract
We extend the classical coupon collector problem to find the expected number of selections needed to collect $m_i$ (possible random) copies of coupon $i$, when the distribution of the coupons is not necessarily equally likely. Upper and lower bounds which provide limiting asymptotics are also obtained for the expected number of selections needed to fulfill a random quota for each coupon.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
