Abstract: A method of exchange winner determination includes determining an exchange specification having at least one item. A bid is received from each of a number of bidders, with at least one bid placed on a quantity of the one item. The bids are processed to determine a first allocation that includes an award of the quantity of the one item to a first bid. An allocation modifier is specified. The bids are processed as a function of the allocation modifier to determine a second allocation that includes an award of the quantity of the one item to a second bid. The first or second allocation is designated as the winning allocation as a function of the award of the quantity of the one item in the second bid.

Abstract: A method of determining a winning allocation in an exchange includes receiving a plurality of bids, with each bid placed on a quantity of at least one item. At least one allocation modifier is received and an objective is defined as a function of each bid and the allocation modifier. At least one limitation is defined on how the allocation modifier can be changed. From the objective subject to the at least one limitation, a determination is made on how the allocation modifier changes. In response to how the allocation modifier changes, outputting data from which a bidder of a bid associated with the allocation modifier can be identified.

Abstract: A method for enabling optimizing software to determine an optimal allocation in a combinatorial auction includes (a) receiving a plurality of bids each of which includes a plurality of sub bids, wherein each sub bid is comprised of one of (1) one good and an associated price and (2) a logical operator logically connecting at least two child sub bids and a price associated with the logical operator; (b) defining an objective for the plurality of bids; (c) defining for each bid a plurality of mathematical relationships without logical operators that collectively represent the bid; and (d) causing the optimizing software to process the received bids to achieve the objective subject to the mathematical relationships. The method can be embodied in instructions stored on a computer-readable medium. When executed by a processor, the instructions can cause the processor to perform the method.

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.

Abstract: In a combinatorial auction, a plurality of bids is received each having a plurality of sub bids and Boolean operators logically connecting each pair of sub bids. A current allocation is determined by allocating goods to at least one of the bids and a best allocation is initialized with the current allocation. A neighboring allocation is constructed by reallocating within the current allocation at least one good from at least one bid to another bid. The best allocation is updated with the neighboring allocation when the value of the neighboring allocation is greater than the current value of the best allocation.