# US 2018/0322573 A1 · Systems and methods for implemeting a meta-queue for transactions

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0322573 A1
- Document ID: US20180322573A1
- Status: Published application
- Kind: A1
- Application number: 15/589,406
- Filed: 2017-05-08
- Published: 2018-11-08
- Earliest claimed: 2017-05-08
- Assignees: IEX Group, Inc.
- Applicants: Iex Group, Inc.
- Inventors: Adrian Facini; Francis Chung; Daniel Aisen; Robert Park; Bradley Katsuyama; Constantine Sokoloff
- Web page: https://patentgrep.com/patent/US20180322573A1

## CPC

- G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
- G06Q 30/0283: Price estimation or determination
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

In a system for processing transactions, a received request for a transaction is either placed in a meta-queue or placed in a priority-parameter-based queue, depending on whether the request was received while the meta-queue was open. The transaction requests placed in the priority-parameter-based queue are processed only after all requests in the meta-queue are completely processed, and the requests in the priority-parameter-based queue are generally processed in the order of time of arrival of the requests. The requests in the meta-queue are not prioritized solely on the basis of the time of arrival, and may be selected for processing based on one or more request parameters, which can include the time of arrival. A selected portion of several or all requests in the meta-queue may be processed before processing another portion of one or more requests.

## Claims

### Claim 1

A method for compensating for communication or computation delays affecting orders received by an electronic trading system, the method comprising:
receiving via a communication interface an order comprising an order price and an order timestamp;
accessing from a memory a bin corresponding to the order price, the bin comprising a priority-parameter-agnostic partition and a priority-parameter-based partition, the priority-parameter-agnostic partition being associated with a partition-formation time;
recording the order in the priority-parameter-agnostic partition based on at least in part at least one of: (i) an order-related parameter, and (ii) whether a difference between the partition-formation time and the order timestamp is less than or equal to a delay threshold;
otherwise, recording the order in the priority-parameter-based partition.

### Claim 2 (depends on 1)

The method of claim 1, wherein the delay threshold comprises a sum of an average delay from a price quotation source to a trading station and an average delay from the trading station to the electronic trading system.

### Claim 3 (depends on 1)

The method of claim 1, wherein the delay threshold ranges from 300 μs up to 10 ms.

### Claim 4 (depends on 1)

The method of claim 1, wherein accessing the bin from the memory comprises:
determining that no bin in the memory corresponds to the order price;
creating and associating a new bin with the order price; and
designating the order timestamp as the partition-formation time.

### Claim 5 (depends on 1)

The method of claim 1, wherein:
the priority-parameter-agnostic partition comprises a queue, a place of the order within the queue being based on at least one of: the order timestamp, an order size, and a random order place.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
receiving via the communication interface a contra order; and
matching a first portion of the contra order up to a first match size with at least a first portion of an order in a first place in the queue, the first match size being one of a lot size, a size of the order in the first place, and a pre-selected percentage of the size of the order in the first place.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
matching a second portion of the contra order up to a second match size with at least a first portion of an order in a second place in the queue, the second match size being one of the lot size, the size of the order in the second place, and the pre-selected percentage of size of the order in the second place.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
matching a third portion of the contra order up to the first match size with at least a second portion of the order in the first place in the queue.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
matching a fourth portion of the contra order up to the second match size with at least a second portion of the order in the second place in the queue.

### Claim 10 (depends on 6)

The method of claim 6, further comprising:
determining that each order the queue is matched in entirety with one or more portions of the contra order; and
matching at least a fraction of a remainder of the contra order with at least a portion of a first order in the priority-parameter-based partition.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
receiving via the communication interface a contra order;
selecting a first order from the priority-parameter-agnostic partition according to a specified selection schedule comprising at least one of a round-robin selection, a random selection, an order-timestamp-based selection, and an order-size-based selection; and
matching a first portion of the contra order up to a first match size with at least a first portion of the selected first order, the first match size being one of a lot size and a pre-selected percentage of size of the selected first order.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
selecting a second order from the priority-parameter-agnostic partition according to the specified selection schedule; and
matching a second portion of the contra order up to a second match size with at least a first portion of the selected second order, the second match size being one of the lot size and the pre-selected percentage of size of the selected second order.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
matching a third portion of the contra order up to the first match size with at least a second portion of the selected first order.

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
matching a fourth portion of the contra order up to the second match size with at least a second portion of the selected second order.

### Claim 15 (depends on 11)

The method of claim 11, further comprising:
determining that each order the priority-parameter-agnostic partition is matched in entirety with one or more portions of the contra order; and
matching at least a fraction of a remainder of the contra order with at least a portion of a first order in the priority-parameter-based partition.

### Claim 16 (depends on 1)

The method of claim 1, wherein:
the order-related parameter comprises a number of orders in the priority-parameter-agnostic partition; and
recording the order in the priority-parameter-agnostic partition comprises determining that the number of orders in the priority-parameter-agnostic partition is less than a maximum permissible number of orders.

### Claim 17 (depends on 1)

The method of claim 1, wherein:
the order-related parameter comprises order source; and
recording the order in the priority-parameter-agnostic partition is based on, at least in part, whether the order source is designated retail.

### Claim 18 (depends on 1)

The method of claim 1, further comprising:
determining via respective sources of each one of a plurality of orders in the priority-parameter-agnostic partition that a single non-retail source is the source of each order in the plurality of orders; and
grouping all orders within the plurality of orders into a single order.

### Claim 19 (depends on 1)

The method of claim 1, wherein:
the order comprises at least one of a displayed portion and a non-displayed portion; and
accessing the bin from the memory comprises accessing at least one of a displayed bin associated with the displayed portion of the order, and a non-displayed bin associated with the non-displayed portion of the order, the displayed bin and non-displayed bin each having a respective priority-parameter-agnostic partition and a respective priority-parameter-based partition.

