LORE: a large-scale offer recommendation engine with eligibility and capacity constraints
LORE: a large-scale offer recommendation engine with eligibility and capacity constraints
复制标题
LORE:具有资格和容量限制的大规模报价推荐引擎
DOI:
--
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Yi Liu
中科院分区:
文献类型:
--
作者:
Rahul M. Makhijani;Shreya Chakrabarti;Dale Struble;Yi Liu
Businesses, such as Amazon, department store chains, home furnishing store chains, Uber, and Lyft, frequently offer deals, product discounts and incentives to drive sales, increase new product acceptance and engage with users. In order to appeal to diverse user groups, these businesses typically design more than one promotion offer but market different ones to different users. For instance, Uber offers a percentage discount in the rides to some users and a low fixed price to others. In this paper, we propose solutions to optimally recommend promotions and items to maximize user conversion constrained by user eligibility and item or offer capacity (limited quantity of items or offers) simultaneously. We achieve this through an offer recommendation model based on Min-Cost Flow network optimization, which enables us to satisfy the constraints within the optimization itself and solve it in polynomial time. We present two approaches that can be used in various settings: single period solution and sequential time period offering. We evaluate these approaches against competing methods using counterfactual evaluation in offline mode. We also discuss three practical aspects that may affect the online performance of constrained optimization: capacity determination, traffic arrival pattern and clustering for large scale setting.