Related papers: Analyzing Collection Strategies: A Computational P…
We generalize the well-known Coupon Collector Problem (CCP) in combinatorics. Our problem is to find the minimum and expected number of draws, with replacement, required to recover $n$ distinctly labeled coupons, with each draw consisting…
We address a conjecture of Schilling concerning the optimality of the uniform distribution in the generalized Coupon Collector's Problem (CCP) where, in each round, a subset (package) of $s$ coupons is drawn from a total of $n$ distinct…
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…
We initiate the study of the Careless Coupon Collector's Problem (CCCP), a novel variation of the classical coupon collector, that we envision as a model for information systems such as web crawlers, dynamic caches, and fault-resilient…
The article explores the asymptotic behavior of the expected number of drawings in the Coupon Collector's Problem with group-drawing under the uniform distribution. In this variant, each draw consists of a package of $s$ distinct coupons…
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets $d$ distinct coupons each run and she chooses the one that she has the least so far. On the asymptotic case when the number…
The classic Coupon-Collector Problem (CCP) is generalized to the extent that each coupons serves certain "purposes". Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all $k$-element…
This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…
The paper introduces a modified version of the classical Coupon Collector's Problem entailing exchanges and cooperation between multiple players. Results of the development show that, within a proper Markov framework, the complexity of the…
In this note, we introduce a distributed twist on the classic coupon collector problem: a set of $m$ collectors wish to each obtain a set of $n$ coupons; for this, they can each sample coupons uniformly at random, but can also meet in…
We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We…
In this paper the coupon collector's problem with group drawings is studied. Assume there are $ n $ different coupons. At each time precisely $ s $ of the $ n $ coupons are drawn, where all choices are supposed to have equal probability.…
To approximate the trajectories of a stochastic process by the solution of some differential equation is widely used in the fields of probability, computer science and combinatorics. In this paper, the convergence of coupon collecting…
To reduce computational complexity and delay in randomized network coded content distribution (and for some other practical reasons), coding is not performed simultaneously over all content blocks but over much smaller subsets known as…
Transferring knowledge across a sequence of related tasks is an important challenge in reinforcement learning (RL). Despite much encouraging empirical evidence, there has been little theoretical analysis. In this paper, we study a class of…
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their…
We consider a generalisation of the classical coupon collector problem. We define a super-coupon to be any $s$-subset of a universe of $n$ coupons. In each round, a random $r$-subset from the universe is drawn and all its $s$-subsets are…
A collector wishes to collect $m$ complete sets of $N$ distinct coupons. The draws from the population are considered to be independent and identical distributed with replacement, and the probability that a type-$j$ coupon is drawn is noted…
In the classical coupon collector's problem, every box of breakfast cereal contains one coupon from a collection of n distinct coupons, each equally likely to appear. The goal is to find the expected number of boxes a player needs to…
Consider the coupon collector problem where each box of a brand of cereal contains a coupon and there are n different types of coupons. Suppose that the probability of a box containing a coupon of a specific type is $1/n$ and that we keep…