Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2003-07-11
2009-02-03
Kazimi, Hani M. (Department: 3691)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
Reexamination Certificate
active
07487124
ABSTRACT:
A method for enabling optimizing software to determine an optimal allocation in a combinatorial auction includes (a) receiving a plurality of bids each of which includes a plurality of sub bids, wherein each sub bid is comprised of one of (1) one good and an associated price and (2) a logical operator logically connecting at least two child sub bids and a price associated with the logical operator; (b) defining an objective for the plurality of bids; (c) defining for each bid a plurality of mathematical relationships without logical operators that collectively represent the bid; and (d) causing the optimizing software to process the received bids to achieve the objective subject to the mathematical relationships. The method can be embodied in instructions stored on a computer-readable medium. When executed by a processor, the instructions can cause the processor to perform the method.
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
Nisan, Noam: “Bidding and allocation in Combinatorial Auctions”, ACM conference on Electronic Commerce, Apr. 17, 2000, pp. 25.
Arne Andersson, Mattias Tenhunen and Fredrik Ygge, “Integer Programming For Combinatorial Auction Winner Determination”, 8 pp., (2000).
Yuzo Fujishima, Kevin Leyton-Brown and Yoav Shoham, “Taming the Computational Complexity of Combinatorial Auctions: Optimal And Approximate Approaches”, 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).
Noam Nisan, “Bidding And Allocation In Combinatorial Auctions”, Institute of Computer Science, Hebrew U., Jerusalem, 25 pp., (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(2), pp. 402-417, (1982).
Michael H. Rothkopf, Aleksander Pekec and Ronald M. Harstad, “Computationally Manageable Combinatorial Auctions”, Management Science, vol. 44, No. 8, pp. 1131-1147, (Aug. 1998).
Tuomas W. Sandholm, “An Algorithm For Optimal Winner Determination In Combinatorial Auctions”, 6 pp., (1999).
Tuomas W. Sandholm, “eMediator: A New Generation Electronic Commerce Server”, InProceedings Of The Fourth International Conference On Autonomous Agents, pp. 341-348, (2000).
Michael P. Wellman, William E. Walsh, Peter R. Wurman and Jeffrey K. Mackie-Mason, “Auction Protocols For Decentralized Scheduling”, Games and Economic Behavior, 35, pp. 271-303 (2001).
Tuomas Sandholm, Subhash Suri, Andrew Gilpin and David Levine, “CABOB: A Fast Optimal Algorithm For Combinatorial Auctions”, 7 pp., (2001).
Craig Boutilier and Holger H. Hoos, “Bidding Languages For Combinatorial Auctions”, 7 pp., (2001).
Noa E. Kfir-Dahav, Dov Monderer and Moshe Tennenholtz, “Mechanism Design For Resource Bounded Agents”, Faculty of Industrial Engineering And Management Technion-Israel Institute of Technology, Haifa 32000, Israel, 15 pp., (Jan. 19, 1999).
Noam Nisan and Amir Ronen, “Computationally Feasible VCG Mechanisms”, 29 pp., (2000).
Dale Schuurmans, Finnegan Southey and Robert C. Holte, “The Exponentiated Subgradient Algorithm For Heuristic Boolean Programming”, 6 pp., (2001).
Akintola Olabode
CombineNet, Inc.
Kazimi Hani M.
The Webb Law Firm
LandOfFree
Method and apparatus for solving concisely expressed... 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 and apparatus for solving concisely expressed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for solving concisely expressed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4125134