Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2008-12-15
2010-11-16
Akintola, Olabode (Department: 3691)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
Reexamination Certificate
active
07835980
ABSTRACT:
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.
REFERENCES:
patent: 6035287 (2000-03-01), Stallaert et al.
patent: 6272473 (2001-08-01), Sandholm
patent: 6321207 (2001-11-01), Ye
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
patent: 2003/0225677 (2003-12-01), Sandholm et al.
patent: 410224301 (1998-08-01), None
patent: 410224301 (1998-08-01), None
Nisan, Noam: “Bidding and allocation in Combinatorial Auctions”, ACM conference on Electronic Commerce, Apr. 17, 2000, pp. 25.
Yuzo Fujishima, Kevin Leyton-Brown and Yoav Shoham, “Taming the Computational Complexity of Combinatorial Auctions”, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 6, 1999.
Holger H. Hoos and Craig Boutilier, “Solving Combinatorial Auctions Using Stochastic Local Search”, Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 8, 2000.
Holger H. Hoos, “Stochastic Local Search-Methods, Models, Applications”, pp. 21, infix-Verlag, Sankt, 1999.
Tuomas Sandholm, “An Algorithm for Optimal Winner Determination in Combinatorial Auctions”, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 6, 1999.
Tuomas Sandholm, “eMediator: A Next Generation Electronic Commerce Server”, Proceedings of the Fourth International Conference on Autonomous Agents, pp. 341-348, 2000.
Noam Nisan, “Bidding and Allocation in Combinatorial Auctions”, ACM Conference on Electronic Commerce, pp. 25, Apr. 17, 2000.
S.J. Rassenti, V.L. Smith and R.L. Bulfin, “A Combinatorial Auction Mechanism for Airport Time Slot Allocation”, The Bell Journal of Economics, 13: 402-417, 1982.
Michael H. Rothkopf, Aleksandar Peke{hacek over (c)} and Ronald M. Harstad, “Computationally Manageable Combinatorial Auction.”, DIMACS Technical Report 95-09, pp. 17, Apr. 1995.
Boutilier Craig E.
Hoos Holger H.
Akintola Olabode
CombineNet, Inc.
The Webb Law Firm
LandOfFree
Bidding language for combinatorial auctions and method of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bidding language for combinatorial auctions and method of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bidding language for combinatorial auctions and method of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4170960