Optimizing Promotional Campaigns to Maximize Customer Lifetime Value: A Dynamic Learning Approach

Developing responsive dynamic marketing strategies can be challenging in the absence of complete customer information, such as share of wallet, limiting the ability of the firm to target promotions and other marketing efforts with a view to optimizing customer lifetime value (CLV). Furthermore, much of the existing research on CLV treats customers as receivers, rather than co-creators, of services. We address these two key challenges by developing a reinforcement learning (RL)-based promotion optimization model to determine which promotion strategies are most suitable for targeting different customer groups. Specifically, using feedback derived from customers’ real-time transactional responses to promotional campaigns, we present an RL algorithm that (a) continually refines the estimated effectiveness of promotions, aligning them to customers’ preferences to maximize their CLV, and that (b) supports value co-creation by involving customers as active participants to enhance their service experience. We demonstrate the effectiveness of the model through simulation scenarios within the context of a ferry travel agency, providing evidence of its real-world potential.

Authors

Institutions

Publication Details

Journal
Journal of Service Research
Published
2025-10-03
DOI
https://doi.org/10.1177/10946705251365524
Citations
1
Primary Topic
Customer churn and segmentation
Type
article
Field-Weighted Citation Impact
2.07
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Promotional Campaigns to Maximize Customer Lifetime Value: A Dynamic Learning Approach

Rupal Mandania, Jiyin Liu, Nayyar Kazmi, John W. Cadogan
1 citations
Journal of Service Research
Customer churn and segmentation
2.07
article

Optimizing Promotional Campaigns to Maximize Customer Lifetime Value: A Dynamic Learning Approach

Rupal Mandania, Jiyin Liu, Nayyar Kazmi, John W. Cadogan
article en
1 citations

Abstract

Developing responsive dynamic marketing strategies can be challenging in the absence of complete customer information, such as share of wallet, limiting the ability of the firm to target promotions and other marketing efforts with a view to optimizing customer lifetime value (CLV). Furthermore, much of the existing research on CLV treats customers as receivers, rather than co-creators, of services. We address these two key challenges by developing a reinforcement learning (RL)-based promotion optimization model to determine which promotion strategies are most suitable for targeting different customer groups. Specifically, using feedback derived from customers’ real-time transactional responses to promotional campaigns, we present an RL algorithm that (a) continually refines the estimated effectiveness of promotions, aligning them to customers’ preferences to maximize their CLV, and that (b) supports value co-creation by involving customers as active participants to enhance their service experience. We demonstrate the effectiveness of the model through simulation scenarios within the context of a ferry travel agency, providing evidence of its real-world potential.

Journal of Service Research
Loughborough University (GB), University of Leicester (GB), Open Data Institute (GB)
Openalex Percentile: Top 10%
Customer churn and segmentation
2.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimizing Promotional Campaigns to Maximize Customer Lifetime Value: A Dynamic Learning Approach — Rupal Mandania, Jiyin Liu, et al. · Journal of Service Research (2025) | TGRS Research Map | TGRS