Let G be a graph with no isolated vertices. A k-coupon coloring of G is an assignment of colors from [k] := {1, 2, . . . , k} to the vertices of G such that the neighborhood of every vertex of G contains vertices of all colors from [k]. The maximum k for which a k-coupon coloring exists is called the coupon coloring number of G, and is denoted χc(G). In this paper, we prove that every d-regular...

Some new exact distributions on coupon collector’s waiting time problems are given based on a generalized Pólya urn sampling. In particular, usual Pólya urn sampling generates an exchangeable random sequence. In this case, an alternative derivation of the distribution is also obtained from de Finetti’s theorem. In coupon collector’s waiting time problems with m kinds of coupons, the observed or...

With the advent of panel data on household purchase behavior, and the development of statistical procedtfres to utilize this data, firms can now target coupons to selected households with increasing accuracy and cost effectiveness. As a consequence, new avenues of competition have opened up in which firms play an active role in market segmentation. In this article, we develop an analytical fram...

Businesses (retailers) often wish to offer personalized advertisements (coupons) to individuals (consumers), but run the risk of strong reactions from consumers who want a customized shopping experience but feel their privacy has been violated. Existing models for privacy such as differential privacy or information theory try to quantify privacy risk but do not capture the subjective experience...

Several real-time delay-sensitive applications pose varying degrees of freshness demands on the requested content. The performance of cache replacement policies that are agnostic to these demands is likely to be sub-optimal. Motivated by this concern, in this paper, we study caching policies under a request arrival process which incorporates user freshness demands. We consider the performance m...

Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets r...

The overall objective of this paper is to introduce a new methodology of fitting zerocoupon yield curves. Toward this end, Chebyshev polynomials are incorporated into a quantity called the interest cumulator and then subjected to a minimisation procedure to yield parameters that subsequently maps out zero-coupon yield curves. This methodology is applied to Australian coupon bond data to estimat...

An existing coupon compression fixture was modified for testing cylindrical coupon samples of pultruded material in compression. Then a new fixture was developed for testing full-size structural shapes, which presents all the advantages of the coupon fixture. Particularly, splitting of the end of the sample is prevented while reducing the stress concentration factor at the ends, yielding compre...