在线广告、优化与随机网络
Online Advertisement, Optimization and Stochastic Networks
AI总结:
本文提出一种随机模型,通过将问题与无线网络调度、排队论和随机网络相联系,设计在线算法以在预算约束下最大化长期平均收入,并证明算法可达到接近最优的收入且透支可控。
摘要:
在本文中,我们提出一个随机模型来描述搜索服务提供商如何根据用户对与这些公司广告相关的关键词的查询,通过使用特定的广告分配策略向客户公司收费。我们制定了一个优化问题,以在每位客户的长期平均预算约束下最大化服务提供商的长期平均收入,并设计了一种在线算法,该算法捕捉了用户查询和点击行为的随机特性。我们通过将问题与无线网络中的调度问题、排队论和随机网络相联系来求解优化问题。与先前的模型不同,我们不假设查询到达数量是已知的。由于这里考虑的到达过程的随机性,要么暂时的“免费”服务(即超出指定预算的服务),要么预算利用不足是不可避免的。我们证明,我们的在线算法可以实现与最优收入相差$O(ε)$的收入,同时确保透支或不足为$O(1/ε)$,其中$ε$可以任意小。从实践的角度来看,我们可以证明始终可以在预算严格以下运行。此外,我们将结果扩展到点击率最大化模型,并展示了如何修改我们的算法以处理非平稳的查询到达过程和具有短期合同的客户。我们的算法使我们能够量化点击率估计误差对实现收入的影响。我们还表明,从长远来看,在任何能够实现长期平均收入与离线最优相差$O(ε)$的平稳广告分配算法下,$Ω(\log(1/ε))$的预期透支水平是不可避免的(一个通用下界)。
英文摘要:
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these companies' ads by using certain advertisement assignment strategies. We formulate an optimization problem to maximize the long-term average revenue for the service provider under each client's long-term average budget constraint, and design an online algorithm which captures the stochastic properties of users' queries and click-through behaviors. We solve the optimization problem by making connections to scheduling problems in wireless networks, queueing theory and stochastic networks. Unlike prior models, we do not assume that the number of query arrivals is known. Due to the stochastic nature of the arrival process considered here, either temporary "free" service, i.e., service above the specified budget or under-utilization of the budget is unavoidable. We prove that our online algorithm can achieve a revenue that is within $O(ε)$ of the optimal revenue while ensuring that the overdraft or underdraft is $O(1/ε)$, where $ε$ can be arbitrarily small. With a view towards practice, we can show that one can always operate strictly under the budget. In addition, we extend our results to a click-through rate maximization model, and also show how our algorithm can be modified to handle non-stationary query arrival processes and clients with short-term contracts. Our algorithm allows us to quantify the effect of errors in click-through rate estimation on the achieved revenue. We also show that in the long run, an expected overdraft level of $Ω(\log(1/ε))$ is unavoidable (a universal lower bound) under any stationary ad assignment algorithm which achieves a long-term average revenue within $O(ε)$ of the offline optimum.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。