Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Electronic shopping
Reexamination Certificate
2003-04-10
2009-12-29
Weisberger, Richard (Department: 3693)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Electronic shopping
C705S035000, C705S037000
Reexamination Certificate
active
07640189
ABSTRACT:
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.
REFERENCES:
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
Sandholm, An Algorithm for Optimal Winner Determination in Combinatorial Auctions, published Jan. 28, 1999.
Michael H. Rothkopf, Aleksandar Pekeċ and Ronald M. Harstad, “Computationally Manageable Combinatorial Auctions”, Management Science, 44(8), 21 pp. (1998).
Curt Powley and Richard E. Korf, “Single-Agent Parallel Window Search”, IEEE Transactions On Pattern Analysis And Machine Intelligence, vol. 13, No. 5, pp. 466-477, (May 1991).
Yuzo Fujishima, Kevin Leyton-Brown and Yoav Shoham, “Taming the Computational Complexity of Combinatorial Auctions: Optimal And Approximate Approaches”, In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), 6 pp., (1999).
Holger H. Hoos and Craig Boutilier, “Solving Combinatorial Auctions Using Stochastic Local Search”, American Association for Artificial Intelligence, 8 pp., (2000).
Kevin Leyton-Brown, Mark Pearson and Yoav Shoham, “Towards A Universal Test Suite For Combinatorial Auction Algorithms”, Electronic Commerce (EC'00), 11 pp., (2000).
Tuomas Sandholm and Subhash Suri “Improved Algorithms For Optimal Winner Determination In Combinatorial Auctions And Generalizations”, In the Proceedings of the National Conference on Artificial Intelligence (AAAI), 8 pp., (2000).
Tuomas W. Sandholm, “An Algorithm For Optimal Winner Determination In Combinatorial Auctions”, In the Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), 6 pp., (1999).
Alexander Reinefeld and T. Anthony Marsland, “Enhanced Iterative-Deepening Search”, IEEE Transactions On Pattern Analysis And Machine Intelligence, vol. 16, No. 7, pp. 701-710, (Jul. 1994).
Daniel Lehmann, Liadan Ita O'Callaghan and Yoav Shoham, “Truth Revelation In Rapid, Approximately Efficient Combinatorial Auctions”, In the Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), 17 pp., (1999).
Noam Nisan, “Bidding And Allocation In Combinatorial Auctions”, Institute of Computer Science, Hebrew U., Jerusalem, 25 pp., (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(2): pp. 402-417, (1982).
Tuomas W. Sandholm, “An Implementation Of The Contact Net Protocol Based On Marginal Cost Calculations”, In the Proceedings of the National Conference on Artificial Intelligence (AAAI), 7 pp., (1993).
Tuomas W. Sandholm, “eMediator: A Next Generation Electronic Commerce Server”, In AAAI-99 Workshop on AI in Electronic Commerce, pp. 341-348, (1996).
Moshe Tennenholtz, “Some Tractable Combinatorial Auctions”, American Association for Artificial Intelligence, 6 pp., (2000).
Carla P. Gomes, Bart Selman and Henry Kautz, “Boosting Combinatorial Search Through Randomization”, American Association For Artificial Intelligence, In Proc. AAAI98, 7 pp., (1998).
Michael Luby, Alistair Sinclair and David Zuckerman, “Optimal Speedup Of Las Vegas Algorithms”, Information Processing Letters, 47, 13 pp., (1993).
Arne Andersson, Mattias Tenhunen and Fredrik Ygge, “Integer Programming For Combinatorial Auction Winner Determination”, In the Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS), 8 pp., (2000).
N. Korte and R.H. Mohring, “An Incremental Linear-Time Algorithm For Recognizing Interval Graphs”, SIAM Journal On Computing 18(1): pp. 68-81, (1989).
Gilpin Andrew G.
Levine David L.
Sandholm Tuomas
Suri Subhash
CombineNet, Inc.
The Webb Law Firm
Weisberger Richard
LandOfFree
Combinatorial auction branch on bid searching method and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Combinatorial auction branch on bid searching method and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial auction branch on bid searching method and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4135765