IP Library Granted Patent US 7,870,062
Granted Patent B2
US 7,870,062 · App. 12/153,362 · Granted Jan 11, 2011

Coordination of algorithms in algorithmic trading engine with fast switching and safe mode

Assignee: Pipeline Financial Group, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,870,062
App. No.
12/153,362
Granted
Jan 11, 2011
Kind
B2
Abstract

A graphical user interface is used along with an automated algorithm selection function to enable market participants to initiate automated, multi-algorithm trading strategies through a single drag and drop motion. A symbol representing a security can be dragged and dropped onto an icon representing a tactical or strategic algorithm. Other features of the graphical user interface show information such as the progress of the algorithms. Fast switching and safe mode are used to minimize a cost associated with algorithm switching.

Claims (38)

1. A computer system comprising one or more processors programmed to:

(a) receive data describing a trading order for a security;

(b) assign execution of at least part of said trading order to a first trading algorithm;

(c) transmit a request to cancel execution of a part of said trading order assigned to but not yet executed by said first trading algorithm; and

(d) prior to receiving a cancel confirmation for said part of said trading order assigned to but not yet executed by said first trading algorithm, commence execution by a second trading algorithm of at least a portion of said part of said trading order assigned to but not yet executed by said first trading algorithm.

2. A computer system as in claim 1 , wherein size of said portion of said part of said trading order assigned to, but not yet executed by, said first trading algorithm is determined based on number of available shares and number of shares expected to be successfully canceled from being executed by said first trading algorithm.

3. A computer system as in claim 2 , wherein number of available shares is based on shares not yet routed out to said first trading algorithm, and number of shares expected to be successfully canceled is based on 80% of shares routed out to but not yet executed by said first trading algorithm.

4. A computer system as in claim 1 , wherein said first trading algorithm has a slower expected rate of execution than said second trading algorithm.

5. A computer system as in claim 1 , wherein, when one or more shares allocated to said second trading algorithm are filled by said first trading algorithm, said processors are further programmed to allocate said one or more shares to an error account.

6. A computer system as in claim 5 , wherein shares allocated to said error account are traded in an order on the opposite side of said trading order executed by said first trading algorithm.

7. A computer system comprising one or more processors programmed to:

(a) receive data describing a trading order for a security;

(b) assign execution of at least part of said trading order to a first trading algorithm;

(c) receive data regarding current market prices for said security;

(d) for each current market price, compare said current market price to a threshold; and

(e) when one of said current prices fails to satisfy said threshold, switch to a second trading algorithm.

8. A computer system as in claim 7 , wherein said threshold is based on a difference between current price and fair price.

9. A computer system as in claim 8 , wherein said threshold is one standard deviation from fair price.

10. A computer system as in claim 8 , wherein said fair price is calculated based on quantity of shares, index drift amount in basis points, and a start price.

11. A computer system as in claim 10 , wherein said fair price is calculated based on a formula functionally equivalent to:

S=S 0 e g(X)+r M , where S is fair price, S 0 is NBBO midpoint at arrival,

g

(

X

)

=

a

(

σ

10000

)

b

X

,

where X is current number of shares filled for the order, including block fills, divided by the security's average daily volume; a and b are system configurable global parameters, and r M =r M =10000 ln(S SPY /S 0 SPY ).

Assignments (4)
NUNC PRO TUNC ASSIGNMENT Recorded Feb 1, 2018
From: ALPHA VISION SERVICES, LLC
To: PORTWARE, LLC
Reel/Frame 044805/0602 →
CHANGE OF NAME Recorded Aug 7, 2012
From: PIPELINE FINANCIAL GROUP, INC
To: ARITAS GROUP, INC.
Reel/Frame 028739/0984 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 7, 2012
From: ARITAS GROUP, INC.
To: ALPHA VISION SERVICES, LLC
Reel/Frame 028741/0911 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 7, 2008
From: WAELBROECK, HENRI; GAMSE, BRENT
To: PIPELINE FINANCIAL GROUP, INC.
Reel/Frame 021355/0178 →
Continuity (3)
Continuation In Part 1178325000 · Apr 6, 2007
Provisional Application 6079564600 · Apr 28, 2006
Related Publication 20090254473A1 · Oct 8, 2009