Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2007-12-04
2007-12-04
Weisberger, Rich (Department: 3624)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
C705S026640, C705S027200
Reexamination Certificate
active
09789480
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: 6012045 (2000-01-01), Barzilai et al.
patent: 6101485 (2000-08-01), Fortenberry et al.
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
Rothkopth et al., Computationall Manageable Combinational Auctions, Management Science, Aug. 1998.
Yuzo Fujishima, Kevin Leyton-Brown and Yoav Shoham, “Taming the Computational Complexity of Combinatorial Auctions: Optimal And Approximate Approaches”, Computer Science Department, Stanford University, 6 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) 402-417 pp., (1982).
Michael H. Rothkopf, Aleksandar Pekec and Ronald M. Harstad, “Computationally Manageable Combinatorial Auctions”, Rutcor Research Report RRR 13-95, 19 pp., (Apr. 1995).
Tuomas W. Sandholm, “An Implementation Of The Contact Net Protocol Based On Marginal Cost Calculations”, Computer Science Department, University of Massachusetts, 7 pp., (1993).
Tuomas W. Sandholm, “An Algorithm For Optimal Winner Determination In Combinatorial Auctions”, Department of Computer Science, Washington University, 6 pp., (1999).
Tuomas W. Sandholm, “eMediator: A Next Generation Electronic Commerce Server”, Department of Computer Science, Washington University, 341-348 pp., (2000).
Moshe Tennenholtz, “Some Tractable Combinatorial Auctions”, American Association for Artificial Intelligence, 6 pp., (2000).
Daniel Lehmann, Liadan Ita O'Callaghan and Yoav Shoham, “Truth Revelation In Rapid, Approximately Efficient Combinatorial Auctions”, Robotics Lab., Computer Science Dept., Stanford University, 1-17 pp., (1999).
Tuomas Sandholm and Subhash Suri “Improved Algorithms For Optimal Winner Determination In Combinatorial Auctions And Generalizations”, American Association for Artificial Intelligence, 8 pp., (2000).
Norbert Korte and Rolf H. Mohring, “An Incremental Linear-Time Algorithm For Recognizing Interval Graphs”, SIAM Journal On Computing vol. 18, No. 1, 68-81 pp., (1989).
Sandholm Tuomas
Suri Subhash
CombineNet, Inc.
The Webb Law Firm
Weisberger Rich
LandOfFree
Method for optimal winner determination in combinatorial... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for optimal winner determination in combinatorial..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for optimal winner determination in combinatorial... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3834106