Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2010
Springer

favoriteEmaildiscussreport

70views Education» more CORR 2010»

A Generalized Coupon Collector Problem

13 years 1 months ago

A Generalized Coupon Collector Problem

Download people.ece.cornell.edu

This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least so far. In the asymptotic case when the number of coupons n goes to infinity, we show that on average n log n d + n d (m - 1) log log n+ O(mn) runs are needed to collect m sets of coupons. An efficient exact algorithm is also developed for any finite case to compute the average needed runs exactly. Numerical examples are provided to verify our theoretical predictions.

Weiyu Xu, Ao Kevin Tang

Real-time Traffic

CORR 2010 | Coupon Collector Problem | Coupons | Education | Efficient Exact Algorithm |

claim paper

Related Content

» Solving the Coupon Collectors Problem for the Safety Beaconing in the IEEE 80211p WAVE

» Neighbor discovery in wireless networks and the coupon collectors problem

» LevelingUp in Heroes of Might and Magic III

» When Random Play is Optimal Against an Adversary

» Paircoding Improving File Sharing Using Sparse Network Codes

» Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables

» A Network Coding Approach to IP Traceback

» TMOS A Transactional Garbage Collector

» Adaptive control of distributed collector solar fields

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Weiyu Xu, Ao Kevin Tang

Comments (0)