Crossing network utilizing satisfaction density profile with price discovery features

• US 5,845,266 A
• Filed: 12/12/1995
• Issued: 12/01/1998
• Est. Priority Date: 12/12/1995
• Status: Expired due to Term

• Current Assignee: Optimark, Inc. (Optimark Holdings, Inc.)
• Original Assignee: Optimark Technologies Incorporated (Optimark Holdings, Inc.)
• Inventors: Rickard, John T., Lupien, William A.
• Primary Examiner(s): Weinhardt, Robert A.
• Assistant Examiner(s): Tkacs, Stephen R.
• Application Number:
  US08/571,328
• Time in Patent Office: 1,085 Days
• Field of Search: 364/709.04, 364/710.04, 395/201, 395/235, 395/236, 395/237, 395/326, 395/329, 395/339, 395/340, 395/355, 395/925, 395/961, 395/962
• US Class Current: 705/36.00R
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
• CPC Class Codes: G06Q 40/06 Asset management; Financial planning or analysis

Abstract

A crossing network that matches buy and sell orders based upon a satisfaction and quantity profile includes a number of trader terminals that can be used for entering orders. The orders are entered in the form of a satisfaction density profile that represents a degree of satisfaction to trade a particular instrument at various (price, quantity) combinations. Typically, each order is either a buy order or a sell order. The trader terminals are coupled to a matching controller computer. The matching controller computer can receive as input the satisfaction density profiles entered at each one of the trading terminals. The matching controller computer matches orders (as represented by each trader'"'"'s satisfaction density profile) so that each trader is assured that the overall outcome of the process (in terms of average price and size of fill) has maximized the mutual satisfaction of all traders. Typically, the matching process is anonymous. The matching process can be continuous or a batch process, or a hybrid of the two. Unmatched satisfaction density profiles can be used to provide spread and pricing information. Factors other than price and quantity also may be used to determine the degree of satisfaction. Optionally, priority may be given to certain profiles in the matching process to accommodate stock exchange rules, for example, requiring that priority be given to orders exhibiting the best price, regardless of size or any other consideration.

Claims

1. A crossing network that matches orders for instruments where the orders are represented by a satisfaction density profile, the crossing network comprising:

a plurality of terminals for entering orders in the form of a satisfaction density profile that represents a degree of satisfaction to trade an instrument at a plurality of (price, quantity) combinations, each satisfaction density profile representing either a buy order or a sell order for the instrument; and

a matching controller computer coupled to each one of the plurality of terminals over a communications network and receiving as input each satisfaction density profile entered at each one of the plurality of terminals, the matching controller computer matching, where possible, satisfaction density profiles representing buy orders with satisfaction density profiles representing sell orders, and thereafter comparing unmatched satisfaction density profiles representing buy orders for one or more predetermined instruments with unmatched satisfaction density profiles representing sell orders for corresponding one or more predetermined instruments to obtain spread information for each one or more predetermined instruments.

2. The crossing network of claim 1 wherein the matching controller computer further comprises:

means for pairing each satisfaction density profile representing a buy order with each satisfaction density profile representing a sell order;

means for calculating for each satisfaction density profile pair a mutual satisfaction function, each mutual satisfaction function including a plurality of (price, quantity) combinations representing a degree of mutual satisfaction for trading said quantity at said price;

means for ranking according to the degree of mutual satisfaction every (price, quantity) combination of every mutual satisfaction function; and

means for matching, in accordance with the ranking, buy orders with sell orders.

3. The crossing network of claim 1 wherein the spread information is represented as a two-dimensional graph having a price axis and a quantity axis.

4. The crossing network of claim 1 further comprising means for outputting the spread information in graphical form.

5. The crossing network of claim 1 further comprising means for outputting the spread information in statistical form.

6. The crossing network of claim 1 wherein satisfaction density profile is a two-dimensional graph having a price axis and a quantity axis.

7. The crossing network of claim 1 wherein the satisfaction density profile is entered at the terminal as a contour graph.

8. The crossing network of claim 1 wherein the satisfaction density profile is entered at the terminal as a temperature graph.

9. The crossing network of claim 1 wherein each satisfaction density profile includes a satisfaction density value for each (price, quantity) combination.

10. A crossing network that matches orders for instruments where the orders are represented by a satisfaction density profile, the crossing network comprising:

a plurality of terminals for entering orders in the form of a satisfaction density profile that represents a degree of satisfaction to trade an instrument at a plurality of (price, quantity) combinations, each satisfaction density profile representing either a buy order or a sell order for the instrument; and

a matching controller computer coupled to each one of the plurality of terminals over a communications network and receiving as input each satisfaction density profile entered at each one of the plurality of terminals, the matching controller computer matching, where possible, satisfaction density profiles representing buy orders with satisfaction density profiles representing sell orders,

the matching controller computer aggregating information from each entered satisfaction density profile to obtain an aggregate density profile.

11. The crossing network of claim 10 wherein the aggregate density profile is represented as a two-dimensional graph having a price axis and a quantity axis.

12. The crossing network of claim 11 wherein the aggregate density profile is a market depth profile representing quantities of non-zero (price, quantity) combinations entered at each (price, quantity) coordinate for all satisfaction density profiles relating to a predetermined instrument.

13. The crossing network of claim 10 wherein the matching controller further comprising means for giving priority to satisfaction density profiles exhibiting a best price regardless of quantity.

14. The crossing network of claim 10 further comprising means for outputting the aggregate density profile in statistical form.

15. The crossing network of claim 10 wherein each satisfaction density profile is a two-dimensional graph having a price axis and a quantity axis.

16. The crossing network of claim 10 wherein each satisfaction density profile includes a satisfaction density value for each (price, quantity) combination.