نتایج جستجو برای: coupon collection problem

تعداد نتایج: 1050822  

Journal: :CoRR 2013
Benjamin Doerr Carola Doerr

Motivated by a problem in the theory of randomized search heuristics, we give a very precise analysis for the coupon collector problem where the collector starts with a random set of coupons (chosen uniformly from all sets). We show that the expected number of rounds until we have a coupon of each type is nHn/2 − 1/2± o(1), where Hn/2 denotes the (n/2)th harmonic number when n is even, and Hn/2...

1998
Arnon Boneh Micha Hofri

A standard combinatorial problem is to estimate the number (T ) of coupons, drawn at random, needed to complete a collection of all possible m types. Generalizations of this problem have found many engineering applications. The usefulness of the model is hampered by the difficulties in obtaining numerical results for moments or distributions. We show two computational paradigms that are well su...

Journal: :CoRR 2013
János Tapolcai Gábor Rétvári Attila Korösi

In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by merging isomorphic subtrees. I. COUPON COLLECTOR’S PROBLEM WITH ARBITRARY COUPON PROBABILITIES Given a set of C coupons, where δ = |C| denotes the number of coupons. At each draw po denotes the probability for gettin...

2007
Liqun Chen Alberto N. Escalante Hans Löhr Mark Manulis Ahmad-Reza Sadeghi

A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et al. (FC 2005), introduced an unforgeable privacy-protecting MC system with constant complexity for issuing and redemption of MCs, that discourages sharing of coupons through a property called weak unsplittability, w...

2004
Krishnaram Kenthapadi Gurmeet Singh Manku

We study Structured Coupon Collection, a problem introduced by Adler et al [AHKV03] in STOC 2003, over n/b disjoint cliques with b nodes per clique. Nodes are initially uncovered. At each step, we choose d nodes independently and uniformly at random. If all the nodes in the corresponding cliques are covered, we do nothing. Otherwise, from among the chosen cliques with at least one uncovered nod...

Journal: :Finance and Stochastics 2017
Zhe Cheng Scott Robertson

We consider the problem of identifying endogenous current coupons for To-BeAnnounced (TBA) agency mortgage pass through securities. Current coupons play a crucial role in the mortgage backed securities. The current coupon is said to be endogenous if it gives rise to a fairly, or par valued, TBA. Since prepayments both affect the value of the mortgage and depend heavily upon the coupon, the iden...

Journal: :IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2009

1999
Andrew J.G. Cairns

This paper discusses the use of parametric models for the term structure of interest rates and their uses. The paper focuses initially on a potential problem which arises out of the use of certain models. In most cases the process of parameter estimation involves the minimization or maximization of a function (for example, least squares or maximum likelihood). In some cases this function can ha...

Journal: :Journal of Computational and Applied Mathematics 2007

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید