公开(公告)号：US20100185485A1

公开(公告)日：2010-07-22

申请号：US12355371

申请日：2009-01-16

申请人： Erik Vee ,  Donald Swanson ,  Jayavel Shanmugasundaram ,  Mark Sordo ,  Srinivasan Rajagopal ,  Martin Zinkevich ,  Sergei Vassilvitskii

发明人： Erik Vee ,  Donald Swanson ,  Jayavel Shanmugasundaram ,  Mark Sordo ,  Srinivasan Rajagopal ,  Martin Zinkevich ,  Sergei Vassilvitskii

IPC分类号： G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/02 ,  G06Q30/0251 ,  G06Q30/0254

摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating samples of representatives that represent impression inventory, where each sample represents a number of users to which impressions are deliverable. An order may be received. The order may include a number of impressions to book and target audience information. A cushion of impressions needed to guarantee delivery of the number of impressions ordered may be determined. The number of impressions ordered plus the cushion may be allocated from the samples. A contract including the target audience information, the number of impressions, and the cushion may be stored to a database.

摘要翻译： 提供了一种用于在因特网环境中分配库存的方法和系统。 系统使用的方法可以包括生成代表展示广告资源的代表的样本，其中每个样本表示可展示展示的用户数量。 可能会收到订单。 该订单可能包含许多展示以预订和定位受众群体信息。 可以确定为保证交付订购的展示次数所需的印象缓冲。 可以从样品中分配订购的印象数以及缓冲。 可以将包含目标受众信息，展示次数和缓冲的合同存储到数据库。

公开(公告)号：US20100185515A1

公开(公告)日：2010-07-22

申请号：US12355282

申请日：2009-01-16

申请人： Ramana Yerneni ,  Erik Vee ,  Minos Garofalakis ,  Srinivasan Rajagopal ,  Jayavel Shanmugasundaram ,  Mark Sordo ,  Donald Swanson ,  Sergei Vassilvitskii

发明人： Ramana Yerneni ,  Erik Vee ,  Minos Garofalakis ,  Srinivasan Rajagopal ,  Jayavel Shanmugasundaram ,  Mark Sordo ,  Donald Swanson ,  Sergei Vassilvitskii

IPC分类号： G06Q30/00 ,  G06Q10/00 ,  G06Q90/00

CPC分类号： G06Q30/02 ,  G06Q10/087 ,  G06Q30/0261 ,  G06Q30/0269

摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating an inventory pool that represents a number of impressions deliverable to all users, then determining, from multiple past orders for booking impressions, a hierarchy of parameters utilized to target users and a number of impressions deliverable to users characterized by the parameters. The inventory pool may then be partitioned into multiple inventory pools according to the hierarchy, where each inventory pool represents a number of impressions deliverable to users characterized by parameters associated with the inventory pool. The hierarchy of pools may then be stored to a database.

摘要翻译： 提供了一种用于在因特网环境中分配库存的方法和系统。 系统使用的方法可以包括生成表示可向所有用户递送的展示次数的库存池，然后从多个过去的订单中确定用于预定展示的用于定向用户的参数层级以及可递送给用户的多个展示次数 其特征在于参数。 然后可以根据层次结构将库存池划分为多个库存池，其中每个库存池代表可由可用于与库存池相关联的参数表征的用户可交付的一些展示次数。 然后可以将池的层次结构存储到数据库。

公开(公告)号：US20110270676A1

公开(公告)日：2011-11-03

申请号：US12771196

申请日：2010-04-30

申请人： Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Sumanth Jagannath ,  Erik Vee ,  Martin Zinkevich

发明人： Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Sumanth Jagannath ,  Erik Vee ,  Martin Zinkevich

IPC分类号： G06Q30/00 ,  G06N5/02

CPC分类号： G06Q30/02 ,  G06Q30/0251

摘要： A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification. Exemplary embodiments include generating a pseudo-random number sequence, and then selecting a particular pseudo-random number from the series of pseudo-random numbers, the selected particular pseudo-random number being based on the user ID, a visit count, a URL.

摘要翻译： 一种计算机实现的方法和显示广告服务器网络，用于向系统中的用于向用户传送显示广告的频率上限的保证递送合同提供展示机会。 该方法包括从计算机接收与用户相对应的事件谓词和用户ID的步骤，从索引引擎检索一组合格的频率上限合同，其中符合条件的合同包括至少一个目标谓词匹配 至少部分事件谓词，并且在计算机中概率地选择用于服务具有频率上限规范的预约合同，只有当所选择的频率上限的合同可以在不违反频率上限规范的情况下被提供给用户时。 示例性实施例包括生成伪随机数序列，然后从所述一系列伪随机数中选择特定的伪随机数，所选择的特定伪随机数基于用户ID，访问次数，URL。

公开(公告)号：US20110246307A1

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

申请号：US12751693

申请日：2010-03-31

申请人： Martin Zinkevich ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee

发明人： Martin Zinkevich ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0264 ,  G06Q30/02

摘要： A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display.

