arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0612072cs.DScs.GT
收藏

搜索广告预算优化的随机模型

Stochastic Models for Budget Optimization in Search-Based Advertising

S. Muthukrishnan, Martin Pal, Zoya Svitkina

摘要:

互联网搜索公司基于用户的搜索查询通过拍卖出售广告位。广告商必须确定如何对他们感兴趣的关键字进行出价,以便在给定预算的情况下最大化他们的回报:这就是预算优化问题。解决方案取决于未来查询的分布。在本文中,我们制定随机版本的预算优化问题的基础上自然概率模型分布在未来的查询,并解决两个问题。[评价]给定一个解,我们能否评价目标函数的期望值?[优化]我们能找到一个最大化期望中的目标函数的解决方案吗?我们的主要结果是近似和复杂性的结果,这两个问题在我们的三个随机模型。特别是,我们的算法结果表明,简单的前缀策略,出价所有便宜的关键字达到一定的水平是最佳的或良好的近似在许多情况下,我们显示其他情况下是NP难的。

英文摘要:

Internet search companies sell advertisement slots based on users' search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their return for a given budget: this is the budget optimization problem. The solution depends on the distribution of future queries. In this paper, we formulate stochastic versions of the budget optimization problem based on natural probabilistic models of distribution over future queries, and address two questions that arise. [Evaluation] Given a solution, can we evaluate the expected value of the objective function? [Optimization] Can we find a solution that maximizes the objective function in expectation? Our main results are approximation and complexity results for these two problems in our three stochastic models. In particular, our algorithmic results show that simple prefix strategies that bid on all cheap keywords up to some level are either optimal or good approximations for many cases; we show other cases to be NP-hard.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