0


在显示广告元交换中有效的在线广告服务

Efficient Online Ad Serving in a Display Advertising Meta-Exchange
课程网址: http://videolectures.net/wsdm2011_lang_dam/  
主讲教师: Kevin J. Lang
开课单位: 雅虎公司
开课时间: 2011-08-09
课程语种: 英语
中文简介:
介绍并形式化了一个新的约束路径优化问题,该问题是雅虎实时广告服务任务的核心。(原RightMedia)展示广告交换。在交换中,对于每个显示机会,ad服务器的任务是通过表示参与交换的成千上万个业务实体之间的业务安排的有向图以低延迟计算最佳有效路径。这些实体不仅包括发布者和广告商,还包括被称为“广告网络”的中间实体,它们将广告服务职责委托给交易所。路径的最优性是由支付给发布者的钱决定的,并受广告商的出价以及在返回发布者的选择路径中实体之间的收入共享协议的影响。路径效度由以下三个问题决定:1)机会网页及其发布者的适宜性;2)目前正在浏览该网页的用户的适宜性;3)候选人广告及其广告客户的适宜性。由于Exchange的约束路径优化任务比较新颖,目前还没有发布相关算法。本文描述了两种不同的算法,这两种算法在实际的Yahoo!广告服务器。第一个算法具有极其简单的优点,而第二个算法由于其多项式最坏情况运行时间而更加健壮。在这两种情况下,满足延迟上限需要通过优化改进基本算法;我们将描述一个候选排序方案和一个预计算方案,这两个方案都有效地减少了每天服务超过100亿个广告调用的实际广告服务系统中的延迟。
课程简介: We introduce and formalize a novel constrained path optimization problem that is the heart of the real-time ad serving task in the Yahoo! (formerly RightMedia) Display Advertising Exchange. In the Exchange, the ad server's task for each display opportunity is to compute, with low latency, an optimal valid path through a directed graph representing the business arrangements between the hundreds of thousands of business entities that are participating in the Exchange. These entities include not only publishers and advertisers, but also intermediate entities called "ad networks" which have delegated their ad serving responsibilities to the Exchange. Path optimality is determined by the payment to the publisher, and is affected by an advertiser's bid and also by the revenue-sharing agreements between the entities in the chosen path leading back to the publisher. Path validity is determined by constraints which focus on the following three issues: 1) suitability of the opportunity's web page and its publisher 2)suitability of the user who is currently viewing that web page, and 3) suitability of a candidate ad and its advertiser. Because the Exchange's constrained path optimization task is novel, there are no published algorithms for it. This paper describes two different algorithms that have both been successfully used in the actual Yahoo! ad server. The first algorithm has the advantage of being extremely simple, while the second is more robust thanks to its polynomial worst-case running time. In both cases, meeting latency caps has required that the basic algorithms be improved by optimizations; we will describe a candidate ordering scheme and a pre-computation scheme that have both been effective in reducing latency in the real ad serving system that serves over ten billion ad calls per day.
关 键 词: 雅虎; 计算机科学; 广告网络; 广告服务器
课程来源: 视频讲座网
最后编审: 2020-03-25:chenxin
阅读次数: 19