专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20080052219A1 System for and method of expressive auctions of user events 审中-公开
标题翻译：用户事件表现拍卖的系统和方法
公开(公告)号：US20080052219A1
公开(公告)日：2008-02-28
申请号：US11881737
申请日：2007-07-27
申请人： Tuomas Sandholm , David Parkes , Craig Boutilier , William Walsh
发明人： Tuomas Sandholm , David Parkes , Craig Boutilier , William Walsh
IPC分类号： G06Q40/00
CPC分类号： G06Q30/08 , G06Q40/04
摘要： Each bid received via a computer network is an offer for the right to cause at least one advert associated with the bid to be output to at least one device that is part of the computer network or in communication with the computer network in response to the bid being allocated one or more user events. At a time t, at least one rule or decision variable for allocating user events to bids is determined based on bids received before time t and an estimate of bids, user events or user activity occurring after time t. Based on information or data regarding a user event received from one of the devices after time t, the user event is allocated to at least one bid based on the at least one rule or decision variable and the at least one word, term, phrase or string of characters of the bid.
摘要翻译：通过计算机网络接收的每个投标都是将出价引起至少一个与广告相关联的广告的权利提供给至少一个作为计算机网络一部分的设备或与计算机网络响应于投标的通信被分配一个或多个用户事件。在时间t，基于在时间t之前收到的投标和在时间t之后发生的出价估计，用户事件或用户活动来确定用于将用户事件分配给出价的至少一个规则或决定变量。基于在时间t之后从设备中的一个接收到的用户事件的信息或数据，基于至少一个规则或决策变量和至少一个单词，术语，短语或一串字符的出价。

2. 发明申请

US20060224496A1 System for and method of expressive sequential auctions in a dynamic environment on a network 审中-公开
标题翻译：网络动态环境中的表现顺序拍卖的系统和方法
公开(公告)号：US20060224496A1
公开(公告)日：2006-10-05
申请号：US11396410
申请日：2006-03-31
申请人： Tuomas Sandholm , David Parkes , Craig Boutilier
发明人： Tuomas Sandholm , David Parkes , Craig Boutilier
IPC分类号： G06Q40/00
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q40/04
摘要： In an on-line ad auction, bids for the right to display at least one advert on a display of a computer of a computer network in response to the bid being allocated a query received from the computer are received via a computer network. At a time t, at least one rule or decision variable for allocating queries to bids is determined based on the bids received before time t and an estimate of at least one of: an estimate of queries to be received after time t; an estimate of events to occur in response to the display of adverts after time t; and/or an estimate of bids to be received after time t. After time t, a query received from the computer is allocated to at least one of the received bids based on the at least one rule or decision variable.
摘要翻译：在在线广告拍卖中，通过计算机网络接收在计算机网络的计算机的显示器上显示至少一个广告的权利的出价，以响应于从计算机接收的投标被分配的查询。在时间t，基于在时间t之前接收到的投标和至少一个估计值来确定用于分配查询到出价的至少一个规则或决策变量：在时间t之后要接收的查询的估计; 对在时间t之后显示广告而发生的事件的估计; 和/或在时间t之后收到的投标的估计。在时间t之后，基于至少一个规则或决策变量将从计算机接收的查询分配给所接收的出价中的至少一个。

3. 发明申请

US20050192865A1 Automated scenario navigation in combinatorial exchanges 有权
标题翻译：组合交换中的自动场景导航
公开(公告)号：US20050192865A1
公开(公告)日：2005-09-01
申请号：US11065333
申请日：2005-02-24
申请人： Craig Boutilier , Tuomas Sandholm , Robert Shields
发明人： Craig Boutilier , Tuomas Sandholm , Robert Shields
IPC分类号： G06Q30/00 , G06F17/60
CPC分类号： G06Q30/08 , G06Q30/0275 , G06Q30/0611 , G06Q40/04
摘要： A desirable allocation of bids in a combinatorial exchange can be selected by determining a first candidate allocation of the bids and a first value of a minimax regret, related to the difference in utility between the adversarial allocation and the candidate allocation, as a function of a first adversarial allocation of the bids. Based on the first candidate allocation, a second adversarial allocation of the bids and a first value of a maximum regret related to the difference in utility between the new adversarial allocation and the utility of the candidate allocation can be determined. When the value of the maximum regret is greater than the value of the minimax regret, the candidate allocation can be designated as the desirable allocation.
摘要翻译：可以通过确定投标的第一候选分配和与敌对分配和候选分配之间的效用差相关的最小值遗憾的第一值作为一个组合交换的函数来选择投标在组合交换中的期望分配。首先对抗性分配出价。基于第一个候选人分配，可以确定出价的第二个对抗分配和与新的对抗分配与候选分配的效用之间的效用差异相关的最大遗憾的第一值。当最大遗憾的值大于最小遗憾的值时，可以将候选分配指定为期望的分配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式