Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A coupon collector's ...
Conference paper

A coupon collector's problem with bonuses

Toshio Nakata (1), Izumi Kubo (2)
(1) Department of Information Education
(2) Department of Environmental Design
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3515
License
https://about.hal.science/hal-authorisation-v1
Indicators
673
Views
1953
Downloads

A coupon collector's problem with bonuses

Toshio Nakata (1), Izumi Kubo (2)
(1) Department of Information Education
(2) Department of Environmental Design
Abstract
In this article, we study a variant of the coupon collector's problem introducing a notion of a \emphbonus. Suppose that there are c different types of coupons made up of bonus coupons and ordinary coupons, and that a collector gets every coupon with probability 1/c each day. Moreover suppose that every time he gets a bonus coupon he immediately obtains one more coupon. Under this setting, we consider the number of days he needs to collect in order to have at least one of each type. We then give not only the expectation but also the exact distribution represented by a gamma distribution. Moreover we investigate their limits as the Gumbel (double exponential) distribution and the Gauss (normal) distribution.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Coupon collector's problem
  • Gumbel distribution
  • central limit theorem
  • randomized algorithm
Cited by

Source: OpenCitations

  • Coupon Collector Problem with Reset Button

    Mathematics

    Authors : Jelena Jocković ORCID, Bojana Todić

    Journal reference : Volume 12, 2024, pp. 239

    DOI : 10.3390/math12020239
  • Waiting Time for a Small Subcollection in the Coupon Collector Problem with Universal Coupon

    Journal of Theoretical Probability

    Authors : Jelena Jocković ORCID, Bojana Todić

    Journal reference : Volume 37, 2024, pp. 1945-1957

    DOI : 10.1007/s10959-023-01312-2
  • Reading and writing digital data in DNA

    Nature Protocols

    Authors : Linda C. Meiser, Philipp L. Antkowiak ORCID, Julian Koch ORCID, Weida D. Chen, A. Xavier Kohll, Wendelin J. Stark ORCID, Reinhard Heckel ORCID, Robert N. Grass ORCID

    Journal reference : Volume 15, 2019, pp. 86-101

    DOI : 10.1038/s41596-019-0244-5
  • Some bounds on the coupon collector problem with universal coupon

    Analele Universităţii "Ovidius" Constanţa. Seria Matematică

    Authors : Jelena Jocković ORCID, Bojana Todić

    Journal reference : Volume 32, 2024, pp. 99-113

    DOI : 10.2478/auom-2024-0021
  • Markov chain approach to the coupon collector problem with universal coupon

    Filomat

    Authors : Jelena Jockovic, Bojana Todic

    Journal reference : Volume 38, 2024, pp. 8565-8581

    DOI : 10.2298/fil2424565j
Preview
Loading PDF preview...