Method for optimal winner determination in combinatorial auctions
View Patent ↗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.
1. A computer-implemented method of determining one or more winning bids in a multi-unit combinatorial auction, the method comprising the steps of:
(a) receiving in a computer storage data regarding a plurality of items and the total quantity of each item available for sale;
(b) receiving in the computer storage a plurality of bids, each bid including at least one of the items of step (a) and for each item a desired quantity thereof, each bid further including a price;
(c) a computer processor determining from plural combinations of the bids of step (b) which combination of the bids has an optimal sum of prices, wherein:
the quantity of each item of said combination that can be disposed of for free is less than or equal to the total quantity of said item available for sale; and
the quantity of each item of said combination that cannot be disposed of for free is equal to the total quantity available for sale; and
(d) accepting as winning bids, the bids forming said combination, wherein:
in a forward auction the optimal sum is a maximum sum; and
in a reverse auction the optimal sum is a minimum sum.
2. The method set forth in claim 1 , wherein step (d) includes accepting in part at least one bid forming the combination.
3. The method as set forth in claim 2 , wherein each bid accepted in part includes less than the bid quantity of at least one item and/or less than the bid price.
4. The method as set forth in claim 3 , wherein for each bid accepted in part, the quantity of each item and the price is reduced by the same percentage.
5. The method as set forth in claim 1 , further including the step of encoding in the computer storage two or more of the received bids to be mutually exclusive and/or mutually non-exclusive of each other.
6. The method set forth in claim 5 , wherein step (d) includes accepting in part at least one bid forming the combination.
7. The method as set forth in claim 5 , wherein the encoding is done by logical “OR” constraints between two or more bids that are to be mutually non-exclusive.
8. The method as set forth in claim 5 , wherein the encoding is done by logical “XOR” constraints between the two or more bids that are to be mutually exclusive.
9. The method as set forth in claim 5 , wherein the encoding is imposed by at least one of the following: a seller, a buyer or an auctioneer participating in the auction.
10. The method as set forth in claim 5 , further including the steps of:
combining the bids that are mutually exclusive; and
combining the bids that are mutually non-exclusive.
11. The method as set forth in claim 10 , wherein the step of combining mutually exclusive bids is done by “XOR” constraints and the step of combining mutually non-exclusive bids is done by “OR” constraints.
12. The method as set forth in claim 10 , wherein the steps of combining mutually exclusively and/or combining mutually non-exclusively are imposed by at least one of the following: a seller, a buyer or an auctioneer participating in the auction.
13. The method as set forth in claim 1 , further including the step of assigning in the computer storage a reserve price to at least one set of one or more of the input items and associated quantities for each of said items.
14. The method as set forth in claim 13 , further including the step of encoding in the computer storage two or more reserve priced sets to be mutually non-exclusive and/or mutually exclusive.
15. The method as set forth in claim 14 , wherein the encoding in the computer storage is done by a logical “OR” constraints between two or more bids that are to be mutually non-exclusive.
16. The method as set forth in claim 14 , wherein the encoding in the computer storage is done by logical “XOR” constraints between the two or more bids that are to be mutually exclusive.
17. The method as set forth in claim 14 , wherein the encoding in the computer storage is imposed by at least one of the following: a seller, a buyer or an auctioneer participating in the auction.
18. The method as set forth in claim 14 , further including the steps of:
combining the bids that are mutually exclusive; and
combining the bids that are mutually non-exclusive.
19. The method as set forth in claim 18 , wherein the step of combining mutually exclusive bids is done by “XOR” constraints and the step of combining mutually non-exclusive bids is done by “OR” constraints.
20. The method as set forth in claim 19 , wherein the steps of combining mutually exclusively and/or combining mutually non-exclusively are imposed by at least one of the following: a seller, a buyer or an auctioneer participating in the auction.
21. The method as set forth in claim 1 , further including the steps of:
the processor outputting data regarding the status of the auction; and
in response to said output of data, receiving new bids in the computer storage.
22. The method as set forth in claim 21 , wherein said data includes at least one of the following:
(i) one or more of the received bids or parts thereof;
(ii) one or more bids or parts thereof of the combination; and
(iii) a price quote for at least one set/bid including one or more of the input items and associated quantities of each items in the at least one set/bid.