Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Electronic shopping
Reexamination Certificate
2004-11-24
2009-08-18
Garg, Yogesh C (Department: 3625)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Electronic shopping
C705S027200, C705S037000
Reexamination Certificate
active
07577589
ABSTRACT:
In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied.
REFERENCES:
patent: 5905975 (1999-05-01), Ausubel
patent: 6021398 (2000-02-01), Ausubel
patent: 6026383 (2000-02-01), Ausubel
patent: 6055519 (2000-04-01), Kennedy et al.
patent: 6064981 (2000-05-01), Barni et al.
patent: 6272473 (2001-08-01), Sandholm
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
patent: 7043446 (2006-05-01), Dietrich et al.
patent: 2002/0046037 (2002-04-01), Ausubel et al.
patent: 2002/0046157 (2002-04-01), Solomon
patent: 2002/0052828 (2002-05-01), Ausubel
patent: 2003/0018560 (2003-01-01), Dietrich
patent: 2005/0102215 (2005-05-01), Ausubel et al.
patent: 2007/0055606 (2007-03-01), Ausubel et al.
patent: WO 01/031537 (2001-05-01), None
patent: WO 01/033400 (2001-05-01), None
patent: WO 01/033401 (2001-05-01), None
Tuomas Sandholm, “Agents In Electronic Commerce: Component Technologies For Automated Negotiation And Coalition Formation”, 26 pages, Mar. 31, 1999, revised Aug. 12, 1999.
Katia Sycara, “Utility Theory In Conflict Resolution”; Annals of Operations Research 12 (1988) pp. 65-84.
Michael Rothkopf, Alexander Peke{hacek over (c)} and Ronald Harstad, “Computationally Manageable Combinatorial Auctions”, Rutcor Research Report, pp. 1131-1147, Apr. 1995.
Yuzo Fujishima, Kevin Leyton-Brown and Yoav Shoham, “Taming the Computational Complexity of Combinatorial Auctions: Optimal And Approximate Approaches”, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), 6 pages, (1999).
Tuomas Sandholm, “An Algorithm For Optimal Winner Determination in Combinatorial Auctions”, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), 6 pages, (1999).
Holger Hoos and Craig Boutilier, “Solving Combinatorial Auctions Using Stochastic Local Search”, Proceedings of the National Conference on Artificial Intelligence (AAAI), 8 pages, Aug. 2000.
Noam Nissan, “Bidding And Allocation In Combinatorial Auctions”, Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), 25 pages, (2000).
Tuomas Sandholm, “eMediator: A Next Generation Electronic Commerce Server”, Washington University, St. Louis, Department of Computer Science Technical Report, WU-CS-99-02, pp. 341-348, Jan. 1999.
Moshe Tennenholtz, “Some Tractable Combinatorial Auctions”, Proceedings of the National Conference on Artificial Intelligence (AAAI), 6 pages, Aug. 2000.
Tuomas Sandholm and Subhash Suri, “Improved Algorithms For Optimal Winner Determination In Combinatorial Auctions And Generalizations”, Proceedings of the National Conference on Artificial Intelligence (AAAI), 8 pages, (2000).
David C. Parkes; “iBundle: An Efficient Ascending Price Bundle Auction”; In Proc. ACM Conference On Electronic Commerce (EC-99), Denver, Nov. 1999; 10 pages.
David C. Parkes and Lyle H. Ungar; “An Ascending-Price Generalized Vickrey Auction”; Stanford Institute For Theoretical Economics (SITE) 2002 Summer Workshop: The Economics Of The Internet, Jun. 25-29, 2002; 56 pages.
David C. Parkes and Lyle H. Ungar; “Iterative Combinatorial Auctions: Theory And Practice”; In Proc. 7thNational Conference On Artificial Intelligence (AAAI-00), 8 pages.
David C. Parkes and Lyle H. Ungar; “Preventing Strategic Manipulation In Iterative Auctions: Proxy Agents And Price-Adjustment”; In Proc. 17thNational Conference on Artificial Intelligence (AAAI-0); 2000; 8 pages.
Charles R. Plott; “Laboratory Experimental Testbeds: Application To The PCS Auction”; Massachusetts Institute of Technology; Journal of Economics & Management Strategy, vol. 6, No. 3, Fall 1997, pp. 605-638.
Lawrence M. Ausubel and Paul R. Milgrom; “Ascending Auctions With Package Bidding”; Frontiers Of Theoretical Economics'; vol. 1; Issue 1; Article 1; 2002; 44 pages.
Andrew J. Davenport and Jayant R. Kalagnanam; “Price Negotiations For Procurement Of Direct Inputs”; IBM Technical Report RC 22078; May 31, 2001; 21 pages.
Christine Demartini, Anthony M. Kwasnica, John O. Ledyard and David Porter; “A New And Improved Design For Multi-Object Iterative Auctions”; Mar. 15, 1999; 45 pages.
Marta Eso, Soumyadip Ghosh, Jayant R. Kalagnanam and Laszlo Ladanyi; “Bid Evaluation In Procurement Auctions With Piece-Wise Linear Supply Curves”; IBM Research Report RC22219 (WO110-087); Oct. 31, 2001; 36 pages.
Frank Kelly and Richard Steinberg; “A Combinatorial Auction With Multiple Winners For Universal Service”; Management Science; vol. 46, No. 4; Apr. 2000, pp. 586-596.
John O. Ledyard, David Porter and Antonio Rangel; “Experiments Testing MultiObject Allocation Mechanisms”; Massachusetts Institute of Technology; Journal of Economics & Management Strategy; vol. 6, No. 3; Fall 1997; pp. 639-675.
Tuomas Sandholm, Subhash Suri, Andrew Gilpin and David Levine; “Winner Determination In Combinatorial Auction Generalizations”; AAMAS'02, Jul. 15-19, 2002; 8 pages.
Lawrence M. Ausubel; “An Efficient Ascending-Bid Auction For Multiple Objects”; University of Maryland, Department of Economics; Aug. 7, 2002; 26 pages.
Sushil Bikhchandani and Joseph M. Ostroy; “Ascending Price Vickrey Auctions”; University of California, Los Angeles; Anderson School Of Management and Dept. Of Economics; Aug. 29, 2002; 34 pages.
Frank Gul and Ennio Stacchetti; “The English Auction With Differentiated Commodities”; Jul. 22, 1999; 25 pages.
Gabrielle Demange, David Gale and Marilda Sotomayor; “Multi-Item Auctions”; Journal of Political Economy; vol. 94, No. 4; 1986; pp. 863-872.
Peter R. Wurman and Michael P. Wellman; “AkBA: A Progressive, Anonymous-Price Combinatorial Auction”; EC'00, Oct. 17-20, 2000, 9 pages.
Conitzer Vincent
Levine David L.
Parkes David C.
Sandholm Tuomas
Shields Robert L.
CombineNet, Inc.
Garg Yogesh C
The Webb Law Firm
LandOfFree
Method and apparatus for conducting a dynamic exchange 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 conducting a dynamic exchange, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for conducting a dynamic exchange will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4123772