Virtual marketplace agent technology

• US 20030187773A1
• Filed: 04/02/2002
• Published: 10/02/2003
• Est. Priority Date: 04/02/2002
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Guler, Kemal, Santos, Cipriano A., Beyer, Dirk
• Application Number:
  US10/114,598
• Publication Number:
  US 20030187773A1
• Time in Patent Office: Days
• US Class Current: 705/37
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

A virtual marketplace employing automated agents. Buyer agents and seller agents interface via a market-clearing agent to using a common vocabulary by which the clearing agent can negotiate matches between buyers'"'"' and sellers'"'"' offers represented respectively by the buyer agent and seller agent modeled for a transaction. Mathematical modeling and problem solver technology is employed for each of the agents such that negotiations over a bid-offer transaction can be automatically solved.

Claims

1. A system for automating virtual marketplace transactions, comprising:

buyer-associated programmable buy-routines based upon mathematical optimization problem solving for submitting bids-to-buy to said virtual marketplace;

seller-associated programmable sell-routines based upon mathematical optimization problem solving for submitting offers-to-sell to said virtual marketplace; and

interconnecting said buy-routines and said sell-routines, programmable clearing-agent routines based upon mathematical optimization problem solving for receiving said bids-to-buy and said offers-to-sell, respectively, for matching bids-to-buy and offers-to-sell in said virtual marketplace, and for communicating results of said matching to respective buy-routines and sell-routines.

2. The system as set forth in claim 1 wherein said buy-routines, said sell-routines, and said clearing-agent routines share a common interface vocabulary associated with said virtual marketplace transactions.

3. The system as set forth in claim 1 wherein bids-to-buy anonymity and offers-to-sell anonymity is maintained via said clearing-agent routines.

4. The system as set forth in claim 1, said buyer-associated programmable buy-routines comprising:

a buyer-agent routine for receiving buyer-associated Enterprise-Resource-Planning data and data representative of quantifiable management objectives associated with said virtual marketplace and for providing an output data set representative of a model for transactions associated with buying in said virtual marketplace.

5. The system as set forth in claim 4 further comprising:

a buyer-agent mathematical problem solver routine for receiving said output data set representative of a model for transactions associated with buying in said virtual marketplace and an output data set from said clearing-agent routines, said an output data set representative of current said offers-to-sell information from said clearing-agent routines, such that said solver routine is adapted for revising said output data set representative of a model for transactions associated with buying in said virtual marketplace therefrom.

6. The system as set forth in claim 1, said seller-associated programmable routines comprising:

a seller-agent routine for receiving seller-associated Enterprise-Resource-Planning data and data representative of quantifiable management objectives associated with selling in said virtual marketplace transactions and for providing an output data set representative of a model for transactions associated with selling in said virtual marketplace.

7. The system as set forth in claim 6 further comprising:

a seller-agent mathematical problem solver routine for receiving said output data set associated with selling in said virtual marketplace and an output data set from said clearing-agent routine, said second output data set representative of current said bids-to-buy information from said clearing-agent routines, such that said solver routine is adapted for revising said output data set associated with selling in said virtual marketplace therefrom.

8. The system as set forth in claim 1, said clearing-agent programmable routines further comprising:

a clearing-agent routine for receiving a plurality of said offers-to-sell and a plurality of said bids-to-buy and for providing an output data set representative of matches between said offers-to-sell and said bids-to-buy.

9. The system as set forth in claim 8 further comprising:

a clearing-agent mathematical problem solver routine for providing data indicative of market clearing transaction structures for each of said offers-to-sell and bids-to-buy.

10. The system as set forth in claim 1, said bids-to-buy comprising:

programmable bid-objects including unique identification code for identifying a principal represented by buy-routines, code for identifying sale items, code for listing eligible suppliers, and code specifying acceptable delivery dates.

11. The system as set forth in claim 10, said code for listing eligible suppliers comprising:

an explicit enumeration of supplier names or supplier identification codes.

12. The system as set forth in claim 10, said code for listing eligible suppliers comprising:

a rule-based description of qualified suppliers.

13. The system as set forth in claim 10, said code for listing eligible suppliers comprising:

a combination of explicit enumeration of supplier names or supplier identification codes and descriptive rules for determining qualified suppliers.

14. The system as set forth in claim 1, said offers-to-sell comprising:

programmable offer-objects including unique identification code for identifying a principal represented by sell-routines, code for identifying sale items including quantity and price, code for listing potential known buyers, and code specifying acceptable delivery dates.

