Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2008-10-31
2010-11-30
Akintola, Olabode (Department: 3691)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
Reexamination Certificate
active
07844540
ABSTRACT:
In a method of determining an optimal allocation in a combinatorial auction, a plurality of bids is received. Each bid includes a plurality of sub bids. Each sub bid includes either one good and a price associated with the good or a logical operator logically connecting at least two child sub bids and a price associated with the logical operator. For each sub bid, the price associated with the good or the logical operator is either an explicit price that is included with the sub bid or is assigned a value of zero when the sub bid does not include an explicit price. An objective is defined for the plurality of bids. For each bid, a plurality of mathematical relationships collectively representing the bid without logical operators is defined. The received bids are processed to achieve the objective subject to the mathematical relationships.
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.
Andersson et al., “Integer Programming For Combinatorial Auction Winner Determination”, 8 pp., (2000).
Fujishima et al., “Taming the Computational Complexity of Combinatorial Auctions: Optimal And Approximate Approaches”, 6 pp., (1999).
Hoos et al., “Solving Combinatorial Auctions Using Stochastic Local Search”, American Association for Artificial Intelligence, 8 pp., (2000).
Leyton-Brown et al., “Towards A Universal Test Suite For Combinatorial Auction Algorithms”, Electronic Commerce (EC'00), 11 pp., (2000).
Nisan, “Bidding And Allocation in Combinatorial Auctions”, Institute of Computer Science, Hebrew U., Jerusalem, 25 pp., (Apr. 17, 2000).
Rassenti et al., “A Combinatorial Auction Mechanism For Airport Time Slot Allocation”, The Bell Journal of Economics, 13(2), pp. 402-417, (1982).
Rothkopf et al., “Computationally Manageable Combinatorial Auctions”, Management Science, vol. 44, No. 8, pp. 1131-1147, (Aug. 1998).
Sandholm, “An Algorithm For Optimal Winner Determination In Combinatorial Auctions”, 6 pp., (1999).
Sandholm, “eMediator: A Next Generation Electronic Commerce Server”, In Proceedings Of The Fourth International Conference on Autonomous Agents, pp. 341-348, (2000).
Wellman et al., “Auction Protocols For Decentralized Scheduling”, Games and Economic Behavior, 35, pp. 271-303 (2001).
Sandholm et al., “Cabob: A Fast Optimal Algorithm For Combinatorial Auctions”, 7 pp., (2001).
Boutilier et al., “Bidding Languages For Combinatorial Auctions”, 7 pp., (2001).
Kfir-Dahav et al., “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).
Nisan et al., “Computationally Feasible VCG Mechanisms”, 29 pp., (2000).
Schuurmans et al., “The Exponentiated Subgradient Algorithm For Heuristic Boolean Programming”, 6 pp., (2001).
Hoos, “Stochastic Local Search-Methods, Models, Applications”, infix-Verlag, Sankl, pp. 21, (1999).
Akintola Olabode
CombineNet, Inc.
The Webb Law Firm
LandOfFree
Concisely expressed combinatorial auction problem solving... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Concisely expressed combinatorial auction problem solving..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concisely expressed combinatorial auction problem solving... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4167550