Bidding language for combinatorial auctions and method of use thereof
View Patent ↗In a computer-implemented method for finding a high quality allocation of one or more bids in a combinatorial auction, a number of bids is electronically received. Each bid includes a number of sub bids and a Boolean operator logically connecting each pair of sub bids. Each sub bid is either (1) a good and an associated price or (2) one of the Boolean operators associated with a price and at least two other sub bids. From a number of allocations of goods to sub bids, wherein each allocation of the goods is to a different set of sub bids, an allocation is output that has the greatest value. The value of each allocation includes of a sum of prices of bids that have at least one satisfied sub bid. The price of each bid includes a sum of the prices associated with each satisfied sub bid of the bid.
1. A computer-implemented combinatorial auction method comprising:
(a) electronically receiving a plurality of bids, with each bid having a plurality of sub bids and one of the Boolean operators AND, OR or XOR logically connecting each pair of sub bids, wherein each sub bid is comprised of one of the following: (1) one good and a price associated with the good, or (2) one of the Boolean operators logically connecting at least two other sub bids and a price associated with the one Boolean operator;
(b) determining plural allocations of goods, wherein each allocation of the goods is to a different set of sub bids;
(c) electronically identifying for each allocation of the goods each bid or sub bid as being satisfied or unsatisfied, wherein:
a bid or sub bid having one good is satisfied when the one good is allocated thereto;
a bid or sub bid comprised of a plurality of other sub bids logically connected with the Boolean operator AND is satisfied when all of the other sub bids are satisfied; and
a bid or sub bid comprised of a plurality of other sub bids logically connected by the Boolean operator OR or XOR is satisfied when at least one of the other sub bids is satisfied;
(d) computing for each allocation a value comprised of a sum of the prices of bids that have at least one satisfied sub bid, wherein the price of each bid includes a sum of the prices associated with each satisfied sub bid of the bid; and
(e) outputting the allocation having the greatest value.
2. The method of claim 1 , wherein the price of each bid is:
the sum of the prices associated with each satisfied sub bid of the bid when a Boolean solution of the bid is false; or
the sum of the prices associated with each satisfied sub bid of the bid and a price associated with the bid itself when a Boolean solution of the bid is true.
3. The method of claim 1 , wherein each allocation in step (b) is determined stochastically or heuristically.
4. The method of claim 1 , wherein, for each sub bid, the price associated with the good or the Boolean operator is either an explicit price that is included with the sub bid, or the price is assigned a value of zero when the sub bid does not include an explicit price.
5. A computer-readable storage medium having stored thereon instructions which, when executed by a processor, cause the processor to perform the steps of:
(a) receive a plurality of bids, with each bid having a plurality of sub bids and one of the Boolean operators AND, OR or XOR logically connecting each pair of sub bids, wherein each sub bid is comprised of one of the following: (1) one good and a price associated with the good or (2) one of the Boolean operators logically connecting at least two other sub bids and a price associated with the one Boolean operator;
(b) determine plural allocations of goods, wherein each allocation of the goods is to a different set of sub bids;
(c) identify for each allocation of the goods each bid or sub bid as being satisfied or unsatisfied, wherein: a bid or sub bid having one good is satisfied when the one good is allocated thereto; a bid or sub bid comprised of a plurality of other sub bids logically connected with the Boolean operator AND is satisfied when all of the other sub bids are satisfied; and a bid or sub bid comprised of a plurality of other sub bids logically connected by the Boolean operator OR or XOR is satisfied when at least one of the other sub bids is satisfied;
(d) compute for each allocation a value comprised of a sum of the prices of bids that have at least one satisfied sub bid, wherein the price of each bid includes a sum of the prices associated with each satisfied sub bid of the bid; and
(e) output the allocation having the greatest value.
6. The computer-readable storage medium of claim 5 , wherein the price of each bid is: a sum of the prices associated with each satisfied sub bid of the bid when a Boolean solution of the bid is false; or a sum of the prices associated with each satisfied sub bid of the bid and a price associated with the bid itself when a Boolean solution of the bid is true.
7. The computer-readable storage medium of claim 5 , wherein each allocation in step (b) is determined stochastically or heuristically.
8. The computer-readable storage medium of claim 5 , wherein, for each sub bid, the price associated with the good or the Boolean operator is either an explicit price that is included with the sub bid, or the price is assigned a value of zero when the sub bid does not include an explicit price.