Robert E Shields

US Patent:

7499880, Mar 3, 2009

Filed:

Mar 18, 2004

Appl. No.:

10/803549

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 26, 705 37

Abstract:

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.

US Patent:

7577589, Aug 18, 2009

Filed:

Nov 24, 2004

Appl. No.:

10/997765

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 26, 705 27, 705 37

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.

US Patent:

8165921, Apr 24, 2012

Filed:

Feb 10, 2009

Appl. No.:

12/368354

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
Subhash Suri - Santa Barbara CA, US
Robert L. Shields - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US
David C. Parkes - Cambridge MA, US
Vincent Conitzer - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 263, 705 35, 705 37, 705 39

Abstract:

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.

US Patent:

8190489, May 29, 2012

Filed:

Jul 16, 2009

Appl. No.:

12/504262

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 263, 705 37

Abstract:

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.

US Patent:

8190490, May 29, 2012

Filed:

Jul 23, 2009

Appl. No.:

12/508129

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 263, 705 37

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.

US Patent:

8195524, Jun 5, 2012

Filed:

Jul 27, 2009

Appl. No.:

12/509715

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06Q 30/00

US Classification:

705 263, 705 37

Abstract:

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 Q of a first item; a price associated with a quantity Q of a second item; and a rule that causes said discount to be applied to an average price of Q and an average price of Q for each instance of the allocated quantity Q over the allocated quantity Q that equals the reference ratio.

US Patent:

20030195835, Oct 16, 2003

Filed:

Sep 25, 2002

Appl. No.:

10/254241

Inventors:

Tuomas Sandholm - Pittsburgh PA, US
Subhash Suri - Santa Barbara CA, US
David Levine - Chesterfield MO, US
Andrew Gilpin - Pittsburgh PA, US
John Heitmann - Pittsburgh PA, US
Robert Shields - Huntington WV, US

Assignee:

CombineNet, Inc.

International Classification:

G06F017/60

US Classification:

705/037000

Abstract:

A method of processing an exchange includes providing a solver/analyzer for determining a solution that includes at least one of a winning allocation and feasible allocations. At least one bid is received at the solver/analyzer, with each bid including at least one item and an associated price. Exchange description data (EDD) is associated with the at least one bid. The EDD is also received at the solver/analyzer. The processing of the at least one bid is modified in accordance with the at least one feature included in the EDD.

US Patent:

20050192865, Sep 1, 2005

Filed:

Feb 24, 2005

Appl. No.:

11/065333

Inventors:

Craig Boutilier - Toronto, CA
Tuomas Sandholm - Pittsburgh PA, US
Robert Shields - Pittsburgh PA, US

Assignee:

CombineNet, Inc. - Pittsburgh PA

International Classification:

G06F017/60

US Classification:

705014000, 705037000

Abstract:

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.