Patent Application
20140316961
The present invention relates to financial product trading systems and, in particular, to methods and systems that allow for dynamic adjustment to a bid ask spread.
Financial instruments are generally traded at exchanges and other entities by listing bid and ask orders at different price levels. Trading increments are set so that financial instruments trade at established price levels. For example, a financial instrument having a trading increment of 0.01 may list at an exchange at price levels of 95.26, 95.27 and 95.28. Trading increments may be determined for each financial product. Typically higher volatility financial instruments have relatively higher trading increments so that there are a reasonable number of price levels. Trading increments are generally set when a financial product is designed. If trading increments are too small, there can be a limited quantity of financial instruments available at each price level, resulting in spreading out of liquidity. Liquidity can also be reduced if the trading increments are too large, resulting in lower trading volumes. Regulatory requirements and other issues can make changing trading increments burdensome and time consuming.
A bid ask spread is the price difference between the highest bid and the lowest ask, which represents the difference in price between the highest price that a buyer is willing to pay for a financial instrument and the lowest price for which a seller is willing to sell a financial instrument. Minimum bid ask spreads generally correspond to trading increments. Smaller minimum bid ask spreads and trading increments tend to result in resting orders being spread out among multiple price levels, which can result in relatively smaller resting order sizes. Larger minimum bid ask spreads and trading increments tend to result in liquidity being concentrated at the top of an order book, but limit the price levels available for trading financial instruments. Selecting a trading increment and the corresponding minimum bid ask spread often results in compromises and less than optimum choices.
Therefore, there is a need in the art for improved systems and methods that provide greater flexibility in setting bid ask spreads and trading increments.
Embodiments of the present invention overcomes problems and limitations of the prior art by providing trading methods and systems that allow for dynamic adjustment to a minimum bid ask spread. Various criteria may be analyzed, such as criteria relating to existing resting order sizes at specific price levels, such as at the best bid and/or the best ask, to determine if a bid ask spread meets the desired criteria. When the criteria is not met, the bid ask spread may be adjusted while maintaining a fixed trading increment. The adjustment to the bid ask spread may be performed by aggregating orders. Aggregation may include raising a price of the lowest ask prices and/or lowering a price of the highest bid orders.
In other embodiments, the present invention can be partially or wholly implemented on a computer-readable medium, for example, by storing computer-executable instructions or modules, or by utilizing computer-readable data structures.
Of course, the methods and systems of the above-referenced embodiments may also include other additional elements, steps, computer-executable instructions, or computer-readable data structures. In this regard, other embodiments are disclosed and claimed herein as well.
The details of these and other embodiments of the present invention are set forth in the accompanying drawings and the description below. Other features and advantages of the invention will be apparent from the description and drawings, and from the claims.
The present invention may take physical form in certain parts and steps, embodiments of which will be described in detail in the following description and illustrated in the accompanying drawings that form a part hereof, wherein:
Aspects of the present invention are preferably implemented with computer devices and computer networks that allow users to exchange trading information. An exemplary trading network environment for implementing trading systems and methods is shown in
The trading network environment shown in
Computer device 114 is shown directly connected to exchange computer system 100. Exchange computer system 100 and computer device 114 may be connected via a T1 line, a common local area network (LAN) or other mechanism for connecting computer devices. Computer device 114 is shown connected to a radio 132. The user of radio 132 may be a trader or exchange employee. The radio user may transmit orders or other information to a user of computer device 114. The user of computer device 114 may then transmit the trade or other information to exchange computer system 100.
Computer devices 116 and 118 are coupled to a LAN 124. LAN 124 may have one or more of the well-known LAN topologies and may use a variety of different protocols, such as Ethernet. Computers 116 and 118 may communicate with each other and other computers and devices connected to LAN 124. Computers and other devices may be connected to LAN 124 via twisted pair wires, coaxial cable, fiber optics or other media. Alternatively, a wireless personal digital assistant device (PDA) 122 may communicate with LAN 124 or the Internet 126 via radio waves. PDA 122 may also communicate with exchange computer system 100 via a conventional wireless hub 128. As used herein, a PDA includes mobile telephones and other wireless devices that communicate with a network via radio waves.
One or more market makers 130 may maintain a market by providing bid and offer prices for a derivative or security to exchange computer system 100. Exchange computer system 100 may also exchange information with other trade engines, such as trade engine 138. One skilled in the art will appreciate that numerous additional computers and systems may be coupled to exchange computer system 100. Such computers and systems may include clearing, regulatory and fee systems. Coupling can be direct as described or any other method described herein.
The operations of computer devices and systems shown in
Of course, numerous additional servers, computers, handheld devices, personal digital assistants, telephones and other devices may also be connected to exchange computer system 100. Moreover, one skilled in the art will appreciate that the topology shown in
When the predetermined criteria is not met in step 204, in step 206 the minimum bid ask spread may be dynamically adjusted to meet the predetermined criteria. The adjustment to the minimum bid ask spread may be made while not adjusting the trading increment. The adjustment made in step 206 may include aggregating resting and incoming orders. For example, step 206 may include reducing a price of at least one bid order and/or increasing a price of at least one ask order. In some embodiments aggregation may be performed on the side of the market that initially has the fewest resting order quantities.
The process shown in
When the predetermined criteria is met in step 212, in step 214 the process may determine whether the original bid ask spread meets the predetermined criteria. When the original bid ask spread meets the predetermined criteria, in step 216 the process may return to the original bid ask spread. Step 216 may include undoing the aggregation of orders. In alternative embodiments, the process may check for other bid ask spread levels between the current bid ask spread level and the original bid ask spread level. After step 216 the process again waits a predetermined time period in step 210 and then returns to step 212.
When orders have been aggregated in accordance with the processes described above, in some embodiments the orders that have undergone a price change may receive priority when matching. For example, if an ask order was aggregated and had a price increase, the ask order would have priority when orders are matched at the higher price level. In some embodiments, when orders that had prices changed are matched, those matched orders may be executed at the original order price instead of the changed price. An exchange or other entity may publish the rules so that all criteria are known to traders. Traders may develop new strategies to take advantage of the potential price changes and priority matching.
In some embodiments of the invention trading increments may also be dynamically adjusted in response to various criteria. Some embodiments include adjustments to trading increments and bid ask spreads.
Various embodiments of the invention may also use an adaptive match engine which draws upon different matching algorithms, e.g. the rules which dictate how a given order should be allocated among qualifying resting orders, depending upon market conditions, to improve the operation of the market. For example, a first-in/first-out (FIFO) matching algorithm, also referred to as a “Price Time” algorithm, considers each identified order sequentially in accordance with the best price and next, when the identified order was received. The quantity of the incoming order is matched to the quantity of the identified order with the best price that was received earliest, then quantities of the orders with the same price that were received next earliest, and so on until the orders at the best price are exhausted, then the matching algorithm moves on the next best price with orders that were received earliest, and so on until the quantity of the incoming order is exhausted. Some product specifications define the use of a pro-rata matching algorithm, wherein a quantity of an incoming order is allocated to each of a plurality of identified orders proportionally in the order of best prices. Some exchange computer systems provide a priority to certain standing orders in particular markets. An example of such an order is the first order that improves a price (i.e., improves the market) for the product during a trading session. To be given priority, the trading platform may require that the quantity associated with the order is at least a minimum quantity. Further, some exchange computer systems cap the quantity of an incoming order that is allocated to a standing order on the basis of a priority for certain markets. In addition, some exchange computer systems may give a preference to orders submitted by a trader who is designated as a market maker for the product. Other exchange computer systems may use other criteria to determine whether orders submitted by a particular trader are given a preference. Typically, when the exchange computer system allocates a quantity of an incoming order to a plurality of identified orders at the same price, the trading host allocates a quantity of the incoming order to any orders that have been given priority. The exchange computer systems thereafter allocates any remaining quantity of the incoming order to orders submitted by traders designated to have a preference, and then allocates any still-remaining quantity of the incoming order using the FIFO or pro-rata algorithms. Pro-rata algorithms used in some markets may require that an allocation provided to a particular order in accordance with the pro-rata algorithm must meet at least a minimum allocation quantity. Any orders that do not meet or exceed the minimum allocation quantity are allocated to on a FIFO basis after the pro-rata allocation (if any quantity of the incoming order remains). More information regarding order allocation may be found in U.S. Pat. No. 7,853,499, the entirety of which is incorporated by reference herein.
Other examples of matching algorithms which may be defined for allocation of orders of a particular financial product include:
For example, the Price Explicit Time trading policy is based on the basic Price Time trading policy with Explicit Orders having priority over Implied Orders at the same price level. The order of traded volume allocation at a single price level may therefore be:
In Order Level Pro Rata, also referred to as Price Pro Rata, priority is given to orders at the best price (highest for a bid, lowest for an offer). If there are several orders at this best price, equal priority is given to every order at this price and incoming business is divided among these orders in proportion to their order size. The Pro Rata sequence of events is:
Order Level Priority Pro Rata, also referred to as Threshold Pro Rata, is similar to the Price (or ‘Vanilla’) Pro Rata algorithm but has a volume threshold defined. Any pro rata allocation below the threshold will be rounded down to 0. The initial pass of volume allocation is carried out in using pro rata; the second pass of volume allocation is carried out using Price Explicit Time. The Threshold Pro Rata sequence of events is:
In the Split Price Time Pro-Rata algorithms, a Price Time Percentage parameter is defined. This percentage of the matching volume at each price is allocated by the Price Explicit Time algorithm and the remainder is allocated by the Threshold Pro-Rata algorithm. There are four variants of this algorithm, with and without Priority and/or Preference. The Price Time Percentage parameter is an integer between 1 and 99. (A percentage of zero would be equivalent to using the respective existing Threshold Pro-Rata algorithm, and a percentage of 100 would be equivalent to using the respective existing Price Time algorithm). The Price Time Volume will be the residual incoming volume, after any priority and/or Preference allocation has been made, multiplied by the Price Time Percentage. Fractional parts will be rounded up, so the Price Time Volume will always be at least 1 lot and may be the entire incoming volume. The Price Time Volume is allocated to resting orders in strict time priority. Any remaining incoming volume after the Price Time Volume has been allocated will be allocated according to the respective Threshold Pro-Rata algorithm. The sequence of allocation, at each price level, is therefore:
It will be appreciated that there may be other allocation algorithms, including combinations of algorithms, now available or later developed, which may be utilized with the disclosed embodiments, and all such algorithms are contemplated herein.
Prior matching systems apply a single algorithm, or combined algorithm, to all of the orders received for a particular financial product to dictate how the entire quantity of the incoming order is to be matched/allocated. In contrast, the disclosed embodiments may apply different matching algorithms, singular or combined, to different orders, as will be described, recognizing that the allocation algorithms used by the trading host for a particular market may, for example, affect the liquidity of the market. Specifically, some allocation algorithms may encourage traders to submit more orders, where each order is relatively small, while other allocation algorithms encourage traders to submit larger orders. Other allocation algorithms may encourage a trader to use an electronic trading system that can monitor market activity and submit orders on behalf of the trader very quickly and without intervention. As markets and technologies available to traders evolve, the allocation algorithms used by trading hosts must also evolve accordingly to enhance liquidity and price discovery in markets, while maintaining a fair and equitable market.
The present invention has been described herein with reference to specific exemplary embodiments thereof. It will be apparent to those skilled in the art, that a person understanding this invention may conceive of changes or other embodiments or variations, which utilize the principles of this invention without departing from the broader spirit and scope of the invention as set forth in the appended claims. All are considered within the sphere, spirit, and scope of the invention.