摘要翻译： 一种用于在用于传送显示广告的系统中的印象机会的计算机实现的互联网广告方法。 未来预测的用户访问可能提供预订合同的可能性计算为概率质量，并与预定的合同相关联。 将多个合格契约的概率质量的相对大小与所选择的伪随机数一起用作选择器。 在示例性实施例中，服务器被配置为作为用户访问网站的结果来接收事件谓词。 根据收到的事件谓词，汇总了一组符合条件的合同。 每个符合条件的合同都被分配到从一个范围中选择的一个间隔，该范围是与合格合同的概率质量相对应的间隔的大小。 生成的伪随机数用于选择间隔，该间隔选择合格的广告进行显示。

公开(公告)号：US20100318432A1

公开(公告)日：2010-12-16

申请号：US12482198

申请日：2009-06-10

申请人： Martin Zinkevich ,  Deepak K. Agarwal ,  Erik Vee ,  Peiji Chen ,  Long Ji Lin ,  Danny Zhang ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Ramana Yerneni

发明人： Martin Zinkevich ,  Deepak K. Agarwal ,  Erik Vee ,  Peiji Chen ,  Long Ji Lin ,  Danny Zhang ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Ramana Yerneni

IPC分类号： G06Q30/00

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

摘要： A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database.

摘要翻译： 一种用于在联网环境中分配库存的方法包括：接收购买多个显示印象的请求，所述请求包括目标参数和对应于广告可以向用户显示的最大次数的频率约束。 该方法还包括在一组用户样本中分配所请求的显示展示次数，其中分配给该组用户样本中的任何一个用户样本的展示次数受到频率约束的约束。 定义如何在用户样本之间分配展示的分配信息被存储到用户样本数据库。

公开(公告)号：US20100082401A1

公开(公告)日：2010-04-01

申请号：US12240749

申请日：2008-09-29

申请人： Erik Vee ,  Ramana Yerneni ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Srinivasan Rajagopal

发明人： Erik Vee ,  Ramana Yerneni ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Srinivasan Rajagopal

IPC分类号： G06Q30/00 ,  G06Q90/00

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

摘要： Subject matter disclosed herein relates to a system for managing online advertising, and in particular, to pricing of advertising inventory and its allocation to advertising campaigns.

摘要翻译： 本文公开的主题涉及用于管理在线广告的系统，特别涉及广告库存的定价及其对广告活动的分配。

公开(公告)号：US20110015999A1

公开(公告)日：2011-01-20

申请号：US12502330

申请日：2009-07-14

申请人： Sergei Vassilvitskii ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Srinivasan Rajagopal ,  Ramana Yerneni ,  Chad Brower

发明人： Sergei Vassilvitskii ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Srinivasan Rajagopal ,  Ramana Yerneni ,  Chad Brower

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0251 ,  G06Q30/0254 ,  G06Q30/0273

摘要： Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure.

摘要翻译： 本发明的实施例提供了用于在广告服务系统中利用格子结构的方法，系统和计算机程序产品。 根据本发明的一个实施例的方法包括将一个或多个广告合同存储在格子结构中。 然后接收对满足一个或多个约束的一个或多个广告的请求，并且在网格结构内，定位满足一个或多个约束的一个或多个广告合同池的最低级别。 生成一组广告合同，其中广告合同集合包括从网格结构的最低级别的一个或多个广告合同。 该方法还包括将广告合同中的广告合同的集合添加到网格结构的最低级别的父母的合同池中。

公开(公告)号：US08311885B2

公开(公告)日：2012-11-13

申请号：US12609427

申请日：2009-10-30

申请人： Oliver Kennedy ,  Tasos Anastasakos ,  Jianchang Mao ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Jian Yang ,  John Tomlin

发明人： Oliver Kennedy ,  Tasos Anastasakos ,  Jianchang Mao ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Jian Yang ,  John Tomlin

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0243 ,  G06Q30/02 ,  G06Q30/0244

摘要： An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy nonguaranteed demand. The data processing system includes an optimizer configured to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of proportions of allocation of the first portion and the second portion. The optimizer generates a solution maximizing guaranteed demand fairness, non-guaranteed demand revenue, and click value. The solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve. The data processing system outputs the allocation plan to control serving of the advertisement impressions.

摘要翻译： 广告印象分配系统包括可操作以产生用于投放广告印象的分配计划的数据处理系统。 分配计划分配广告展示的第一部分以满足保证需求和第二部分广告展示以满足不确定的需求。 数据处理系统包括被配置为建立广告印象的第一部分与广告印象的第二部分之间的关​​系的优化器。 关系定义了第一部分和第二部分的分配比例范围。 优化器生成一个最大化保证需求公平性，无保证需求收入和点击值的解决方案。 解决方案确定要投放的广告展示的第一部分的确定比例以及要投放的广告展示的第二部分的确定比例。 数据处理系统输出分配计划以控制广告印象的投放。

公开(公告)号：US08229933B2

公开(公告)日：2012-07-24

申请号：US12714142

申请日：2010-02-26

申请人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06F7/00

CPC分类号： G06Q30/08

摘要： An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.

摘要翻译： 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20110213767A1

公开(公告)日：2011-09-01

申请号：US12714142

申请日：2010-02-26

申请人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06F17/30

CPC分类号： G06Q30/08

摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.

摘要翻译： 使用固定长度的复合谓词表示自动匹配合同到库存的方法。 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。