Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T20:07:47.794Z Has data issue: false hasContentIssue false

Optimality Results for Coupon Collection

Published online by Cambridge University Press:  24 October 2016

Mark Brown*
Affiliation:
Columbia University
Sheldon M. Ross*
Affiliation:
University of Southern California
*
* Postal address: Department of Statistics, Columbia University, New York, NY 10027, USA. Email address: mb2484@columbia.edu
** Postal address: Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA. Email address: smross@usc.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider the coupon collection problem, where each coupon is one of the types 1,…,s with probabilities given by a vector 𝒑. For specified numbers r 1,…,r s , we are interested in finding 𝒑 that minimizes the expected time to obtain at least r i type-i coupons for all i=1,…,s. For example, for s=2, r 1=1, and r 2=r, we show that p 1=(logr−log(logr))∕r is close to optimal.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2016