arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1403.5768eess.SYcs.GTcs.SY
收藏

异步优化在线广告投资

Optimizing Your Online-Advertisement Asynchronously

Tsinghua University(清华大学);Institute for Interdisciplinary Information Sciences, Tsinghua University(清华大学交叉信息研究院)

Longbo Huang

AI总结:

本文提出一种异步贪心策略,用于单个广告商在多个搜索引擎站点上优化广告投资,以在预算限制下最大化平均收入,并证明其在动态估计不准确时的鲁棒性。

摘要:

我们考虑了为单个广告商设计最优在线广告投资策略的问题,该广告商同时在多个赞助搜索站点上投资,目标是最大化其平均收入,同时受广告预算约束。开发了一种贪心的在线投资方案,以实现平均收入可接近最优值,对于任意ε>0,误差为O(ε),但时间预算违规为O(1/ε)。与现有算法不同,我们的方案允许广告商在每个搜索引擎站点上异步更新投资,适用于不同站点行动更新时间尺度不一致的系统。我们还量化了系统动态估计不准确的影响,并展示了算法对不完美系统知识的鲁棒性。

英文摘要:

We consider the problem of designing optimal online-ad investment strategies for a single advertiser, who invests at multiple sponsored search sites simultaneously, with the objective of maximizing his average revenue subject to the advertising budget constraint. A greedy online investment scheme is developed to achieve an average revenue that can be pushed to within $O(ε)$ of the optimal, for any $ε>0$, with a tradeoff that the temporal budget violation is $O(1/ε)$. Different from many existing algorithms, our scheme allows the advertiser to \emph{asynchronously} update his investments on each search engine site, hence applies to systems where the timescales of action update intervals are heterogeneous for different sites. We also quantify the impact of inaccurate estimation of the system dynamics and show that the algorithm is robust against imperfect system knowledge.

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

↑