Architecture for anonymous trading system

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S037000

Reexamination Certificate

active

07937306

ABSTRACT:
An anonymous trading system comprises a network of broker nodes, each of which have an equal status and can match orders, initiate deals and distribute prices. Trading agents are connected to some or all of the broker nodes. The network is arranged to conform to a series of rules and in a preferred embodiment the brokers are arranged as a clique tree.

REFERENCES:
patent: 3823387 (1974-07-01), McClellan
patent: 4388489 (1983-06-01), Wigan et al.
patent: 4525779 (1985-06-01), Davids et al.
patent: 4531184 (1985-07-01), Wigan et al.
patent: 4554418 (1985-11-01), Toy
patent: 4555781 (1985-11-01), Baldry et al.
patent: 4598367 (1986-07-01), DeFrancesco et al.
patent: 4623964 (1986-11-01), Getz et al.
patent: 4750135 (1988-06-01), Boilen
patent: 4815030 (1989-03-01), Cross et al.
patent: 5003473 (1991-03-01), Richards
patent: 5034916 (1991-07-01), Ordish
patent: 5077665 (1991-12-01), Silverman et al.
patent: 5195031 (1993-03-01), Ordish
patent: 5230048 (1993-07-01), Moy
patent: 5257369 (1993-10-01), Skeen et al.
patent: 5267148 (1993-11-01), Kosaka et al.
patent: 5270922 (1993-12-01), Higgins
patent: 5287787 (1994-02-01), Inoue
patent: 5508913 (1996-04-01), Yamamoto et al.
patent: 5557780 (1996-09-01), Edwards et al.
patent: 5557798 (1996-09-01), Skeen et al.
patent: 5600638 (1997-02-01), Bertin et al.
patent: 5615269 (1997-03-01), Micali
patent: 5710889 (1998-01-01), Clark et al.
patent: 5727165 (1998-03-01), Ordish et al.
patent: 5787402 (1998-07-01), Potter et al.
patent: 5809483 (1998-09-01), Broka et al.
patent: 5815665 (1998-09-01), Teper et al.
patent: 5864827 (1999-01-01), Wilson
patent: 5870544 (1999-02-01), Curtis
patent: 5890140 (1999-03-01), Clark et al.
patent: 5905248 (1999-05-01), Russell et al.
patent: 5905974 (1999-05-01), Fraser et al.
patent: 5909545 (1999-06-01), Frese, II et al.
patent: 5915209 (1999-06-01), Lawrence
patent: 5924082 (1999-07-01), Silverman et al.
patent: 5924083 (1999-07-01), Silverman et al.
patent: 5933816 (1999-08-01), Zeanah et al.
patent: 5966531 (1999-10-01), Skeen et al.
patent: 5995947 (1999-11-01), Fraser et al.
patent: 6029146 (2000-02-01), Hawkins et al.
patent: 6519574 (2003-02-01), Wilton et al.
patent: 7366690 (2008-04-01), Howorka et al.
patent: 0399850 (1990-11-01), None
patent: 0407026 (1991-01-01), None
patent: 0411748 (1991-02-01), None
patent: 0434224 (1991-06-01), None
patent: 0485252 (1992-05-01), None
patent: 0512702 (1992-11-01), None
patent: 0798635 (1997-10-01), None
patent: 0818746 (1998-01-01), None
patent: 0893758 (1999-01-01), None
patent: 0907134 (1999-04-01), None
patent: 2543327 (1984-09-01), None
patent: 1489574 (1977-10-01), None
patent: 2165421 (1986-04-01), None
patent: 2180380 (1987-03-01), None
patent: 2210714 (1989-06-01), None
patent: 2282246 (1995-03-01), None
patent: 2325130 (1998-11-01), None
patent: 2326256 (1998-12-01), None
patent: 7-212397 (1995-08-01), None
patent: 10-511788 (1998-11-01), None
patent: 90/02382 (1990-03-01), None
patent: 92/07324 (1992-04-01), None
patent: 92/15174 (1992-09-01), None
patent: 93/15467 (1993-08-01), None
patent: 94/15294 (1994-07-01), None
patent: 95/06918 (1995-03-01), None
patent: 95/18418 (1995-07-01), None
patent: 95/30211 (1995-11-01), None
patent: 96/18963 (1996-06-01), None
patent: 96/34357 (1996-10-01), None
patent: WO-96/41315 (1996-12-01), None
patent: WO 97/08640 (1997-03-01), None
patent: 97/22072 (1997-06-01), None
patent: 97/24833 (1997-07-01), None
patent: 97/31323 (1997-08-01), None
patent: 97/33215 (1997-09-01), None
patent: 97/36253 (1997-10-01), None
patent: 97/43727 (1997-11-01), None
patent: 97/45802 (1997-12-01), None
patent: 97/49050 (1997-12-01), None
patent: 98/05011 (1998-02-01), None
patent: 98/13796 (1998-04-01), None
patent: 98/21667 (1998-05-01), None
patent: 98/24041 (1998-06-01), None
patent: 98/26344 (1998-06-01), None
patent: 98/26363 (1998-06-01), None
patent: 98/36456 (1998-08-01), None
patent: 98/38558 (1998-09-01), None
patent: 98/47268 (1998-10-01), None
patent: 98/49635 (1998-11-01), None
patent: 98/49639 (1998-11-01), None
patent: 98/53581 (1998-11-01), None
patent: 99/01983 (1999-01-01), None
patent: 99/08419 (1999-02-01), None
patent: 99/10795 (1999-03-01), None
patent: 99/10815 (1999-03-01), None
patent: 99/14695 (1999-03-01), None
patent: 99/19821 (1999-04-01), None
patent: 99/27477 (1999-06-01), None
patent: 99/33242 (1999-07-01), None
patent: 99/35583 (1999-07-01), None
patent: 99/36875 (1999-07-01), None
patent: 99/40502 (1999-08-01), None
patent: 99/41690 (1999-08-01), None
patent: 99/50771 (1999-10-01), None
Mini Computer forum, Conference Proceedings, 1975.
Wall Street Computer Review, 1998.
Computers in the City, Conference Proceedings, 1988.
Banking Technology, 1988, vol. 5, No. 5.
U.K. Search Report issued Feb. 9, 2001 (in English).
“Pathalias,” Honeyman P. & Bellovin SM, Proc. USENIX Summer Conference, Jun. 1986, pp. 126-141.
“A Cluster-based Approach for Routing in Ad-Hoc networks,” Krishna et al., May 11, 1995, at www. usenix. org/publications/library/proceedings/mob95/full papers/krishna.txt.
Australian Search Report dated Dec. 10, 2002.

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

Architecture for anonymous trading system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Architecture for anonymous trading system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Architecture for anonymous trading system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2679286

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