Purpose - In 2009, U.S. coupons set a new record of 367 billion coupons distributed. Yet, while coupon distribution is on the rise, redemption rates remain below 1%. This article shows how recognizing context variables, such as proximity, weather, part of town and financial incentives interplay to determine a coupon campaigns' success. Design/methodology/approach - The paper reports an empirical study conducted in cooperation with a restaurant chain: 9.880 Subway coupons were distributed under different experimental context conditions. Redemption behavior was analyzed with the help of logistic regressions. Findings - We found that even though proximity drives coupon redemption, city center campaigns seem to be much more sensitive to distance than suburban areas. The further away the distribution place from the restaurant the less does the amount of monetary incentive determine the motivation to redeem. Practical implications - When designing a coupon campaign for a company, coupon distribution should not follow a 'one-is-good-for-all-strategy' even for one marketer within one product category. Instead each coupon strategy should carefully consider contextual influence. Originality - This article is the first to our knowledge that systematically investigates the impact of context variables on coupon redemption. We focus on context variables that electronic marketing channels will be able to easily incorporate into personalized mobile marketing campaigns.

The purpose of this thesis is which use the Consumer Strategic Procedure of EKB model to study the behavior of using e-coupon and the factor that influence it, to enable the firm to be aware of the need form consumer, and improve the application of e-coupon. Thus the main purpose of this study is to discuss and analyze the effect of ¡§demographic variables¡¨ and ¡§lifestyle¡¨ on ¡¨motivation¡¨, ¡§information search behavior¡¨, ¡§choice evaluation criteria¡¨, and ¡§usage and result¡¨ respectively ¡V the characters and differences. Cooperating with the professional web which gathers e-coupon, this research targeted toward people who have used e-coupons by the internet questionnaire. A total of 507 valid questionnaires have been collected. It used statistical analysis methods such as Factor analysis, Cluster analysis, ANOVA and Chi-square method, to analyze the original data. The finding of this research is following:

Diss.--Münster--Univ., 1991. / Bibliogr. p. 380-428. Index.

Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (leaves 50-52).

No description available.

Forward rates and futures rates are conceptually identical in theory. In previous studies, the term structure has been used to demonstrate that there are synchronous changes among different maturities of coupon and zero-coupon bonds. Evidence has also been found that the magnitude of these synchronous changes is inversely related to the time to maturity. This study uses the Anderson-Leies synthetic zero-coupon yield curve from Caroline Leies' study of the Term Structure a/Zero-Coupon and Coupon Bonds. The term structure of the synthetic zero-coupon bonds is used to extract the "clean" implied forward rates embedded in its yield curve to be compared to the explicit futures rates of the Eurodollar. The evidence in this study suggests that the implied forward rates of the adjusted Anderson-Leies synthetic zero-coupon yield curve are not identical to the Eurodollar Futures rates. The adjusted forward rates were found, on average, to be less than the corresponding futures rates, suggesting that a risk premium is embodied in the Eurodollar futures rates. However, the adjusted forward rates are known to possess significant measurement errors that were unable to be corrected for, but whose possible sources are noted and explained. / Master of Arts

In group coupon service, customers get merchandise or service which features significant discount from vendor and service provider. However, there are gaps generated during service delivery and had effect on repurchase intention. We extend the E-S-QUAL and HSQM to find the dimensions in respectively service quality. The purpose of this research is to learn how service quality of vendor and service quality of service provider influence the repurchase intention on vendor and service provider, moderating with price sensitivity dimension. PLS (partial least squared) is used to analyze our measurement and structural models. The results include: (1) key dimensions of service provider¡¦s service quality in group coupon service model and group coupon service model with recovery are interaction quality, physical environment, fulfillment, and policy. Dimensions of service quality of vendor in regular case are information quality, efficiency, system availability, and assurance, while dimensions of service quality of vendor in recovery case are responsiveness, compensation, and contact. (2) Service quality of service provider has greater effect on repurchase intention on vendor than service quality of vendor in regular case. (3) Price Sensitivity has no significant moderating effect on the relationship between service quality of service provider and repurchase intention on service provider with regular price. Our research contributes to the nascent body of group coupon advertisement format and offer unique insights for the vendor and service provider on the importance of each role and what should be concern for the future.

The objective of this research is to develop distributed approaches to optimizing network traffic. Two problems are studied, which include exploiting social networks in routing packets (coupons) to desired network nodes (users in the social network), and developing a rate based transport protocol, which will guarantee that all the flows in a network (e.g. Internet) meet a delay constraint per packet. Firstly, we will study social networks as a means of obtaining information about a system. They are increasingly seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to know how much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of such discount coupons over an online social network, in which users forward coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihop wireless networks), we would like to demonstrate how to realize optimal revenue. We will then propose a simpler heuristic algorithm and try to show, using simulations, that its performance approaches that of backpressure routing. As the second problem, we look at the traditional formulation of the total value of information transfer, which is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under the framework of network utility maximization and has led to several different distributed congestion control schemes. However, this idea of value does not capture the fact that flows might associate value, not just with throughput, but with link-quality metrics such as packet delay, jitter and so on. The traditional congestion control problem is redefined to include individual source preferences. It is assumed that degradation in link quality seen by a flow adds up on the links it traverses, and the total utility is maximized in such a way that the quality degradation seen by each source is bounded by a value that it declares. Decoupling source-dissatisfaction and link-degradation through an ?effective capacity? variable, a distributed and provably optimal resource allocation algorithm is designed, to maximize system utility subject to these quality constraints. The applicability of our controller in different situations is illustrated, and results are supported through numerical examples.

In this paper, we study the properties of k-omnisequences of length n, defined to be strings of length n that contain all strings of smaller length k embedded as (not necessarily contiguous) subsequences. We start by proving an elementary result that relates our problem to the classical coupon collector problem. After a short survey of relevant results in coupon collection, we focus our attention on the number M of strings (or words) of length k that are not found as subsequences of an n string, showing that there is a gap between the probability threshold for the emergence of an omnisequence and the zero-infinity threshold for E(M).

In this paper, we study the properties of k-omnisequences of length n, defined to be strings of length n that contain all strings of smaller length k embedded as (not necessarily contiguous) subsequences. We start by proving an elementary result that relates our problem to the classical coupon collector problem. After a short survey of relevant results in coupon collection, we focus our attention on the number M of strings (or words) of length k that are not found as subsequences of an n string, showing that there is a gap between the probability threshold for the emergence of an omnisequence and the zero-infinity threshold for E(M).