15. The system as set forth in claim 14, said offers-to-sell further comprising:

a demand curve, a list of eligible buyers for each item in the item list, and a range of dates for each item in the item list representing the acceptable delivery dates for the item.

16. The system as set forth in claim 15, said list of eligible buyers further comprising:

enumeration of buyer names or buyer identification codes.

17. The system as set forth in claim 15, said list of eligible buyers further comprising:

rule-based description of qualified buyers.

18. The system as set forth in claim 15, said list of eligible buyers further comprising:

explicit enumeration and descriptive rules combined for stating the eligible buyers.

19. The system as set forth in claim 8, said programmable clearing-agent routines further comprising:

a mathematical model clearing agent wherein said output data set representative of matches between said offers-to-sell and said bids-to-buy is a function of maximized total surplus.

20. The system as set forth in claim 8, said programmable clearing-agent routines further comprising:

a mathematical model clearing agent wherein said output data set representative of matches between said offers-to-sell and said bids-to-buy is a function of minimized excess demand.

21. A method of conducting business, the method comprising:

providing computerized links to a virtual marketplace site, said site including an automated clearing agent for mathematical modeling of market clearing functions and for mathematical problem solving routines associated with said market clearing functions;

providing entities linked to the virtual marketplace site with automated buy-sell agent functionality based on mathematical modeling and mathematical problem solving routines associated with developing automated buying agents for creating bid-to-buy objects and automated selling agents for creating offer-to-sell objects wherein said objects are transmitted via said links to said clearing agent and wherein said clearing agent automatically executes said market clearing function therefrom.

22. The method set forth in claim 21 wherein said automated clearing agent is providing feedback to said agents with respect to current bid-to-buy objects and current offer-to-sell objects such that said objects may be respectively modified for facilitating bid-offer matching.

23. The method as set forth in claim 21 wherein said buying agents and selling agents are programmed for maintaining anonymity of each of their respective said entities.

24. A computerized process for business negotiation in a virtual marketplace, the process comprising:

establishing a virtual marketplace site having a virtual clearing agent residing therein;

submitting anonymous bids to said site via a mathematically modeled virtual buying agents; and

submitting anonymous asks to said site via a mathematically modeled virtual selling agents, wherein said virtual clearing agent is mathematically modeled for market clearing functionality and has mathematically modeled problem solving functionality for matching said bids to said asks.

25. The process as set forth in claim 24, comprising providing real-time feedback from said clearing agent to buying agents and selling agents negotiating for compatible virtual marketplace commodities or services such that said agents may modify said bids and said asks in response thereto.

26. The process as set forth in claim 24 comprising:

limiting access to buyer enterprise bidding information to said buying agents only and limiting access to seller enterprise selling information to said selling agents only.

27. An executable virtual marketplace model comprising:

a clearing agent wherein said clearing agent is a mathematical model for optimizing market clearing functions;

linked to said clearing agent, a plurality of buying agents wherein each buying agent is a mathematical model using respective buyer mathematical optimization models for formulating bid objects for submitting to said clearing agent; and

linked to said clearing agent, a plurality of selling agents wherein each selling agent is a mathematical model using respective seller mathematical optimization models for formulating ask objects for submitting to said clearing agent.

28. The model as set forth in claim 27, said clearing agent further comprising:

a mathematical market clearing problem solver for comparing the bid objects and the ask objects and formulating market clearing solutions therefrom.

29. The model as set forth in claim 28, each said buying agent further comprising:

a mathematical transactional-bidding problem solver for receiving said market clearing solutions from said clearing agent and reformulating bid objects therefrom.

30. The model as set forth in claim 28, each said selling agent further comprising:

a mathematical transactional-asking problem solver for receiving said market clearing solutions from said clearing agent and reformulating ask objects therefrom.

31. The model as set forth in claim 27 wherein buyer mathematical optimization model access is limited to a bidding agent level of the model and seller mathematical optimization models access is limited to a selling agent level of the model.

32. A memory device comprising:

computer code for establishing a virtual marketplace site having a virtual clearing agent residing therein;

computer code for submitting anonymous bids to said site via a mathematically modeled virtual buying agents; and

computer code for submitting anonymous asks to said site via a mathematically modeled virtual selling agent,

wherein said virtual clearing agent is mathematically modeled for market clearing functionality and has mathematically modeled problem solving functionality for matching said bids to said asks.