### Claim 20

A system for compensating for communication or computation delays affecting orders received by an electronic trading platform, the system comprising:
a first processor; and
a first memory in electrical communication with the first processor, the first memory comprising instructions which, when executed by a processing unit comprising at least one of the first processor and a second processor, and in electronic communication with a memory module comprising at least one of the first memory and a second memory, program the processing unit to:
receive via a communication interface an order comprising an order price and an order timestamp;
access from a memory a bin corresponding to the order price, the bin comprising a priority-parameter-agnostic partition and a priority-parameter-based partition, the priority-parameter-agnostic partition being associated with a partition-formation time;
record the order in the priority-parameter-agnostic partition based on at least in part at least one of: (i) an order-related parameter, and (ii) whether a difference between the partition-formation time and the order timestamp is less than or equal to a delay threshold;
otherwise, record the order in the priority-parameter-based partition.

### Claim 21 (depends on 20)

The system of claim 20, wherein the delay threshold comprises a sum of an average delay from a price quotation source to a trading station and an average delay from the trading station to the electronic trading system.

### Claim 22 (depends on 20)

The system of claim 20, wherein the delay threshold ranges from 300 μs up to 10 ms.

### Claim 23 (depends on 20)

The system of claim 20, wherein to access the bin from the memory the instructions program the processing unit to:
determine that no bin in the memory corresponds to the order price;
create and associating a new bin with the order price; and
designate the order timestamp as the partition-formation time.

### Claim 24 (depends on 20)

The system of claim 20, wherein:
the priority-parameter-agnostic partition comprises a queue, a place of the order within the queue being based on at least one of: the order timestamp, an order size, and a random order place.

### Claim 25 (depends on 24)

The system of claim 24, wherein the instructions further program the processing unit to:
receive via the communication interface a contra order; and
match a first portion of the contra order up to a first match size with at least a first portion of an order in a first place in the queue, the first match size being one of a lot size, a size of the order in the first place, and a pre-selected percentage of the size of the order in the first place.

### Claim 26 (depends on 25)

The system of claim 25, wherein the instructions further program the processing unit to:
match a second portion of the contra order up to a second match size with at least a first portion of an order in a second place in the queue, the second match size being one of the lot size, the size of the order in the second place, and the pre-selected percentage of size of the order in the second place.

### Claim 27 (depends on 26)

The system of claim 26, wherein the instructions further program the processing unit to:
match a third portion of the contra order up to the first match size with at least a second portion of the order in the first place in the queue.

### Claim 28 (depends on 27)

The system of claim 27, wherein the instructions further program the processing unit to:
match a fourth portion of the contra order up to the second match size with at least a second portion of the order in the second place in the queue.

### Claim 29 (depends on 25)

The system of claim 25, wherein the instructions further program the processing unit to:
determine that each order the queue is matched in entirety with one or more portions of the contra order; and
match at least a fraction of a remainder of the contra order with at least a portion of a first order in the priority-parameter-based partition.

### Claim 30 (depends on 20)

The system of claim 20, wherein the instructions further program the processing unit to:
receive via the communication interface a contra order;
select a first order from the priority-parameter-agnostic partition according to a specified selection schedule comprising at least one of a round-robin selection, a random selection, an order-timestamp-based selection, and an order-size-based selection; and
match a first portion of the contra order up to a first match size with at least a first portion of the selected first order, the first match size being one of a lot size and a pre-selected percentage of size of the selected first order.

### Claim 31 (depends on 30)

The system of claim 30, wherein the instructions further program the processing unit to:
select a second order from the priority-parameter-agnostic partition according to the specified selection schedule; and
match a second portion of the contra order up to a second match size with at least a first portion of the selected second order, the second match size being one of the lot size and the pre-selected percentage of size of the selected second order.

### Claim 32 (depends on 31)

The system of claim 31, wherein the instructions further program the processing unit to:
match a third portion of the contra order up to the first match size with at least a second portion of the selected first order.

### Claim 33 (depends on 32)

The system of claim 32, wherein the instructions further program the processing unit to:
match a fourth portion of the contra order up to the second match size with at least a second portion of the selected second order.

### Claim 34 (depends on 30)

The system of claim 30, wherein the instructions further program the processing unit to:
determine that each order the priority-parameter-agnostic partition is matched in entirety with one or more portions of the contra order; and
match at least a fraction of a remainder of the contra order with at least a portion of a first order in the priority-parameter-based partition.

### Claim 35 (depends on 20)

The system of claim 20, wherein:
the order-related parameter comprises a number of orders in the priority-parameter-agnostic partition; and
to record the order in the priority-parameter-agnostic partition the instructions program the processing unit to determine that the number of orders in the priority-parameter-agnostic partition is less than a maximum permissible number of orders.

### Claim 36 (depends on 20)

The system of claim 20, wherein:
the order-related parameter comprises order source; and
the instructions program the processing unit to record the order in the priority-parameter-agnostic partition based on, at least in part, whether the order source is designated retail.

### Claim 37 (depends on 20)

The system of claim 20, wherein the instructions further program the processing unit to:
determine via respective sources of each one of a plurality of orders in the priority-parameter-agnostic partition that a single non-retail source is the source of each order in the plurality of orders; and
group all orders within the plurality of orders into a single order.

### Claim 38 (depends on 20)

The system of claim 20, wherein:
the order comprises at least one of a displayed portion and a non-displayed portion; and
to access the bin from the memory, the instructions program the processing unit to access at least one of a displayed bin associated with the displayed portion of the order, and a non-displayed bin associated with the non-displayed portion of the order, the displayed bin and non-displayed bin each having a respective priority-parameter-agnostic partition and a respective priority-parameter-based partition.