公开(公告)号：US20070281663A1

公开(公告)日：2007-12-06

申请号：US11805087

申请日：2007-05-22

申请人： Tuomas Sandholm ,  Robert Shields ,  Bryan Bailey ,  Richard James McKenzie ,  Michael Pete Rose ,  Nick Kuyakanon ,  David L. Levine ,  Subhash Suri

发明人： Tuomas Sandholm ,  Robert Shields ,  Bryan Bailey ,  Richard James McKenzie ,  Michael Pete Rose ,  Nick Kuyakanon ,  David L. Levine ,  Subhash Suri

IPC分类号： H04M11/00

CPC分类号： H04L12/14 ,  H04L12/1439 ,  H04L12/1485 ,  H04W28/18

摘要： In an allocation of subscribers to one or more wireless carrier rate plans, a number of wireless voice and/or data carrier rate plans is selected and each subscriber's historical wireless time usage for each of a number of foregone time intervals is determined. For each combination of subscriber and rate plan a first expression is defined that includes a unique variable and a cost associated with assigning the subscriber to the rate plan for at least one of the time intervals. Constraints that collectively ensure that subscribers are allocated to a specified minimum or maximum number of rate plans, or restrict a subscriber to be allocated to just one rate plan are determined. The expressions and constraints are processed by an optimal solution solver running on a computer to determine an optimal assignment of subscribers to at least one rate plan.

摘要翻译： 在对一个或多个无线载波速率计划的用户分配中，选择多个无线语音和/或数据载波速率计划，并且确定多个预定时间间隔中的每一个的每个用户的历史无线时间使用。 对于用户和速率计划的每个组合，定义第一表达式，其包括唯一变量和与用于至少一个时间间隔的用户分配给速率计划相关联的成本。 确定集体确保订户分配到指定的最小或最大数量的速率计划或限制仅分配给一个费率计划的订户的限制。 表达式和约束由在计算机上运行的最优解求解器来处理，以确定订户对至少一个费率计划的最佳分配。

公开(公告)号：US08165921B1

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

申请号：US12368354

申请日：2009-02-10

申请人： Tuomas Sandholm ,  David L. Levine ,  Subhash Suri ,  Robert L. Shields ,  Christopher Cole ,  Richard James McKenzie, Jr. ,  David C. Parkes ,  Vincent Conitzer ,  Benjamin Schmaus

发明人： Tuomas Sandholm ,  David L. Levine ,  Subhash Suri ,  Robert L. Shields ,  Christopher Cole ,  Richard James McKenzie, Jr. ,  David C. Parkes ,  Vincent Conitzer ,  Benjamin Schmaus

IPC分类号： G06Q30/00

CPC分类号： G06Q30/08 ,  G06Q20/10 ,  G06Q30/0641 ,  G06Q40/00 ,  G06Q40/04

摘要： In a live, expressive combinatorial exchange, each of plural bidders can submit a bid. Based on the submitted bids, an allocation of the bids is determined that is optimal for the type of exchange being conducted. At least a portion of each bid of the allocation is displayed to each bidder of a first subset of the bidders that has at least one bid that is not included in the allocation. Each bidder of a subset of the first subset of bidders can then amend one or more of their existing bids or submit a new bid that is considered the next time the allocation is determined. The process of feeding back at least a portion of each bid of the allocation, submitting new bids or amendments to existing bids, and determining a new allocation based on all of the submitted bids continues until a predetermined condition is satisfied.

摘要翻译： 在一场实时，富有表现力的组合交流中，多个投标人可以提交投标。 根据提交的投标，确定对所进行的交易类型最优的投标分配。 每个出价的至少一部分显示给具有至少一个不包括在分配中的出价的投标人的第一子集的每个投标人。 投标人的第一个子集的一个子集的每个投标人可以修改其现有投标中的一个或多个，或者提交下一次确定分配时考虑的新投标。 反馈分配的每个出价的至少一部分，提交新的出价或对现有出价的修正以及基于所有提交的投标确定新的分配的过程继续进行，直到满足预定条件。

公开(公告)号：US07499880B2

公开(公告)日：2009-03-03

申请号：US10803549

申请日：2004-03-18

申请人： Tuomas Sandholm ,  Richard James McKenzie, Jr. ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Benjamin Schmaus ,  Christopher Cole

发明人： Tuomas Sandholm ,  Richard James McKenzie, Jr. ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Benjamin Schmaus ,  Christopher Cole

IPC分类号： G06Q30/00

