Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.contributor.advisor | Liu, Yan (LMS) | en_US |
dc.contributor.advisor | Wang, Yulan (LMS) | en_US |
dc.creator | Wang, Jingmai | - |
dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/11975 | - |
dc.language | English | en_US |
dc.publisher | Hong Kong Polytechnic University | en_US |
dc.rights | All rights reserved | en_US |
dc.title | A model of coalition reward programs | en_US |
dcterms.abstract | A coalition reward program is a joint reward program that links multiple brands in a partnership, such that consumers who make a purchase from a brand in the coalition earn a reward that is redeemable across the brands. However, despite the increasing prevalence of such programs, there have been some failures and setbacks in recent years. One famous example is the Plenti loyalty program, which announced its demise only three years after its launch. Plenti linked a remarkably wide variety of brands, including Macy's, Chili's, and AT&T, most of which now offer proprietary reward programs. This leads to the following questions: why did these brands return to proprietary reward programs? Which type of program is more effective for building customer loyalty and increasing firm profit: a proprietary reward program or a coalition reward program? Moreover, as coalition reward programs typically differ greatly in size, how can the optimal size be determined, and how does the size of a coalition affect its effectiveness? | en_US |
dcterms.abstract | This thesis will study the optimal design of coalition reward programs, whether joining a coalition benefits a firm, and how the size affects its effectiveness. To this end, we will start with the simplest case: a coalition reward program consisting of n independent and symmetric firms, each of which sells a non-durable product to infinitesimal customers over an infinite horizon. Time is continuous, and a customer visits each firm following a Poisson process at a rate λ. Thus, a customer visits the coalition at a rate nλ. Any purchase from a firm in the coalition earns the customer a reward that can be redeemed across the firms before the reward expires. The coalition manager chooses the price, the reward, the expiration term, and the size n to maximize the program's long-term average revenue. | en_US |
dcterms.abstract | We will use continuous-time dynamic programming to analyze the customer's decision problem for a given coalition program, in which the state represents whether the customer holds a valid reward when she visits the coalition. We will analyze the coalition's optimal decisions based on the customer's optimal behavior, and compare the coalition's profit with that of the proprietary reward program. Finally, we will investigate how to determine the optimal size. Overall, this thesis will study coalition reward programs from the perspective of operations management by determining the optimal design of the programs and developing an improved understanding of the rationale and effectiveness of such programs. | en_US |
dcterms.extent | ix, 73 pages : color illustrations | en_US |
dcterms.isPartOf | PolyU Electronic Theses | en_US |
dcterms.issued | 2022 | en_US |
dcterms.educationalLevel | M.Phil. | en_US |
dcterms.educationalLevel | All Master | en_US |
dcterms.LCSH | Customer loyalty | en_US |
dcterms.LCSH | Consumer satisfaction | en_US |
dcterms.LCSH | Retail trade | en_US |
dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/11975