网络广告中的随机预算优化
Stochastic Budget Optimization in Internet Advertising
摘要:
互联网广告是一个复杂的游戏,许多广告商“玩”,以优化他们的投资回报。广告有许多“目标”,每个“目标”都有一组游戏,其中涉及的玩家可能不同。在本文中,我们研究的问题,广告客户如何分配他们的预算在这些“目标”。特别是,我们专注于制定他们的最佳对策作为一个优化问题。广告商有一组关键词(“目标”)和一些关于未来的随机信息,即成本与点击组合场景的概率分布。这总结了假设其他参与者的策略是固定的世界的潜在状态。然后,最佳响应可以抽象为随机预算优化问题,以找出如何在这些关键字之间分配给定的预算,以最大化预期的点击次数。我们提出了第一个已知的非平凡的多对数近似这些问题,以及第一个已知的硬度的结果得到更好的对数近似比在所涉及的各种参数。我们还确定了几个特殊的情况下,这些问题的实际利益,如固定数量的情况下,或与成本相关的多项式大小的参数,这是可解决的多项式时间或改进的近似比。情景随机预算优化具有复杂的技术结构。我们的近似和硬度的结果来自于这些问题的一种特殊类型的(0/1,二分)二次程序中固有的。我们的研究回答了作者在(Stochastic Models for Budget Optimization in Search-Based Advertising,Quartermica,58(4),1022-1044,2010)中提出的一些开放性问题。
英文摘要:
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the advertisements, and each "target" has a collection of games with a potentially different set of players involved. In this paper, we study the problem of how advertisers allocate their budget across these "targets". In particular, we focus on formulating their best response strategy as an optimization problem. Advertisers have a set of keywords ("targets") and some stochastic information about the future, namely a probability distribution over scenarios of cost vs click combinations. This summarizes the potential states of the world assuming that the strategies of other players are fixed. Then, the best response can be abstracted as stochastic budget optimization problems to figure out how to spread a given budget across these keywords to maximize the expected number of clicks. We present the first known non-trivial poly-logarithmic approximation for these problems as well as the first known hardness results of getting better than logarithmic approximation ratios in the various parameters involved. We also identify several special cases of these problems of practical interest, such as with fixed number of scenarios or with polynomial-sized parameters related to cost, which are solvable either in polynomial time or with improved approximation ratios. Stochastic budget optimization with scenarios has sophisticated technical structure. Our approximation and hardness results come from relating these problems to a special type of (0/1, bipartite) quadratic programs inherent in them. Our research answers some open problems raised by the authors in (Stochastic Models for Budget Optimization in Search-Based Advertising, Algorithmica, 58 (4), 1022-1044, 2010).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。