Some new aspects of the coupon-collector's problem

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We extend the classical coupon collector's problem to one in which two collectors are simultaneously and independently seeking collections of $d$ coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel-Viennot, the probability that the game has the following ``ballot-like'' character: the two collectors are tied with each other for some initial number of steps, and after that the player who first gains the lead remains ahead throughout the game. As a by-product we obtain the evaluation in finite terms of certain infinite series whose coefficients are powers and products of Stirling numbers of the second kind. We study the variant of the original coupon collector's problem in which a single collector wants to obtain at least $h$ copies of each coupon. Here we give a simpler derivation of results of Newman and Shepp, and extend those results. Finally we obtain the distribution of the number of coupons that have been obtained exactly once (``singletons'') at the conclusion of a successful coupon collecting sequence.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Some new aspects of the coupon-collector's problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some new aspects of the coupon-collector's problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some new aspects of the coupon-collector's problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-10472

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.