Have a personal or library account? Click to login
Some bounds on the coupon collector problem with universal coupon Cover
Open Access
|Jul 2024

References

  1. E. Anceaume, Y. Busnel, B. Sericola, New results on a generalized coupon collector problem using Markov chains, Journal of Applied Probability 52(2), 405418 (2015).
  2. E. Anceaume, Y. Busnel, E. Schulte-Geers, B. Sericola, Optimization Results for a Generalized Coupon Collector Problem, Journal of Applied Probability 53, 622-629 (2016).
  3. A. Boneh, M. Hofri, The Coupon-Collector Problem Revisited, Department of Computer Science Purdue University Technical Reports. Paper 807. https://docs.lib.purdue.edu/cstech/807(1989).
  4. A. W. Marshall, I. Olkin, B. C. Arnold, Inequalities: Theory of Majorization and Its Applications, 2nd. edn., Springer - Verlag, New York, (2011).
  5. S. Martinez, Some bounds on the coupon collector problem, Random Structures & Algorithms 25 (2), 208-226, (2004).
  6. T. Nakata, Coupon collector’s problem with unlike probabilities, Journal of Classical Analysis 14 (2), 177-180, (2019).
  7. T. Nakata, I. Kubo, A coupon collectors problem with bonuses. In: Proceedings of the 4th Colloquium on Mathematics and Computer Science, DMTCS Proceedings, 215224, (2006).
  8. S. Shioda, Some upper and lower bounds on the coupon collector problem, Journal of Computational and Applied Mathematics 200, 154167, (2007).
  9. N. Zoroa, E. Lesigne, M. J. Fernández-Sáez, P. Zoroa, J. Casas, The coupon collector urn model with unequal probabilities in ecology and evolution, J. R. Soc. Interface 14, 20160643 (2016).
DOI: https://doi.org/10.2478/auom-2024-0021 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 99 - 113
Submitted on: May 25, 2023
Accepted on: Oct 22, 2023
Published on: Jul 10, 2024
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2024 Jelena Jocković, Bojana Todić, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.