Indexability of bandit problems with response delays
Probability in the Engineering and Informational Sciences
The Irrevocable Multiarmed Bandit Problem
Operations Research
Customer relationship management and Web mining: the next frontier
Data Mining and Knowledge Discovery
A Lagrangian approach to dynamic resource allocation
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
When a marketer in an interactive environment decides which messages to send to her customers, she may send messages currently thought to be most promising (exploitation) or use poorly understood messages for the purpose of information gathering (exploration). We assume that customers are already clustered into homogeneous segments, and we consider the adaptive learning of message effectiveness within a customer segment. We present a Bayesian formulation of the problem in which decisions are made for batches of customers simultaneously, although decisions may vary within a batch. This extends the classical multiarmed bandit problem for sampling one-by-one from a set of reward populations. Our solution methods include a Lagrangian decomposition-based approximate dynamic programming approach and a heuristic based on a known asymptotic approximation to the multiarmed bandit solution. Computational results show that our methods clearly outperform approaches that ignore the effects of information gain.