Optimization Results for a Generalized Coupon Collector Problem

Abstract : We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we prove that the almost uniform distribution, for which all the non-null coupons have the same drawing probability, is the distribution which stochastically minimizes the time needed to collect a fixed number of distinct coupons. Moreover, we show that in a given closed subset of probability distributions, the distribution with all its entries, but one, equal to the smallest possible value is the one, which stochastically maximizes the time needed to collect a fixed number of distinct coupons.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01397403
Contributor : Bruno Sericola <>
Submitted on : Monday, December 19, 2016 - 10:54:09 AM
Last modification on : Tuesday, April 2, 2019 - 2:27:24 AM
Long-term archiving on : Tuesday, March 21, 2017 - 7:56:00 AM

File

final_HAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01397403, version 1

Citation

Emmanuelle Anceaume, Yann Busnel, Ernst Schulte-Geers, Bruno Sericola. Optimization Results for a Generalized Coupon Collector Problem. Journal of Applied Probability, Applied Probability Trust, 2016, 53 (2). ⟨hal-01397403⟩

Share

Metrics

Record views

1949

Files downloads

141