Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2002-09-25
2009-10-27
Poinvil, Frantzy (Department: 3696)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
C705S038000, C705S03600T, C705S035000
Reexamination Certificate
active
07610236
ABSTRACT:
A method of processing an exchange includes providing a solver/analyzer for determining a solution that includes at least one of a winning allocation and feasible allocations. At least one bid is received at the solver/analyzer, with each bid including at least one item and an associated price. Exchange description data (EDD) is associated with the at least one bid. The EDD is also received at the solver/analyzer. The processing of the at least one bid is modified in accordance with the at least one feature included in the EDD.
REFERENCES:
patent: 5905975 (1999-05-01), Ausubel
patent: 6021398 (2000-02-01), Ausubel
patent: 6026383 (2000-02-01), Ausubel
patent: 6035287 (2000-03-01), Stallaert et al.
patent: 6272473 (2001-08-01), Sandholm
patent: 6415270 (2002-07-01), Rackson et al.
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
patent: 7043446 (2006-05-01), Dietrich et al.
patent: 7058602 (2006-06-01), La Mura et al.
patent: 7133841 (2006-11-01), Wurman et al.
patent: 2001/0042041 (2001-11-01), Moshal et al.
patent: 2002/0046037 (2002-04-01), Ausubel et al.
patent: 2002/0052828 (2002-05-01), Ausubel
patent: 2003/0004850 (2003-01-01), Li et al.
patent: 2001-290968 (2001-10-01), None
patent: 2001-344457 (2001-12-01), None
patent: 2002-099777 (2002-04-01), None
patent: WO 01/031537 (2001-05-01), None
patent: WO 01/33400 (2001-05-01), None
patent: WO 01/033401 (2001-05-01), None
Tuomas W. Sandholm, “eMediator: A Next Generation Electronic Commerce Server,” Jan. 1999, Washington University, St. Louis, Department of Science Technical Report, WU-CS-99-02.
Tuomas W. Sandholm and Subhash Suri, “Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations,” 2000, Proceedings of the National Conference on Artificial Intelligence.
Tuomas Sanholm, “An Algorithm for Optimal Winner Determination in Combinatorial Auctions,” Jan. 28 1999, Washington University, WU-CS-99-01.
Commerce Quest Announces the EnableNet Private Exchange Server PR Newswire New York: Apr. 10, 2002 p. 1.
Holger Hoos and Craig Boutilier, “Solving Combinatorial Auctions using Stochastic Local Search”, Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 8, Aug. 2000.
Noarn Nissan, “Bidding And Allocation In Combinatorial Auctions”, Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 25, (2000).
Tuomas W. 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), pp. 6, Aug. 2000.
Tuomas W. Sandholm and Subhash Suri, “Improved Algorithms For Optimal Winner Determination In Combinatorial Auctions And Generalizations”, Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 8, (2000).
Katia Sycara, “Utility Theory In Conflict Resolution”, Annals of Operations Research 12(1988) 65-84.
David C. Parkes; “/Bundle: 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-Jun. 29, 2002; pp. 1-56.
David C. Parkes and Lyle H. Ungar; “Iterative Combinatorial Auctions: Theory and Practice”; In Proc. 7th National Conference on Artificial Intelligence (AAAI-00), 8 pp.
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 MutliObject 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 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.
Michael Rothkopf, Alexander Peke{hacek over (c)} and Ronald Harstad, “Computationally Manageable Combinatorial Auctions”, Rutcor Research Report, pp. 21, 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), pp. 6, (1999).
Tuomas Sandholm, “An Algorithm For Optimal Winner Determination in Combinatorial Auctions”, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 6, (1999).
Jayant R. Kalagnanam et al.: “Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand”, IBM Research Report RC21660 (97613), Feb. 2, 2000, pp. 1-15.
Andrew J. Davenport et al.: “Price negotiations for procurement of direct inputs”, IBM Technical Report RC22078, May 31, 2001, pp. 1-21.
Jayant Kalagnanam et al.: “Minimizing Procurement Costs for Strategic Sourcing”, IBM White Paper, 2001, IBM T.J. Watson Research Center.
Marta Eso et al.: “Bid Evaluation in Procurement Auctions with Piece-Wise Linear Supply Curves”, IBM Research Report RC22219 (W0110-087), Oct. 31, 2001, pp. 1-35.
Joni Lynne Jones: “Incompletely Specified Combinatorial Auction: An Alternative Allocation Mechanism For Business-To-Business Negotiations”, Doctoral Thesis Presented to the Graduate School of the University of Florida, 2000, UMI No. 9984436, Bell & Howell Information and Learning Company, Ann Arbor, Michigan.
Joni L. Jones et al.: “Incomp
Gilpin Andrew G.
Heitmann John
Levine David L.
Sandholm Tuomas
Shields, Jr. Robert Lawrence
CombineNet, Inc.
Graham Clement
Poinvil Frantzy
The Webb Law Firm
LandOfFree
Method and apparatus for forming expressive 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 and apparatus for forming expressive combinatorial..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for forming expressive combinatorial... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4105272