-
公开(公告)号：US10546305B2
公开(公告)日：2020-01-28
申请号：US13269221
申请日：2011-10-07
申请人： Mohammad Mahdian , Kerem Tomak
发明人： Mohammad Mahdian , Kerem Tomak
摘要： A system is disclosed for a pay-per-action (PPA) advertising model. An advertiser reports actions and pays an advertising provider for each action that is reported. The payment may be based on the rate at which the actions are reported. The action rate may be updated based on each reported action, which may modify the payment for that action and may modify the payment for previous actions. A one-time premium may be charged to advertisers and a minimum action rate may be established to encourage advertisers to accurately report actions.
-
公开(公告)号：US08312049B2
公开(公告)日：2012-11-13
申请号：US10603034
申请日：2003-06-24
CPC分类号： G06K9/6224 , G06F17/3071
摘要： A system and/or method that facilitates analyzing newsgroup clusters. A data reception component receives data relating to a plurality of newsgroups and relays the data to an engine that constructs a weighted graph. The weighted graph represents a subset of the newsgroups as vertices of the graph. The vertices are connected by edges, which represent cross-postings relating to the subset of newsgroups.
摘要翻译： 一种便于分析新闻组群集的系统和/或方法。 数据接收组件接收与多个新闻组相关的数据，并将数据中继到构造加权图的引擎。 加权图表示新闻组的一个子集作为图的顶点。 顶点通过边连接，这表示与新闻组子集相关的交叉发布。
-
3.发明申请SYSTEM AND METHOD FOR OPTIMIZING ONLINE KEYWORD AUCTIONS SUBJECT TO BUDGET AND ESTIMATED QUERY VOLUME CONSTRAINTS 审中-公开根据预算和估计的查询量限制优化在线关键字拍卖的系统和方法公开(公告)号：US20090254397A1
公开(公告)日：2009-10-08
申请号：US12099055
申请日：2008-04-07
申请人： Mohammad Mahdian , Hamid Nazerzadeh
发明人： Mohammad Mahdian , Hamid Nazerzadeh
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0201 , G06Q30/0247 , G06Q30/0256 , G06Q30/0275
摘要： An improved system and method for optimizing online keyword auctions subject to budget and estimated query volume constraints is provided. A linear programming model of slates of advertisements may be created using estimates of the query volume for multiple time periods for use in generating a slate of advertisements that may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Upon receiving a query request, the slate generated by the linear program or a slate generated by dynamic programming may be chosen based on whether the weighted sum of prices for the slate of advertisements computed by dynamic programming may be within a factor of the weighted sum of the prices for the slate of advertisements computed by the linear program. The chosen slate of advertisements may then be served to accompany the search results of a query request to the web browser.
摘要翻译： 提供了一种改进的系统和方法，用于优化在预算和估计查询量约束下进行的关键字竞价。 可以使用对多个时间段的查询量的估计来创建用于广告的板条的线性规划模型，以用于生成可以以拍卖者的最佳收入的顺序代表候选广告组的广告平面。 在接收到查询请求时，可以基于由动态规划计算的广告的价格的加权和是否可以在由动态规划计算的广告的加权和 由线性程序计算的广告的价格。 然后可以将所选择的广告格式与查询请求的搜索结果一起被提供给网络浏览器。
-
公开(公告)号：US20050187803A1
公开(公告)日：2005-08-25
申请号：US10782687
申请日：2004-02-19
申请人： Kamal Jain , Mohammad Mahdian , Amin Saberi
发明人： Kamal Jain , Mohammad Mahdian , Amin Saberi
CPC分类号： G06Q30/06 , G06Q30/0283 , G06Q40/04
摘要： The present invention leverages demarcation of an agent into both a demander and a supplier to provide a polynomial-time method of approximating a supply and demand system's equilibrium value. This provides, in one instance of the present invention, a simplified means to iteratively extract the equilibrium value. By providing demarcated data, the present invention accounts for both demand and supply effects of an agent within a modeled supply and demand system. In one instance of the present invention, a market equilibrium price vector is approximated by employing a revenue value generated for an agent in a current market equilibrium price iteration as a budget value for the agent in the next iteration. This permits market equilibrium value modeling that encompasses an agent's contributions to a market both as a buyer and a seller within the same market for a given good and/or service.
摘要翻译： 本发明利用代理商对需求者和供应商的划分，以提供近似供需系统的均衡值的多项式时间方法。 这在本发明的一个实例中提供了迭代地提取平衡值的简化方法。 通过提供划分的数据，本发明考虑了在建模的供应和需求系统内的代理的需求和供应效应。 在本发明的一个实例中，通过使用在当前市场均衡价格迭代中为代理产生的收入值作为下一次迭代中的代理的预算值来近似市场均衡价格向量。 这允许市场均衡价值模型，其包括代理人作为买方和卖方在同一市场中作为给定的商品和/或服务的贡献。
-
公开(公告)号：US08069083B2
公开(公告)日：2011-11-29
申请号：US11835733
申请日：2007-08-08
申请人： Mohammad Mahdian , Kerem Tomak
发明人： Mohammad Mahdian , Kerem Tomak
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0239 , G06Q30/0242 , G06Q30/0247 , G06Q30/0257 , G06Q30/0273 , G06Q30/0274 , G06Q30/0275 , G06Q40/04
摘要： A system is disclosed for a pay-per-action (PPA) advertising model. An advertiser reports actions and pays an advertising provider for each action that is reported. The payment may be based on the rate at which the actions are reported. The action rate may be updated based on each reported action, which may modify the payment for that action and may modify the payment for previous actions. A one-time premium may be charged to advertisers and a minimum action rate may be established to encourage advertisers to accurately report actions.
摘要翻译： 公开了一种用于每次付费付费（PPA）广告模式的系统。 广告客户会针对已报告的每个操作报告操作并为广告提供商付费。 付款可以根据报告的行动速度。 可以基于每个报告的动作来更新动作率，其可以修改该动作的支付，并且可以修改先前动作的支付。 可能会向广告客户收取一次性溢价，并且可以建立最低行动费率，以鼓励广告客户准确地报告行动。
-
6.发明申请SYSTEM AND METHOD FOR EXPLORING NEW SPONSORED SEARCH LISTINGS OF UNCERTAIN QUALITY 有权用于探索不确定质量的新赞助搜索列表的系统和方法公开(公告)号：US20110191167A1
公开(公告)日：2011-08-04
申请号：US12700530
申请日：2010-02-04
申请人： Deepak K. Agarwal , Dz-Mou Jung , Sai-Ming Li , Mohammad Mahdian , R. Preston McAfee , Shanmugasundaram Ravikumar , David Reiley
发明人： Deepak K. Agarwal , Dz-Mou Jung , Sai-Ming Li , Mohammad Mahdian , R. Preston McAfee , Shanmugasundaram Ravikumar , David Reiley
CPC分类号： G06Q30/0246 , G06Q30/0275
摘要： According to some example embodiments, a method includes calculating learning values associated with a plurality of listings, at least one of said learning values associated with one of said listings representing a value based, at least in part, on a probability distribution of selections of said listing. The method further includes applying said learning values to ranking scores associated with said listings to provide an updated ranking, and electronically auctioning advertising inventory to purchasers associated with said listings based, at least in part, on said updated ranking.
摘要翻译： 根据一些示例性实施例，一种方法包括计算与多个列表相关联的学习值，所述学习值中的至少一个与所述列表中的一个相关联，表示至少部分地基于所述列表的选择的概率分布 清单。 该方法还包括将所述学习值应用于与所述列表相关联的排名分数以提供更新的排名，以及至少部分地基于所述更新的排名，向与所述列表相关联的购买者电子拍卖广告库存。
-
7.发明授权Systems and methods that facilitate maximizing revenue for multi-unit auctions with private budgets 失效促进利用私人预算最大化多单位拍卖收入的系统和方法公开(公告)号：US07636678B2
公开(公告)日：2009-12-22
申请号：US11107523
申请日：2005-04-15
IPC分类号： G06Q40/00
摘要： The subject invention relates to systems and methods that provide a truthful incentive-compatible mechanism for budget-constrained bidders in order to facilitate asymptotically maximizing revenue with multi-unit auctions in which individual bidders have private valuation per item (e.g., bids, offer prices, utility . . . ) and overall budgets. The systems and/or methods obtain bidder private bids and budget constraint, and separate this information into groups of bids and budgets. Each group is randomly reordered and utilized to determine a profit maximizing price as a function of the bids and budgets within that group. The groups of bids and budgets and the profit maximizing prices are utilized to allocate the auctioned items to respective bidders such that the allocation is based at least in part on the bids, budgets and prices. The systems and methods can be utilized to improve online auctioning.
摘要翻译： 本发明涉及为预算约束的投标者提供真实的激励兼容机制的系统和方法，以便通过多单位拍卖促进渐近最大化收入，其中个体投标者对每个物品进行私人估价（例如，出价，报价， 实用程序...）和总体预算。 系统和/或方法获得投标者私人出价和预算约束，并将这些信息分为出价和预算组。 每个组都随机重新排序并用于确定利润最大化价格与该组内的出价和预算的函数。 投标和预算的组合以及利润最大化的价格被用于将拍卖的物品分配给各自的投标人，使得分配至少部分地基于投标，预算和价格。 系统和方法可用于改进在线拍卖。
-
公开(公告)号：US20090043648A1
公开(公告)日：2009-02-12
申请号：US11835733
申请日：2007-08-08
申请人： Mohammad Mahdian , Kerem Tomak
发明人： Mohammad Mahdian , Kerem Tomak
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0239 , G06Q30/0242 , G06Q30/0247 , G06Q30/0257 , G06Q30/0273 , G06Q30/0274 , G06Q30/0275 , G06Q40/04
摘要： A system is disclosed for a pay-per-action (PPA) advertising model. An advertiser reports actions and pays an advertising provider for each action that is reported. The payment may be based on the rate at which the actions are reported. The action rate may be updated based on each reported action, which may modify the payment for that action and may modify the payment for previous actions. A one-time premium may be charged to advertisers and a minimum action rate may be established to encourage advertisers to accurately report actions.
摘要翻译： 公开了一种用于每次付费付费（PPA）广告模式的系统。 广告客户会针对已报告的每个操作报告操作并为广告提供商付费。 付款可以根据报告的行动速度。 可以基于每个报告的动作来更新动作率，其可以修改该动作的支付，并且可以修改先前动作的支付。 可能会向广告客户收取一次性溢价，并且可以建立最低行动费率，以鼓励广告客户准确地报告行动。
-
9.发明申请公开(公告)号：US20060136320A1
公开(公告)日：2006-06-22
申请号：US11107523
申请日：2005-04-15
IPC分类号： G06Q40/00
摘要： The subject invention relates to systems and methods that provide a truthful incentive-compatible mechanism for budget-constrained bidders in order to facilitate asymptotically maximizing revenue with multi-unit auctions in which individual bidders have private valuation per item (e.g., bids, offer prices, utility . . . ) and overall budgets. The systems and/or methods obtain bidder private bids and budget constraint, and separate this information into groups of bids and budgets. Each group is randomly reordered and utilized to determine a profit maximizing price as a function of the bids and budgets within that group. The groups of bids and budgets and the profit maximizing prices are utilized to allocate the auctioned items to respective bidders such that the allocation is based at least in part on the bids, budgets and prices. The systems and methods can be utilized to improve online auctioning.
-
公开(公告)号：US20050111386A1
公开(公告)日：2005-05-26
申请号：US10719182
申请日：2003-11-20
摘要： Systems and methods for packing Steiner trees are described. In one aspect, a set of Steiner trees and paths are generated from an undirected graph of vertices representing terminal and Steiner nodes. The Steiner trees and the paths are merged to produce linked and edge disjoint S-Steiner trees. If a subset S of the vertices is edge connected, then at minimum there are substantially α|S|k edge-disjoint Steiner trees for S, wherein αs is a sequence that tends to an asymptotic approximation factor of |S|/4 as S tends to infinity.
摘要翻译： 描述了用于包装Steiner树的系统和方法。 在一个方面，从表示终端和Steiner节点的顶点的无向图生成一组Steiner树和路径。 Steiner树和路径被合并，以产生链接和边缘不相交的S-Steiner树。 如果顶点的子集S是边缘连接的，那么对于S来说，基本上是基本上是α的边缘不相交的Steiner树，其中α是序列 趋向于渐近近似因子| S | / 4，因为S趋于无穷大。
-
-
-
-
-
-
-
-
-
搜索结果
36 条记录 (耗时 0.025 秒)
