Dynamic Marketing Resource Allocation with Two-Stage Decisions

5Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

Abstract

In the precision marketing of a new product, it is a challenge to allocate limited resources to the target customer groups with different characteristics. We presented a framework using the distance-based algorithm, K-nearest neighbors, and support vector machine to capture customers’ preferences toward promotion channels. Additionally, online learning programming was combined with machine learning strategies to fit a dynamic environment, evaluating its performance through a parsimonious model of minimum regret. A resource optimization model was proposed using classification results as input. In particular, we collected data from an institution that provides financial credit products to capital-constrained small businesses. Our sample contained 525,919 customers who will be introduced to a new product. By simulating different scenarios between resources and demand, we showed an up to 22.42% increase in the number of expected borrowers when KNN was performed with an optimal resource allocation strategy. Our results also show that KNN is the most stable method to perform classification and that the distance-based algorithm has the most efficient adoption with online learning.

Cite

CITATION STYLE

APA

Zhang, S., Liao, P., Ye, H. Q., & Zhou, Z. (2022). Dynamic Marketing Resource Allocation with Two-Stage Decisions. Journal of Theoretical and Applied Electronic Commerce Research, 17(1), 327–344. https://doi.org/10.3390/jtaer17010017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free