Optimizing Digital Coupon Assignment Using Constrained Reinforcement Learning

Xinlin Yao, Xianghua Lu
{"title":"Optimizing Digital Coupon Assignment Using Constrained Reinforcement Learning","authors":"Xinlin Yao, Xianghua Lu","doi":"10.1145/3310986.3311004","DOIUrl":null,"url":null,"abstract":"Coupon marketing is a traditional but effective way to retain customers and stimulate new purchases. Recently, digital coupons have been widely used in e-commerce and distributed to almost everyone. However, the decision on when and whom to issue the coupon is often based on managers' experience and calling for optimization and automation. Collaborated with a leading e-commerce platform, we propose an exploratory constrained reinforcement learning modeling to optimize digital coupon distribution policy under the constraint of maximum offering number. Our experimental results showed that the optimal policy could increase the cumulative total sales about 6% comparing to the original policy of the platform. This work enriches the applications of reinforcement learning in real-world business practices and provides useful implications for future study on constrained reinforcement learning.","PeriodicalId":252781,"journal":{"name":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3310986.3311004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Coupon marketing is a traditional but effective way to retain customers and stimulate new purchases. Recently, digital coupons have been widely used in e-commerce and distributed to almost everyone. However, the decision on when and whom to issue the coupon is often based on managers' experience and calling for optimization and automation. Collaborated with a leading e-commerce platform, we propose an exploratory constrained reinforcement learning modeling to optimize digital coupon distribution policy under the constraint of maximum offering number. Our experimental results showed that the optimal policy could increase the cumulative total sales about 6% comparing to the original policy of the platform. This work enriches the applications of reinforcement learning in real-world business practices and provides useful implications for future study on constrained reinforcement learning.
利用约束强化学习优化数字优惠券分配
优惠券营销是一种传统但有效的留住顾客和刺激新消费的方式。最近,电子优惠券在电子商务中被广泛使用,几乎分发到每个人。然而,何时以及由谁发放优惠券的决定往往是基于管理者的经验,并要求优化和自动化。我们与一家领先的电子商务平台合作,提出了一种探索性约束强化学习模型来优化最大供应数量约束下的数字优惠券分发策略。我们的实验结果表明,最优策略可以使平台的累计总销售额比原策略提高约6%。这项工作丰富了强化学习在现实世界商业实践中的应用,并为约束强化学习的未来研究提供了有用的启示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信