Crossing network utilizing optimal mutual satisfaction density p

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

705 35, G06F 1760

Patent

active

059501774

ABSTRACT:
A crossing network that matches buy and sell orders based upon a satisfaction and quantity profile is disclosed. The crossing network 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 performed on a batch basis.

REFERENCES:
patent: 3573747 (1971-04-01), Adams et al.
patent: 3581072 (1971-05-01), Nymeyer
patent: 4334270 (1982-06-01), Towers
patent: 4346442 (1982-08-01), Musmanno
patent: 4376978 (1983-03-01), Musmanno
patent: 4412287 (1983-10-01), Braddock, III
patent: 4566066 (1986-01-01), Towers
patent: 4597046 (1986-06-01), Musmanno et al.
patent: 4642768 (1987-02-01), Roberts
patent: 4674044 (1987-06-01), Kalmus et al.
patent: 4677552 (1987-06-01), Sibley, Jr.
patent: 4677933 (1987-07-01), Rotella
patent: 4694397 (1987-09-01), Grant et al.
patent: 4722055 (1988-01-01), Roberts
patent: 4751640 (1988-06-01), Lucas et al.
patent: 4752877 (1988-06-01), Roberts et al.
patent: 4774663 (1988-09-01), Musmanno et al.
patent: 4799156 (1989-01-01), Shavit et al.
patent: 4839804 (1989-06-01), Roberts et al.
patent: 4876648 (1989-10-01), Lloyd
patent: 4903201 (1990-02-01), Wagner et al.
patent: 4910676 (1990-03-01), Alldredge
patent: 4933842 (1990-06-01), Durbin et al.
patent: 4953085 (1990-08-01), Atkins
patent: 4980826 (1990-12-01), Wagner
patent: 4992939 (1991-02-01), Tyler
patent: 5025138 (1991-06-01), Cuervo
patent: 5077665 (1991-12-01), Sukvernab et al.
patent: 5083270 (1992-01-01), Gross et al.
patent: 5083782 (1992-01-01), Nilssen
patent: 5101353 (1992-03-01), Lupien et al.
patent: 5126936 (1992-06-01), Champion et al.
patent: 5132899 (1992-07-01), Fox
patent: 5136501 (1992-08-01), Silverman et al.
patent: 5148365 (1992-09-01), Dembo
patent: 5161103 (1992-11-01), Kosaka et al.
patent: 5168446 (1992-12-01), Wiseman
patent: 5195031 (1993-03-01), Ordish
patent: 5214579 (1993-05-01), Wolfberg et al.
patent: 5220500 (1993-06-01), Baird et al.
patent: 5227967 (1993-07-01), Bailey
patent: 5243331 (1993-09-01), McCausland et al.
patent: 5283731 (1994-02-01), Lalonde et al.
patent: 5375055 (1994-12-01), Togher et al.
patent: 5557517 (1996-09-01), Daughterty, III
patent: 5689652 (1997-11-01), Lupien et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Crossing network utilizing optimal mutual satisfaction density p does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Crossing network utilizing optimal mutual satisfaction density p, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Crossing network utilizing optimal mutual satisfaction density p will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1815344

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.