CPC分类号： G06Q30/08 ,  G06Q20/10 ,  G06Q30/0641 ,  G06Q40/00 ,  G06Q40/04

摘要： In a live, expressive combinatorial exchange, each of a plurality of bidders can submit a bid. Based on the submitted bids, an allocation of the bids is determined that is optimal for the type of exchange being conducted. At least a portion of each bid of the allocation is displayed to each bidder of a first subset of the bidders that has at least one bid that is not included in the allocation. Each bidder of a subset of the first subset of bidders can then amend one or more of their existing bids or submit a new bid that is considered the next time the allocation is determined. The process of feeding back at least a portion of each bid of the allocation, submitting new bids or amendments to existing bids, and determining a new allocation based on all of the submitted bids continues until a predetermined condition is satisfied.

摘要翻译： 在实时，富有表现力的组合交流中，多个投标人可以提交投标。 根据提交的投标，确定对所进行的交易类型最优的投标分配。 每个出价的至少一部分显示给具有至少一个不包括在分配中的出价的投标人的第一子集的每个投标人。 投标人的第一个子集的一个子集的每个投标人可以修改其现有投标中的一个或多个，或者提交下一次确定分配时考虑的新投标。 反馈分配的每个出价的至少一部分，提交新的出价或对现有出价的修正以及基于所有提交的投标确定新的分配的过程继续进行，直到满足预定条件。

公开(公告)号：US08195524B2

公开(公告)日：2012-06-05

申请号：US12509715

申请日：2009-07-27

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

IPC分类号： G06Q30/00

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. At least one of the bids can include a reference ratio; a discount; a price associated with a quantity Q1 of a first item; a price associated with a quantity Q2 of a second item; and a rule that causes said discount to be applied to an average price of Q1 and an average price of Q2 for each instance of the allocated quantity Q1 over the allocated quantity Q2 that equals the reference ratio.

摘要翻译： 在组合交换中，可以输入规则来处理出价，并且可以定义期望的交换目标。 规则的一部分可用于确定是否存在对所进行的交换类型最优的出价分配。 如果期望的交换目标不满足，则可以每次都使用不同的规则子集来确定新的分配，直到满足期望的交换目标。 至少有一个出价可以包括参考比率; 折扣; 与第一项目的量Q1相关联的价格; 与第二项目的量Q2相关联的价格; 以及将所述折扣应用于Q1的平均价格和对于分配量Q1的每个实例的Q2的平均价格超过等于参考比率的分配量Q2的规则。

公开(公告)号：US20090276329A1

公开(公告)日：2009-11-05

申请号：US12504262

申请日：2009-07-16

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

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

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. Trigger bid groups and/or rules associated with trigger values can be used to determine whether to apply modification or discounts to bids. Item and bid groups can be partitioned into groups for the purpose of smoothing requirements. Trigger bid groups, rules associated with trigger values, item groups, and bid groups can be used for adjusting or constraining bids based on triggers, logical connectives, and adjustments.

摘要翻译： 在组合交换中，可以输入规则来处理出价，并且可以定义期望的交换目标。 规则的一部分可用于确定是否存在对所进行的交换类型最优的出价分配。 如果期望的交换目标不满足，则可以每次都使用不同的规则子集来确定新的分配，直到满足期望的交换目标。 可以使用与触发值相关联的触发器出价组和/或规则来确定是否对出价应用修改或折扣。 项目和投标组可以划分成组，以便平滑要求。 触发器出价组，与触发值相关联的规则，项目组和出价组可用于基于触发器，逻辑连接符和调整来调整或限制出价。

公开(公告)号：US08190490B2

公开(公告)日：2012-05-29

申请号：US12508129

申请日：2009-07-23

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

IPC分类号： G06Q30/00

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied. It can be determined if the exchange is overconstrained and, if so, rules can be relaxed. Also or alternatively, the demand for a quantity of an item can be increased or decreased based on the average cost of the item.

摘要翻译： 在组合交换中，可以输入一组规则来处理与交换相关的接收的投标。 可以从多个交换参与者中的每一个接收至少一个投标，并且可以定义期望的交换目标。 如果存在针对正在进行的交换类型最优的投标分配，则可以确定作为规则子集的函数。 如果期望的交换目标不满足，则每次重复利用不同的规则子集来确定分配的步骤，直到满足期望的交换目标。 可以确定交换是否过度约束，如果是这样，可以放宽规则。 另外或者替代地，可以基于物品的平均成本来增加或减少对物品数量的需求。

