关于实际多战役分配的数学模型及其计算复杂性的注记
A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity
摘要:
在个性化营销中,被称为多广告分配的推荐问题是为了克服一个关键问题,即同时运行多个个性化广告时出现的多个推荐问题。本文主要讨论了市场营销中一个极具挑战性的问题--多广告商的分配难度。在这个问题中的目标是找到一个客户活动矩阵,最大限度地提高了多个活动的有效性在一定的约束条件下。我们提出了一个现实的响应抑制函数,这是为了更实用,并解释如何从历史数据中学习。此外,我们提供了一个证明,这个更现实的版本的问题是NP-难的,从而证明了使用在以前的工作中提出的算法。
英文摘要:
Within personalized marketing, a recommendation issue known as multicampaign assignment is to overcome a critical problem, known as the multiple recommendation problem which occurs when running several personalized campaigns simultaneously. This paper mainly deals with the hardness of multicampaign assignment, which is treated as a very challenging problem in marketing. The objective in this problem is to find a customer-campaign matrix which maximizes the effectiveness of multiple campaigns under some constraints. We present a realistic response suppression function, which is designed to be more practical, and explain how this can be learned from historical data. Moreover, we provide a proof that this more realistic version of the problem is NP-hard, thus justifying to use of heuristics presented in previous work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。