Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2002-03-08
2008-10-07
Patel, Jagdish N (Department: 3693)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
C705S026640, C705S080000
Reexamination Certificate
active
07433841
ABSTRACT:
A method of participating by a purchaser in a plurality of negotiations for purchasable items, where an item may be a good or a service, in order to obtain one of a plurality of alternative collections of complementary purchasable items, comprising maintaining a probabilistic model of said negotiations and making bids or offers to increase the probability of success in negotiations for purchasable items in one of said alternative collections determined from current states of said negotiations and said probabilistic model as providing a largest expectation of value to the purchaser.
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: 6564192 (2003-05-01), Kinney et al.
patent: 6704716 (2004-03-01), Force
patent: 6718312 (2004-04-01), McAfee et al.
patent: 6892186 (2005-05-01), Preist
patent: 6976005 (2005-12-01), Bansal et al.
patent: 7039609 (2006-05-01), Aoki
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: 7305363 (2007-12-01), Sandholm et al.
patent: 7346571 (2008-03-01), Fujita
patent: 2001/0027431 (2001-10-01), Rupp et al.
patent: 2002/0046037 (2002-04-01), Ausubel et al.
patent: 2002/0069134 (2002-06-01), Solomon
patent: 2002/0116315 (2002-08-01), Grey et al.
patent: 2007/0156575 (2007-07-01), Sandholm et al.
patent: WO01/06405 (2001-01-01), None
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).
Yuzo Fujishima, Kevin Leyton-Brown 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).
Michael Rothkopf, Alexander Pekec and Ronald Harstad, “Computationally Manageable Combinatorial Auction”, Rutcor Research Report, pp. 21, Apr. 1995.
Noam Nissan, “Bidding and Allocation in Combinatorial Auctions”, Proceedings of the ACM Conference on Electronic Commerce (ACM-EC) (2000).
Moshe Tennenholtz, “Some Tractable Combinatorial Auctions”, Proceedings of the National Conference on Artificial Intelligence (AAAI), 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), (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.
Holger Hoos and Craig Boutilier, “Solving Combinatorial Auctions using Stochastic Local Search,” Proceedings of the National Conference on Artificial Intelligence (AAAI), Aug. 2000.
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; p. 639-676.
Peter R. Wurman and Michael P. Wellman; “AkBA: A Progressive, Anonymous-Price Combinatorial Auction”; EC'00, Oct. 17-20, 2000, 9 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.
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.
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; “Iterative Combinatorial Auctions: Theory and Practice,”; In Proc. 7th National Conference on Artificial Intelligence (AAAI-00), 8 pages.
A Chavez, D. Dreilinger, et al. “A Real-Life Experiment in Creating an Agent Marketplace”, Pros. Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Systems, 1977.
D. Cliff,e t al., “Less than Human: Simple Adaptive Trading Agents for CDA Markets”, Proceedings of the 1998 Symposium on Computation in Economics, Finance, and Engineering: Economic Systems, 1998.
F. Dignum, et al., “Modeling Communication Between Cooperative Systems”, Proceedings of the Conference on Advanced Information Systems Engineering (CAiSE '95), pp. 140-153, 1995.
P. Faratin, et al., “Negotiation Decision Functions for Autonomous Agents”, Robotics and Autonomous Systems, 3-4(24): pp. 159-182, 1998.
P. Garcia, et al., “Possibilistic-Based Design of Bidding Strategies in Electronic auctions”, Biennial European Conference on Artificial Intelligence, 1998.
S. Gjerstad, et al., “Price Formation in Double Auctions”, Games and Economic Behavior, 1(22), pp. 1-29, 1998.
A.R. Greenwald, et al. “Shopbots and Pricebots, Proceedings of the 16th International Joint Conference on Artificial Intelligence”, 1999.
N.R. Jennings, et al., “Using Intelligent Agents to Manage Business Processes”, First International Conference on the Practice Application of Intelligent Agents and Multi-Agent Technology (PAAM-96), pp. 345-360, Apr. 1996.
S. Park, et al., “An Adaptive Agent bidding Stretegy Based on Stochastic Modelling”, Proc. Third Conference on Autonomous Agents, 1999.
S. Parsons, et al., “Agents that Reason and Negotiate by Arguing”, Journal of Logic and Computation, 8(3), pp. 261-292, 1998.
G. Piccinelli, et al., “Concepts and Tools for e-Service Development”, Proc. 7th International Workshop HP OVUA, 2000.
G. Piccinelli,e t al., “Dynamic e-Service Composition in Dysco”, Part of the 21st International Cofnerence on Distributed Computing Systems (ICDCS-21), 2001.
C. Preist, “Commodity Trading Using an Agent-Based Integrated Double Auction”, Proc. Third International Conference on Autonomous Agents, 1999.
C. Preist, et al., “Algorithm Design for Agents Which Participate in Multiple Simultaneous Auctions”, F. Dignum and U. Cortest, editors, Agent Mediated Electronic Commerce III, Lecture Notes in Al. Springer Verlag, Sep. 2001a.
C. Preist, et al., “Economic Dynamics of Agents in Multiple Auctions”, to appear at Autonomous Agents 2001, 2001b.
C. Preist, et al., “Adaptive Agents in a Persistent Shout Double Auction”, Proceedigns of the 1st International Conference on the Internet, Computing and Economics, ACM Press, 1998.
J. Rosenchein, et al., Rules of Encounter, MIT Press, 1994.
T. Sandholm, emediator, “A Next Generation Electronic Commerce Server”, Proc. Fourth International Conference on Autonomous Agents, 2000.
R.G. Smith, “The Contract Net Protocol: High Level Communication and Control in a Distributed Problem Solver”, IEEE Transactions on Computing, 12(20), pp. 1104-1113, 1980.
N. Vulkan, et al., “Efficient Mechanisms for the Supply of Services in Multi-Agent Environments”, Proceedings of the 1st International Cofnerence on teh Internet, Computing and Economics, ACM Press, 1998.
N. Vulkan, et al., “Automated Trading in Agent-Based Markets for Communication Bandwidth”, Proc. UKMAS, 1999.
Bartolini Claudio
Byde Andrew Robert
Preist Christopher William
Chandler Sara
Hewlett--Packard Development Company, L.P.
Patel Jagdish N
LandOfFree
Method and data structure for participation in multiple... 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 data structure for participation in multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and data structure for participation in multiple... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4016450