Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: Systems and methods are provided for scoring the use of financial market messages. Uses of messages that are efficient and/or improve market liquidity receive positive scores. Traders are charge fees or receive rewards that are dependent upon message quality scores.

Abstract: Systems and methods are provided for scoring the use of financial market messages. Uses of messages that are efficient and/or improve market liquidity receive positive scores. Traders are charge fees or receive rewards that are dependent upon message quality scores.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: Systems and methods are provided for scoring the use of financial market messages. Uses of messages that are efficient and/or improve market liquidity receive positive scores. Traders are charge fees or receive rewards that are dependent upon message quality scores.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: Systems and methods are provided for scoring the use of financial market messages. Uses of messages that are efficient and/or improve market liquidity receive positive scores. Traders are charge fees or receive rewards that are dependent upon message quality scores.

Abstract: A banding start price may be generated using one of multiple subroutines. Each of the subroutines may generate a banding start price using a different algorithm and may have different input data criteria. Each of those subroutines may be ranked based expected accuracy of a price output by the subroutine. The banding start price may be generated by the highest ranking subroutine for which there is input data satisfying relevant criteria.

Abstract: A transaction suspension system rapidly determines whether messages received by a data transaction processing system correspond to a stored message pattern. Stored message patterns may relate to a transaction type associated with each message, which sources transmitted the messages, and when messages were received by the data transaction processing system. The transaction suspension system may prevent the processing of messages, e.g., messages from a specific source, even if the messages would have otherwise qualified for processing or execution.

Abstract: A banding start price may be generated using one of multiple subroutines. Each of the subroutines may generate a banding start price using a different algorithm and may have different input data criteria. Each of those subroutines may be ranked based expected accuracy of a price output by the subroutine. The banding start price may be generated by the highest ranking subroutine for which there is input data satisfying relevant criteria.

Abstract: A banding start price may be generated using one of multiple subroutines. Each of the subroutines may generate a banding start price using a different algorithm and may have different input data criteria. Each of those subroutines may be ranked based expected accuracy of a price output by the subroutine. The banding start price may be generated by the highest ranking subroutine for which there is input data satisfying relevant criteria.

Abstract: A transaction suspension system rapidly determines whether messages received by a data transaction processing system correspond to a stored message pattern. Stored message patterns may relate to a transaction type associated with each message, which sources transmitted the messages, and when messages were received by the data transaction processing system. The transaction suspension system may prevent the processing of messages, e.g., messages from a specific source, even if the messages would have otherwise qualified for processing or execution.

Abstract: A transaction suspension system rapidly determines whether messages received by a centralized, anonymous data transaction processing system related to data objects correspond to a stored message pattern. Stored message patterns may include how the message impact objects within the data transaction processing system, which sources transmitted the messages, and when messages were received by the data transaction processing system. The transaction suspension system may prevent the further processing of messages, e.g., messages from a specific source, even if the message would have otherwise qualified for a completed, or processed, transaction.

Abstract: A processing module may be centralized and coupled to multiple inputs from customers, and behave deterministically, e.g., programmed to depend on state, inputs and outputs. The rapid speed of automated trading systems implementing such a centralized, deterministic module, where all users can access a central limit order object, can quickly result in an object state that does not reflect a true consensus or desirable state. Accordingly the resulting problem is a problem arising in computer systems due in part to the high speeds of computer systems. The solutions disclosed herein are, in one embodiment, implemented as automatic responses and actions by a computing system.

Abstract: A method for halting, e.g., automatically, processing of electronic data transaction request messages having values outside of a range for a data object in a data transaction processing system includes: receiving, by a processor, a first electronic data transaction request message to perform a transaction on a first data object; determining, by the processor, a first active value for the first data object based on the first electronic data transaction request message; determining a resultant spread representing a difference between a first resultant value for the first object and a second resultant value for a second object correlated to the first data object; determining a range for the second data object based on the first active value, the resultant spread, and an acceptable deviation from the resultant spread; storing the range; and comparing values associated with electronic data transaction request messages received for the second data object to the range.

Abstract: An incoming order is matched or allocated to trade with a plurality of resting orders. Order book data indicative of the resting orders is obtained. For each resting order, a set of order quality factor scores is determined based on the order book data. The order quality factor scores include any combination of two or more of a first factor score indicative of order quantity, a second factor score indicative of order book position, and a third factor score indicative of order duration without modification. A ranking of the plurality of resting orders is determined based on the set of order quality factor scores determined for each order of the plurality of resting orders. A volume of the incoming order is allocated across a subset of orders of the plurality of resting orders based on the ranking in partial satisfaction of the incoming order.