公开(公告)号：US08190489B2

公开(公告)日：2012-05-29

申请号：US12504262

申请日：2009-07-16

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

IPC分类号： G06Q30/00

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. Trigger bid groups and/or rules associated with trigger values can be used to determine whether to apply modification or discounts to bids. Item and bid groups can be partitioned into groups for the purpose of smoothing requirements. Trigger bid groups, rules associated with trigger values, item groups, and bid groups can be used for adjusting or constraining bids based on triggers, logical connectives, and adjustments.

摘要翻译： 在组合交换中，可以输入规则来处理出价，并且可以定义期望的交换目标。 规则的一部分可用于确定是否存在对所进行的交换类型最优的出价分配。 如果期望的交换目标不满足，则可以每次都使用不同的规则子集来确定新的分配，直到满足期望的交换目标。 可以使用与触发值相关联的触发器出价组和/或规则来确定是否对出价应用修改或折扣。 项目和投标组可以划分成组，以便平滑要求。 触发器出价组，与触发值相关联的规则，项目组和出价组可用于基于触发器，逻辑连接符和调整来调整或限制出价。

公开(公告)号：US07640189B2

公开(公告)日：2009-12-29

申请号：US10411879

申请日：2003-04-10

申请人： Tuomas Sandholm ,  Subhash Suri ,  David L. Levine ,  Andrew G. Gilpin

发明人： Tuomas Sandholm ,  Subhash Suri ,  David L. Levine ,  Andrew G. Gilpin

IPC分类号： G06F15/32

CPC分类号： G06Q30/08 ,  G06Q40/00 ,  G06Q40/04

摘要： In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.

摘要翻译： 在多单位组合拍卖，反向拍卖或交换中，可以接收多个出价，每个出价包括一个或多个项目，并且每个项目都包含其期望的数量。 每个出价还包括一个价格。 可以从收到的出价中形成许多独特的出价组合，并且可以确定代表拍卖设置，反向拍卖设置和/或交换设置方面的最佳价值的一种投标组合。 此后，形成此组合的投标可以宣告拍卖，反向拍卖或交换的中标。

公开(公告)号：US20090287560A1

公开(公告)日：2009-11-19

申请号：US12509715

申请日：2009-07-27

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

IPC分类号： G06Q30/00

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. At least one of the bids can include a reference ratio; a discount; a price associated with a quantity Q1 of a first item; a price associated with a quantity Q2 of a second item; and a rule that causes said discount to be applied to an average price of Q1 and an average price of Q2 for each instance of the allocated quantity Q1 over the allocated quantity Q2 that equals the reference ratio.

摘要翻译： 在组合交换中，可以输入规则来处理出价，并且可以定义期望的交换目标。 规则的一部分可用于确定是否存在对所进行的交换类型最优的出价分配。 如果期望的交换目标不满足，则可以每次都使用不同的规则子集来确定新的分配，直到满足期望的交换目标。 至少有一个出价可以包括参考比率; 折扣; 与第一项目的量Q1相关联的价格; 与第二项目的量Q2相关联的价格; 以及将所述折扣应用于Q1的平均价格和对于分配量Q1的每个实例的Q2的平均价格超过等于参考比率的分配量Q2的规则。

公开(公告)号：US20090281920A1

公开(公告)日：2009-11-12

申请号：US12508129

申请日：2009-07-23

申请人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

发明人： Tuomas Sandholm ,  David L. Levine ,  David C. Parkes ,  Subhash Suri ,  Vincent Conitzer ,  Robert L. Shields ,  Yuri Smirnov

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

CPC分类号： G06Q40/04 ,  G06Q30/0222 ,  G06Q30/0601 ,  G06Q30/08

摘要： In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied. It can be determined if the exchange is overconstrained and, if so, rules can be relaxed. Also or alternatively, the demand for a quantity of an item can be increased or decreased based on the average cost of the item.

摘要翻译： 在组合交换中，可以输入一组规则来处理与交换相关的接收的投标。 可以从多个交换参与者中的每一个接收至少一个投标，并且可以定义期望的交换目标。 如果存在针对正在进行的交换类型最优的投标分配，则可以确定作为规则子集的函数。 如果期望的交换目标不满足，则每次重复利用不同的规则子集来确定分配的步骤，直到满足期望的交换目标。 可以确定交换是否过度约束，如果是这样，可以放宽规则。 另外或者替代地，可以基于物品的平均成本来增加或减少对物品数量的需求。