Invention Grant
- Patent Title: Overconstraint detection, rule relaxation and demand reduction in a combinatorial exchange
- Patent Title (中): 组合交换中的过约束检测,规则放宽和需求减少
-
Application No.: US12508129Application Date: 2009-07-23
-
Publication No.: US08190490B2Publication Date: 2012-05-29
- Inventor: Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
- Applicant: Tuomas Sandholm , David L. Levine , David C. Parkes , Subhash Suri , Vincent Conitzer , Robert L. Shields , Yuri Smirnov
- Applicant Address: US PA Pittsburgh
- Assignee: CombineNet, Inc.
- Current Assignee: CombineNet, Inc.
- Current Assignee Address: US PA Pittsburgh
- Agency: The Webb Law Firm
- Main IPC: G06Q30/00
- IPC: G06Q30/00

Abstract:
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.
Public/Granted literature
- US20090281920A1 Overconstraint Detection, Rule Relaxation and Demand Reduction in a Combinatorial Exchange Public/Granted day:2009-11-12
Information query