公开(公告)号：US08155990B2

公开(公告)日：2012-04-10

申请号：US12359932

申请日：2009-01-26

申请人： David Max Chickering ,  Manan Sanghi ,  Ashis Roy ,  Robert Paul Gorman ,  Izzet Can Envarli

发明人： David Max Chickering ,  Manan Sanghi ,  Ashis Roy ,  Robert Paul Gorman ,  Izzet Can Envarli

IPC分类号： G06F17/50 ,  G06F9/44

CPC分类号： G06Q30/02 ,  G06Q10/0631 ,  G06Q10/087 ,  G06Q30/0201 ,  G06Q30/0241 ,  G06Q30/0269

摘要： Computer-readable media for determining whether to accept a candidate order from a content provider, or advertiser, to display a particular number of advertisements within a specified time segment are provided. Initially, the content provider may include placement criteria that, among other things, identify a leaf node at which impressions of the advertisement are expected to be rendered. Generally, the leaf node refers to a location within a topic graph that describes inventory that is permissible to allocate to satisfy the candidate order. To perform the determination, the inventory of impressions available for accommodating the candidate order and a log of booked orders scheduled to be placed within the time segment are identified. Linear programs are then utilized to determine whether the estimated inventory that satisfies the placement criteria is available by predictively placing the booked orders at the estimated inventory. If estimated inventory remains available, the candidate order is accepted.

摘要翻译： 提供了用于确定是否接受来自内容提供商或广告商的候选订单以在指定时间段内显示特定数量的广告的计算机可读介质。 最初，内容提供商可以包括放置标准，其中除了别的以外，还标识预期要呈现广告的展示的叶节点。 通常，叶节点是指主题图中描述可以分配以满足候选顺序的库存的位置。 为了执行确定，识别可用于容纳候选订单的可用印象的库存以及计划放置在时间段内的已预订订单的日志。 然后利用线性方案来确定满足放置标准的估计库存是否可通过将预定订单预测放在估计库存中来获得。 如果估计的库存仍然可用，则接受订单。

公开(公告)号：US20130238448A1

公开(公告)日：2013-09-12

申请号：US13415911

申请日：2012-03-09

申请人： Eduardo Villasenor ,  Bashar Kachachi ,  Rohan Bhattacharjee ,  Izzet Can Envarli ,  Paul Gorman ,  Corneliu Manescu ,  Manan Sanghi ,  Karlton Sequeira ,  Ramana Yerneni

发明人： Eduardo Villasenor ,  Bashar Kachachi ,  Rohan Bhattacharjee ,  Izzet Can Envarli ,  Paul Gorman ,  Corneliu Manescu ,  Manan Sanghi ,  Karlton Sequeira ,  Ramana Yerneni

IPC分类号： G06Q30/02

CPC分类号： G06Q30/00

摘要： Various embodiments pertain to techniques for forecasting and providing guaranteed delivery of ad impression opportunities using real-time bidded platform inventories. In various embodiments, bid landscape data, such as information regarding a number of impression requests by a particular supply unit, a time of the impression requests, and an amount of a winning bid for the impression requests, is recorded for use in forecasting an available impression volume as a function of cost. The forecasted available impression volume represents a number of ad impression requests likely to be obtained through real-time bidding channels. In various embodiments, an advertiser can place an order for a number of ad impressions at a particular price, and the ad impressions ordered can be specifically allocated for that advertiser. The number of ad impressions ordered by an advertiser that are guaranteed vary depending on the price and the available volume forecasted at that price.

摘要翻译： 各种实施例涉及用于使用实时出价的平台清单来预测和提供广告展示机会的保证传递的技术。 在各种实施例中，记录投标景观数据，例如关于特定供应单元的展示请求的数量的信息，展示请求的时间以及针对展示请求的中标出价的量，以用于预测可用的 印象量作为成本的函数。 预测的可用展示次数代表可能通过实时出价渠道获得的多个广告展示请求。 在各种实施例中，广告客户可以以特定价格发布多个广告展示的订单，并且可以为该广告客户专门分配订购的广告印象。 由保证的广告客户订购的广告展示次数取决于价格和以该价格预测的可用卷。

公开(公告)号：US20110246312A1

公开(公告)日：2011-10-06

申请号：US12751533

申请日：2010-03-31

申请人： Christopher A. Meek ,  Denis X. Charles ,  Nikhil Devanur Rangarajan ,  David M. Chickering ,  Manan Sanghi ,  Kamal Jain

发明人： Christopher A. Meek ,  Denis X. Charles ,  Nikhil Devanur Rangarajan ,  David M. Chickering ,  Manan Sanghi ,  Kamal Jain

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0241 ,  G06Q30/02 ,  G06Q30/0277

摘要： Various embodiments provide techniques for advertisement inventory. In at least some embodiments, a scaled number of impressions can be matched to orders that have scaled impression goals. Impressions can be randomly selected from an offline traffic model and allocated to orders according to a matching algorithm until a number of impression defined by a scale factor is reached. This can occur by sampling the traffic model directly using the scale factor and/or by creating a scaled data set to which the matching algorithm can be applied. The matching algorithm can be configured to identify an order that is farthest away from being complete and then match the randomly selected impression to the identified order. If the scaled orders in the data set can be fulfilled using the scaled number of impressions, a conclusion is made that the original set of orders can be fulfilled using the original impressions.

摘要翻译： 各种实施例提供广告库存的技术。 在至少一些实施例中，可以将缩放的展示次数与具有缩放的展示目标的订单相匹配。 可以从脱机流量模型中随机选择印象，并根据匹配算法分配给订单，直到达到由缩放因子定义的多个印象。 这可以通过使用比例因子直接采样流量模型和/或通过创建可应用匹配算法的缩放数据集来进行。 可以将匹配算法配置为识别最远离完成的顺序，然后将随机选择的印象与识别的顺序相匹配。 如果可以使用缩放的展示次数来满足数据集中的缩放顺序，则可以得出结论，可以使用原始展示次数来满足原始订单集。