CA2332498A1 - Order matching system - Google Patents
Order matching system Download PDFInfo
- Publication number
- CA2332498A1 CA2332498A1 CA002332498A CA2332498A CA2332498A1 CA 2332498 A1 CA2332498 A1 CA 2332498A1 CA 002332498 A CA002332498 A CA 002332498A CA 2332498 A CA2332498 A CA 2332498A CA 2332498 A1 CA2332498 A1 CA 2332498A1
- Authority
- CA
- Canada
- Prior art keywords
- order
- transaction
- schedule
- user
- schedules
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/10—Tax strategies
Abstract
A order matching system which allows users to define and modify buy/sell order schedules for execution within one or more transaction destinations. The system uses order schedules and associated evaluation heuristics to evaluate and update order characteristics such as price and quantity based on user-specified criteria. The matching system comprises a user interface which can be connected over the Internet to various transaction destinations through a schedule manager and a transaction order interface. The user interface provides users with the ability to obtain information concerning the status of their order account as well as the ability to enter or modify their order schedules. The order manager uses a schedule supervisor server to maintain a database containing order schedules and order status information and to execute variable evaluations on the basis of these order schedules and associated evaluation heuristics. The order manager also uses a transaction supervisor server to monitor the status of order fills and to update the database periodically. The transaction order interface receives and communicates information messages between various transaction destinations and the schedule manager. In this way, the order matching system allows users to specify the ways that various terms and conditions at which they are willing to transact may change over time in an automated fashion while still retaining the ability to intervene at any time.
Description
Title: ORDER MATCHING SYSTEM
FIELD OF THE INVENTION
This invention relates generally to computer based trading and auction systems, and more particularly to an improved order matching system.
BACKGROUND OF THE INVENTION
Traders and investors in securities, commodities and other items send their buy and sell orders to centralized exchanges seeking the best combination of publicly disclosed price and depth of liquidity.
However, liquidity in many markets appears sporadically due to the fact that buy orders and sell orders do nat necessarily arrive at the same times, which causes prices to fluctuate in an ongoing search for price-liquidity equilibrium. Also, any sizable order arriving in a centralized market has the potential to change the equilibrium by indicating to participants the presence of a new contender for liquidity and as a result it motivates participants to change their order prices.
Participants who attempt to find liquidity in such an environment tend to use multiple liquidity destinations. Liquidity destinations are generally defined as any kind of transaction marketplaces such as "upstairs" block trading desks, security exchanges, auction forums, and electronic communication networks. Participants also divide their orders over time and by destination into smaller sized pieces to disguise their true size.
Order matching systems are currently offered by various 25_ companies and exchanges in association with trading of various trading and financial related instruments to overcome this type of inherent phenomenon in centralized financial securities markets. O r d er matching systems manage buy/sell orders to find the best combination . , of publicly disclosed price and depth of liquidity.
Order matching systems collect buy and sell orders without disclosing to the marketplace the price, quantity, or type in order to avoid impacting the price in the marketplace. As a consequence, numerous Iarge orders can be entered into an order matching system without fear of degrading price performance. One disadvantage inherent in order matching systems is that orders may be committed to a destination that does not happen to attract the appropriate liquidity at the right moment, while liquidity is available at other destinations.
Further, the increasing number of exchange destinations reduces the prospects of success in the search for liquidity.
One example of an order matching system is Instinet, owned by Reuters which operates an electronic trading system that allows parties to enter bids and offers electronically in an anonymous fashion as an alternative to the direct human-to-human negotiation of orders in the upstairs market or on the trading floors. Instinet subscribers can respond to an "order" entered into the system either by matching a displayed price or by making a counter bid or offer that is transmitted electronically to the counterparties. Instinet executes matches on a periodic basis, anywhere from several times a day to hourly, after which the order is cancelled or carried forward to the next match.
Another automated trading system is disclosed in U.S.
Patent No. 4,674,044 (Kalmus et al.), owned by Merrill Lynch. This system matches security buy/sell orders. Orders are qualified for execution by comparing the specifics of an order against predetermined stored parameters including the operative bid and asked prices, the amount of stock available for customer purchase or sale, and maximum single order size. Once qualified, the order is executed and the appropriate parameters updated.
The Optimark system owned by OptiMark Technologies, Inc.
as described in U.S. Patent No. 5,845,266 to Lupien et al. performs continuous matching by cycling through the order book every minute or two. This system allows participants to enter satisfaction density profiles for each order which can incorporate factors such as price, quantity, eligibility and urgency which can be associated with order satisfaction profiles as a whole or with each individual profile coordinate value.
The use of such automated systems within the financial instrument marketplace has increased the proliferation of liquidity destinations. This in turn has actually made the job of those i0 responsible for executing transactions more labour intensive and time consuming as increased monitoring time is required to utilize these alternatives to the regular centralized exchanges. For example, traders are typically given a quantity and a price range in which they are expected to transact as well as a time frame in which to accomplish this.
As a result, there is a tendency for traders to executing trades, while maintaining within the user imposed price and quantity ranges, at less desirable order prices and quantities as the user imposed deadline for trading approaches.
Accordingly, there is a need for a order matching system which efficiently manages orders for users between different liquidity destinations, which provides users with the ability to enter orders that reflect their specific order preferences over a wide set of market and external criteria, which allows users to specify in advance how order characteristics should be determined during the course of trading, and which minimizes the monitoring time requirements associated with the execution of order transactions.
SUMMARY OF THE PRESENT INVENTION
It is therefore an object of the present invention to a method of matching orders for a. user according to an evaluation heuristic, comprising:
FIELD OF THE INVENTION
This invention relates generally to computer based trading and auction systems, and more particularly to an improved order matching system.
BACKGROUND OF THE INVENTION
Traders and investors in securities, commodities and other items send their buy and sell orders to centralized exchanges seeking the best combination of publicly disclosed price and depth of liquidity.
However, liquidity in many markets appears sporadically due to the fact that buy orders and sell orders do nat necessarily arrive at the same times, which causes prices to fluctuate in an ongoing search for price-liquidity equilibrium. Also, any sizable order arriving in a centralized market has the potential to change the equilibrium by indicating to participants the presence of a new contender for liquidity and as a result it motivates participants to change their order prices.
Participants who attempt to find liquidity in such an environment tend to use multiple liquidity destinations. Liquidity destinations are generally defined as any kind of transaction marketplaces such as "upstairs" block trading desks, security exchanges, auction forums, and electronic communication networks. Participants also divide their orders over time and by destination into smaller sized pieces to disguise their true size.
Order matching systems are currently offered by various 25_ companies and exchanges in association with trading of various trading and financial related instruments to overcome this type of inherent phenomenon in centralized financial securities markets. O r d er matching systems manage buy/sell orders to find the best combination . , of publicly disclosed price and depth of liquidity.
Order matching systems collect buy and sell orders without disclosing to the marketplace the price, quantity, or type in order to avoid impacting the price in the marketplace. As a consequence, numerous Iarge orders can be entered into an order matching system without fear of degrading price performance. One disadvantage inherent in order matching systems is that orders may be committed to a destination that does not happen to attract the appropriate liquidity at the right moment, while liquidity is available at other destinations.
Further, the increasing number of exchange destinations reduces the prospects of success in the search for liquidity.
One example of an order matching system is Instinet, owned by Reuters which operates an electronic trading system that allows parties to enter bids and offers electronically in an anonymous fashion as an alternative to the direct human-to-human negotiation of orders in the upstairs market or on the trading floors. Instinet subscribers can respond to an "order" entered into the system either by matching a displayed price or by making a counter bid or offer that is transmitted electronically to the counterparties. Instinet executes matches on a periodic basis, anywhere from several times a day to hourly, after which the order is cancelled or carried forward to the next match.
Another automated trading system is disclosed in U.S.
Patent No. 4,674,044 (Kalmus et al.), owned by Merrill Lynch. This system matches security buy/sell orders. Orders are qualified for execution by comparing the specifics of an order against predetermined stored parameters including the operative bid and asked prices, the amount of stock available for customer purchase or sale, and maximum single order size. Once qualified, the order is executed and the appropriate parameters updated.
The Optimark system owned by OptiMark Technologies, Inc.
as described in U.S. Patent No. 5,845,266 to Lupien et al. performs continuous matching by cycling through the order book every minute or two. This system allows participants to enter satisfaction density profiles for each order which can incorporate factors such as price, quantity, eligibility and urgency which can be associated with order satisfaction profiles as a whole or with each individual profile coordinate value.
The use of such automated systems within the financial instrument marketplace has increased the proliferation of liquidity destinations. This in turn has actually made the job of those i0 responsible for executing transactions more labour intensive and time consuming as increased monitoring time is required to utilize these alternatives to the regular centralized exchanges. For example, traders are typically given a quantity and a price range in which they are expected to transact as well as a time frame in which to accomplish this.
As a result, there is a tendency for traders to executing trades, while maintaining within the user imposed price and quantity ranges, at less desirable order prices and quantities as the user imposed deadline for trading approaches.
Accordingly, there is a need for a order matching system which efficiently manages orders for users between different liquidity destinations, which provides users with the ability to enter orders that reflect their specific order preferences over a wide set of market and external criteria, which allows users to specify in advance how order characteristics should be determined during the course of trading, and which minimizes the monitoring time requirements associated with the execution of order transactions.
SUMMARY OF THE PRESENT INVENTION
It is therefore an object of the present invention to a method of matching orders for a. user according to an evaluation heuristic, comprising:
a) selecting an evaluation heuristic;
b) scheduling a time to execute the selected evaluation heuristic;
c) executing the selected evaluation heuristic;
d) creating an order message for communication to a transaction destination if the selected evaluation heuristic matches the order; and e) repeating steps a) through d) until the order is fulfilled.
In a second aspect, the present invention provides an order matching system for matching orders by a user by computer according to an evaluation heuristic, comprising:
a) a user interface for selecting the evaluation heuristic;
b) a user interface for scheduling execution of the selected evaluation heuristic;
c) a computer program for executing the selected evaluation heuristic at the scheduled time; and d) a communications network coupled to the computer program for creating an order message to be dispatched to a transaction destination if the selected evaluation heuristic matches the order.
In a third aspect, the present invention provides an order schedule for use in an order matching system that creates an order message for communication to a transaction destination upon matching an order to evaluation heuristics selected by a user, the order schedule comprising:
a) a user interface that allows for the selecting of the evaluation heuristic; and b) . a user interface for creating a schedule to execute the evaluation heuristic.
BRIEF DESCRIPTION OF THE DRAWING FIGURES
For a better understanding of the present invention and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, which show a preferred embodiment of the present invention and in which:
Fig. 1 is a schematic drawing of a preferred embodiment of the present invention;
Fig. 2 is a more detailed schematic drawing of the basic hardware and software components of the embodiment of the present invention shown in Fig. 1;
Fig. 3 is a sample screen showing a user specified order schedule as displayed by the user interface of Fig. 1;
Fig. 4A is a flow chart diagram illustrating one embodiment of the process steps taken by the user applet of Fig. 1 to communicate order and schedule related information between the user and the order manager of Fig. 1;
Fig. 4B is a flow chart diagram illustrating one embodiment of the process steps taken used by the order manager of Fig. 1 to monitor and update the order schedules;
Fig. 4C is a flow chart diagram illustrating one embodiment of the process steps taken by the exchange order interface of Fig. 1 to receive and translate order messages between the transaction destinations and the order manager;
Fig. 5A is a schematic drawing of an alternative embodiment of the order matching system of Fig. 1; and Fig. 5B is a schematic drawing of an alternative embodiment of the order matching system of Fig. 1.
DESCRIPTION OF THE PREFERRED EMBODIMENT
b) scheduling a time to execute the selected evaluation heuristic;
c) executing the selected evaluation heuristic;
d) creating an order message for communication to a transaction destination if the selected evaluation heuristic matches the order; and e) repeating steps a) through d) until the order is fulfilled.
In a second aspect, the present invention provides an order matching system for matching orders by a user by computer according to an evaluation heuristic, comprising:
a) a user interface for selecting the evaluation heuristic;
b) a user interface for scheduling execution of the selected evaluation heuristic;
c) a computer program for executing the selected evaluation heuristic at the scheduled time; and d) a communications network coupled to the computer program for creating an order message to be dispatched to a transaction destination if the selected evaluation heuristic matches the order.
In a third aspect, the present invention provides an order schedule for use in an order matching system that creates an order message for communication to a transaction destination upon matching an order to evaluation heuristics selected by a user, the order schedule comprising:
a) a user interface that allows for the selecting of the evaluation heuristic; and b) . a user interface for creating a schedule to execute the evaluation heuristic.
BRIEF DESCRIPTION OF THE DRAWING FIGURES
For a better understanding of the present invention and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, which show a preferred embodiment of the present invention and in which:
Fig. 1 is a schematic drawing of a preferred embodiment of the present invention;
Fig. 2 is a more detailed schematic drawing of the basic hardware and software components of the embodiment of the present invention shown in Fig. 1;
Fig. 3 is a sample screen showing a user specified order schedule as displayed by the user interface of Fig. 1;
Fig. 4A is a flow chart diagram illustrating one embodiment of the process steps taken by the user applet of Fig. 1 to communicate order and schedule related information between the user and the order manager of Fig. 1;
Fig. 4B is a flow chart diagram illustrating one embodiment of the process steps taken used by the order manager of Fig. 1 to monitor and update the order schedules;
Fig. 4C is a flow chart diagram illustrating one embodiment of the process steps taken by the exchange order interface of Fig. 1 to receive and translate order messages between the transaction destinations and the order manager;
Fig. 5A is a schematic drawing of an alternative embodiment of the order matching system of Fig. 1; and Fig. 5B is a schematic drawing of an alternative embodiment of the order matching system of Fig. 1.
DESCRIPTION OF THE PREFERRED EMBODIMENT
Reference is first made to Fig. 1, which shows an order matching system 10 made in accordance with a. preferred embodiment of the invention. System 10 allows users to engage in transactions by defining order schedules and associated evaluation heuristics for execution within transaction destinations 12. The term transaction should be understood not be limited to security transactions, but can also include auction transactions as well as any other type of conventionally recognized market transaction (e.g. airline ticket bookings). Accordingly, the term transaction destination should not be limited to only security markets but can include auction destinations as.
well as any other general liquidity destination. The order schedule allows a user to specify various buy/sell instructions as a function of user selected criteria and/or variables. System 10 comprises a user interface 14 which can be connected over the Internet 15 to the transaction destinations 12 through a schedule manager 16, and a transaction order interface 18.
User interface 14 provides users with the ability to obtain information concerning the status of their order account as well as with the ability to enter or modify their order schedules. Specifically, a user will connect through user interface 14 to a web server which hosts schedule manager 16. User interface 14 is implemented by a conventionally known browser based applet on a communications system based on direct socket connections. Preferably the applet is implemented in the Java programming environment, to maximize compatibility with transaction destination 12 and web browser versions. The network protocol for the socket communication can be based on TCP/IP and security and any communication firewalls can be provided using Secure Socket Layer (SSL) as is conventionally known.
Fig. 2 shows a more detailed view of order manager I6 of system 10. Order manager 16 is implemented using a conventional distributed server architecture which comprises a domain firewall server 30, a database server 32, a web server 34, a transaction supervisor server 36, and a schedule supervisor server 38. All of these servers are run using a conventional operating system such as Windows NT. Web server 34 utilizes Internet Information Server and database server 32 is implemented in Microsoft SQL 7.0 running on a Pentium III machine.
While it is preferred to use a distributed server architecture to implement order manager 16 for efficient allocation of operations on different servers to handle high traffic volume, it should be understood that it would also be possible to implement all operations of order manager 16 -using a single server. The transaction supervisor server 36 contains a monitoring program which is based on CORBA's Object Transaction Service supported by ORBS (Object Request Broker).
Security can be provided at the browser level using either the trust/no trust approach of Java 1.1 or the fine grained approach of Java 1.2 as is conventionally known.
Transaction order interface 18 receives and communicates information messages between transaction destinations 12 and schedule manager 16. Transaction order interface 18 can be implemented in the Java programming language and runs on its own server. Transaction order interface 18 maintains a table of messages which are received from transaction destinations 12 and order manager 16 for translation purposes. Transaction order interface 18 accepts messages from one or more transaction destinations 12 and continuously translates them into messages that schedule manager 16 can process and retransmit them to order manager 16.
Accordingly, the applet running on the user's web browser (i.e. user interface 14) sends messages to and queries information from schedule manager 16 which is implemented on a dedicated web site.
This dedicated web site in turn communicates with transaction destinations 12 using an established messaging protocol through transaction order interface 18. In this way, the user may communicate and transact with many different transaction destinations 12 via system implemented on a dedicated web site. The user only needs to periodically connect to the dedicated web site to enter, modify and cancel schedules or to update the status of orders and obtain details 5 completed transactions.
Fig. 3 shows a sample user screen with a representation of a user order schedule 39. The order schedule 39 has the form of a two dimensional graph with the horizontal axis denoting time. A number of order characteristic plots are shown extending horizontally across the IO order schedule, each of which identifies a specific order characteristic.
For example, the "Orderl5 PriceChangel" plot .represents a user entered evaluation schedule for the order characteristic of price associated with Order 15.
It should be understood that users may have several order schedules co-pending. For example, one order may be a conventional security order which is based on conventional price and quantity order characteristics, another which may be an auction order which is based on auction related criterion such as an auction offer price, and a third which is based on price and destination criterion only. System 10 can handle many different types and permutations of order characteristics including a variety of transaction destinations I2. For example, a user can schedule sending orders for selling oil while scheduling sending orders for buying securities. System 10 offers users flexibility in choosing exactly what order characteristics they wish to be evaluated for purposes of concluding a transaction using a full range of order characteristics or criteria (i.e. price, quantity, destination, etc.) The markers on each order characteristic plot, indicates when that particular order characteristic is to be evaluated by schedule manager 16, according to a user-selected evaluation heuristic. It should be understood that each marker could be independently associated with a distinct user-selected evaluation heuristic, although for discussion purposes each order characteristic plot will be assumed to be associated with a single evaluation heuristic. The markers on the "Orderl5 PriceChangel" plot each represent when the user-specified heuristic (i.e. a heuristic used to change order price) associated with that plot is to be executed.
In reference to Figs. 1 to 3, when an evaluation heuristic is executed by order manager 16, the results are entered into database server 32. If the evaluation heuristic is fulfilled, then on the subsequent query of the database server 32 by schedule supervisor server 38, an order message will be communicated to the appropriate transaction destination 12 through transaction order interface 18.
It is possible to have two plots (Fig. 3} running at the same time, each indicating when a different evaluation heuristic is to be executed for a certain order characteristic (i.e. price or quantity). For example, the "Orderl5PriceChangel" and "Orderl5 PriceChange2" plots can be run together each triggering their own evaluation heuristics at the indicated marked times. System 10 can be designed so that if a time conflict occurs between two plots, the most recently entered plot prevails (i.e. the heuristic associated with the plot entered last by the user is evaluated).
In addition, transaction supervisor server 36 monitors orders that allow partial completion and adjusts orders within database server 32 by the amount transacted so that future scheduled adjustments operate on the remaining order quantity. For example, if 400 tons of rice out of 1000 tons originally entered have been purchased, then 600 tons will remain in the buy order stored in database server 32.
As previously discussed, other order specifications within order schedule 39 can include the destination of the order, the treatment of a reduction in quantity either as a cancel/replace or as a modification of the former order (depending on the accepted queuing protocol of the transaction destination 12}, and the rating of a counterparty as a criteria for accepting or rejecting a possible match where such information is disclosed by the transaction destination 12.
The sample order schedule 39 of Fig. 3 can be defined and manipulated by the user through the browser-based applet running at user interface 14. Order schedules 39 can be communicated by web server 32 through firewall server 30 to schedule supervisor server 38.
This communication message is recognized by schedule superior server 38 as a database event and the transaction is stored by database server 32 and the list of order schedules to monitor is updated.
During. general operation of system 10, schedule superior server 38 picks out order schedules 39 from database server 32 that need to be re-evaluated based on their time criteria (as defined within each order schedule 39 as previously explained), and processes each by determining the action to be taken and using a user pre-specified methodology to calculate the order characteristics to be entered or changed. The results are provided to database server 32 (i.e. any order modifications and new orders) and a message is sent to transaction order interface 18 to initiate, cancel or modify an order, if necessary.
The transaction supervisor server 36 identifies messages that are returned from transaction destinations 12 through transaction order interface 18. These messages provide details on the status of orders, specifically whether the order has been received, if it has been accepted, if it has been filled in part or in total, and data on the exchange environment (i.e. whether systems are functioning properly and if communications are still possible between the systems). Other messages include data produced by the transaction destinations 12 such as general information on other transactions that have been matched, or aggregate information on transaction information on transactions (i.e. transaction destinations 12 can also act as a data source for system 10).
Referring to Figs. 1, 2 and 4A, the flow chart diagram (Fig.
4A) shows some of the steps of the routine used by the user applet of Fig. 1 to communicate order and schedule related information between the user interface 14 and order manager 16. For example, at step 100 user interface 14 is initiated by user using a prearranged login and password. At step 102, user interface 14 displays main page, current order information and a listing of existing order schedules for the user.
At step I04, if the user wishes to modify or create an order schedule, user interface 14 will provide interactive menus to allow the user to enter the appropriate information and/or changes to existing order schedules. At step 108, user interface 14 sends the information to order manager 16 so that the user order schedules can be properly recorded in the database server 32.
Referring to Figs. l, 2, and 4B, the flow chart diagram (Fig.
4B) illustrates one embodiment of the routine used by the order manager of Fig. 1 to monitor and update the order schedules.
Specifically, at step 110, a timer loop is shown which is used to clock both the activity of the schedule supervisor server 38 as well as the transaction supervisor server 36.
The schedule supervisor server 38 implements steps 102 to 116 as follows. At step 102, schedule supervisor server 38 queries database server 32 for a list of orders whose schedules qualify for evaluation according to the stored list of order schedules. At step 104, the various orders are evaluated in turn within an assessment loop until all of the orders have been evaluated. The evaluation loop begins with step 106 where a qualifying order is selected.
At step 108 the qualifying order schedule is selected for that order and at step 110 all the associated plots listed in the schedule are evaluated according to the evaluation heuristics associated with each marker, as discussed above. As previously discussed, for simplicity, each order plot is associated with a single evaluation heuristic, although it would also be possible to associate a separate evaluation heuristic with each individual marker within a piot. At step 112, the results of the evaluation are written into a changes array (i.e. temporary storage), including order modifications and new orders that have been generated due to changing variables. This loop is repeated until all qualifying orders have been processed as discussed above.
At step 114, all the values stored in the changes array are written to database server 32. Finally at step 116, order modifications, order cancellations and orders activations are sent to transaction destinations 12 through transaction order interface 18,- as explained above.
The transaction supervisor server 36 of order manager 16 monitors the state of orders which are sent from transaction destinations 12 through transaction order interface 18 to database server 32 in steps 118 and 120. At step 118, transaction supervisor server 36 queries database server 32 for messages relating to completed transactions, partial fills, rejections and accepted order messages. At step 120, transaction supervisor server 36 recalculates outstanding orders, partially completed orders and completed orders and sends the updated results to database server 32. Other information such as whether various exchange systems are functioning properly and whether communication links are active can also be monitored and used by system 10 to efficiently process orders with available transaction destinations 12.
Referring to Figs. 1, 2 and 4C, the flow chart diagram (Fig. 4C) illustrating one embodiment of the process used by the transaction order interface 18 of Fig. 1 to receive and translate order messages between the transaction destinations and the order manager. At step 130, transaction order interface 18 receives order messages from order manager 16 or transaction destination 12. At step 132, if the message from transaction destination 12 then at step I34, the message is identified and translated and provided at step 136 to order manager 16.
Otherwise, the order message is translated at step 138 into a form which can be processed by the transaction destination 12 at step 140.
Referring generally to Figs. 1 to 4C, as previously discussed, a user-selected heuristic is evaluated at each marker point on particular order characteristic plot for an order schedule 39. It should be understood that a wide range of different types of evaluation heuristics can be preselected for execution and can include information that is known within system 10 (e.g. prior price of an order), information that is known within the transaction destination 12 (e.g. prior trade of the same type of item on the same exchange system), as well as other external data sources (e.g. interest rates). Typically, each methodology uses one or several datafeed inputs (from external information sources such as weather stations or the like), one or more weights, and one or more user specific spread quantities.
One example evaluation heuristic which would be executed to implement a static table of prices at which a user was willing to sell over a period of time, with each amount being initiated at different points on the schedule. This evaluation heuristic would be useful for a user who wishes to set the price of a plant growth enzyme at progressively higher prices each week of the growing season.
Another example evaluation heuristic could be where the offer price or quantity is derived by multiplying a predetermined weight W 1 by an generalized index value. A generalized index value can be provided by a preselected data source for a particular item in a particular field of operation, which can be represented by index (datasource, item, field). That is, the evaluation heuristic could evaluate the relation:
W 1 * index (datasource, item, field) For example, if a user wished to sell 50 megawatts hours of electricity for five days starting at 12:OO:Olam June 8, 2001, the offer price could be calculated using the relation discussed above, where W1 is 100.17% and index (datasource, item, field) is the current bid price. Consequently, the offer price would be 100.17% of the current bid price.
Another example evaluation heuristic could be where the offer price or quantity is derived by multiplying a constant weight W1 by a generalized index value and adding the result to another constant weight W2. That is, the evaluation heuristic could evaluate the relation:
WZ + (W1 * index (datasource, item, field)) For example, an order price for 200 memory chipcards, Wintel compatible, 14 pin of 64 meg size at a price per chipcard could be calculated using the above relation where W2 is a constant dollar amount, W 1 is a certain percentage value, and index (datasource, item, field) is set to be the price of 128 meg memory chipcards, Wintel compatible, 14 pin.
Another example evaluation heuristic could be where the offer price or quantity is derived by combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
W 1 + (indexl (datasource, item, field)) + (W2 * (index2 (datasource, item, field)) * % change in index3 (datasource, item, field)) For example, an order price for one million dollars of home insurance could be derived using the above relation where W1 is $18.95, indexl(datasource, item,field) is a base home insurance rate, W2 is 1, index2 (datasource, item, field) is the price for the same product quoted a year ago, and index3 is the temperature of the ocean surface and the change of the temperature is calculated over a period of a year.
Another example evaluation heuristic could be where the offer price or quantity is derived by combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
W 1 + W2 (indexl (datasource, item, field)) + (W3 * (index2 (datasource, item, field}) * % change in index3 (datasource, item, field)) For example, an order price for one million dollars of home insurance could be derived using the above relation where W1 is $18.95, indexl(datasource, item,field) is a base home insurance rate, W2 is 95%, index2 (datasource, item, field) is the price for the same product quoted a year ago, and index3 is the temperature of the ocean surface and the change of the temperature is calculated over a period of a year and W3 is 110%.
Finally, another example evaluation heuristic wherein the offer price or quantity is derived using case based criteria combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
if condition 1 is true then calculation 1 if condition 2 is true then calculation 2 if condition 3 is true then calculation 3, where calculation 1, 2, 3 can be any of the evaluation heuristics discussed above. An example of use would be where offer loans (with same yield and same tranche sizes) but credit grade equals the prior month standard grade less one grade if total loans generated in the third quarter are less than 40 million.
These evaluation heuristics can be used to determine the specific value of an order characteristic for order price, order quantity, as well as an order satisfaction density profiles (as disclosed in U.S.
Patent No. 5,845,266 to L,upien et al.) which combines price and quantity, rule based numeric thresholds or standards, choice of transaction destination (i.e. an auction site or order matching system), segmentation of an aggregate order between multiple destinations, means of delivery, quality standards, credit standards, as well as many other conventional transaction related or financial instrument or commodity related characteristics.
In use, a user will connect to system 10 using a conventional web browser and establish a number of order schedules as well as the particular evaluation heuristics that are desired to be executed at the various marker points (i.e. at specific times) specified in the order schedule. Once the order schedules and associated evaluation heuristics are established by the user and recorded within database server 32 of schedule manager 16, system 10 will proceed to check and calculate on a timed basis according to the order schedule.
System 10 will provide users with order schedules in a steady state when all existing schedules have 'been evaluated, and all orders reassessed based on reported, completed transactions. At such a time, there will exist a potential group of unfilled buy schedules and a potential group of unfilled sell schedules for each subject instrument, but no opposite orders being concurrently active and transactable, having the same exchange system destination specified and overlapping prices.
System 10 allows users to specify the ways that various terms and conditions (i.e. specific valuations of order characteristics) at which they are willing to transact may change over time in an automated fashion while still retaining the ability to intervene at any time. The impact of such a system 10 is that users will not have to constantly adjust their orders but will be able to plan their attitudes towards the items to be transacted over time in advance using the order schedules and associated transaction evaluation heuristic. System 10 will allow users to improve their transaction satisfaction and matching results based on the criteria of time, composition of fills, relative price as well as price and quantity.
It should be understood that several different architectures can be used to implement system 10. Specifically, Fig. 5A shows an alternative implementation for system 10, whereby the user interface 14 sends messages to and queries information from transaction destinations 12 via the schedule manager 16 which is hosted on a web server associated with each transaction destination 12. In this case, schedule manager 16 operates at the web server of the transaction destination 12 according to the order schedules entered by the user through user interface 14.
Fig. 5B shows an alternative implementation for system 10, whereby the user interface 14 and schedule manager 16 are combined to run together on the user's desktop browser software. All communications are carried out with the transaction destinations 12 using a standardized messaging protocol or by integrating the transaction order interface 18 into the user's software system. In such a case, it is necessary for the user's browser to remain open in order to transmit and receive messages for controlling a.nd managing orders as stipulated by the order schedules. It should be understood that it is possible for the user to specify that various transaction destinations may be chosen to transact with.
System 10 can he easily tailored to comply with the rules of.
any specific computerized transaction systems for entering, terminating and adjusting orders. For instance, some transactions systems permit an order's quantity t~ be reduced without losing its place (priority) in the transaction system's queue, instead of cancelling and entering a revised order which process loses any priority standing. The former approach is optimal and can be accommodated by system 10 and implemented where permitted.
System IO can also easily handle "baskets" of orders. For example, if the user wishes to sell 10 used PalmPilotV's on an English/Dutch auction type web site such as eBay.com and to buy 10 new PalmPilotVII's in a collective bidding arrangement at a web site such as mercata.com, the participant would create a buy schedule for the PalmPilotVII's and a sell schedule for the PalmPilotV's and indicate that these schedules are to be linked together such that the sell bid can be automatically activated if notification is received electronically that the PalmPilotV offer has been accepted by another participant.
Such a, linking process can be accomplished by arranging a secure, encrypted message to be transmitted over the Internet from the "eBay/English or Dutch auction type" web site back to the system on the site that the user connects to. 'This notification would cause the sell schedule to be reevaluated now that it has been filled or partially filled and during this evaluation the linkage flag would initiate reevaluation of the buy order schedule. The reevaluation of the buy order schedule would initiate the buy order or part of the buy order depending on how the link is configured.
As will be apparent to those skilled in the art, various modifications and adaptations of the method and system described above are possible without departing from the present invention, the scope of which is defined in the appended claims.
well as any other general liquidity destination. The order schedule allows a user to specify various buy/sell instructions as a function of user selected criteria and/or variables. System 10 comprises a user interface 14 which can be connected over the Internet 15 to the transaction destinations 12 through a schedule manager 16, and a transaction order interface 18.
User interface 14 provides users with the ability to obtain information concerning the status of their order account as well as with the ability to enter or modify their order schedules. Specifically, a user will connect through user interface 14 to a web server which hosts schedule manager 16. User interface 14 is implemented by a conventionally known browser based applet on a communications system based on direct socket connections. Preferably the applet is implemented in the Java programming environment, to maximize compatibility with transaction destination 12 and web browser versions. The network protocol for the socket communication can be based on TCP/IP and security and any communication firewalls can be provided using Secure Socket Layer (SSL) as is conventionally known.
Fig. 2 shows a more detailed view of order manager I6 of system 10. Order manager 16 is implemented using a conventional distributed server architecture which comprises a domain firewall server 30, a database server 32, a web server 34, a transaction supervisor server 36, and a schedule supervisor server 38. All of these servers are run using a conventional operating system such as Windows NT. Web server 34 utilizes Internet Information Server and database server 32 is implemented in Microsoft SQL 7.0 running on a Pentium III machine.
While it is preferred to use a distributed server architecture to implement order manager 16 for efficient allocation of operations on different servers to handle high traffic volume, it should be understood that it would also be possible to implement all operations of order manager 16 -using a single server. The transaction supervisor server 36 contains a monitoring program which is based on CORBA's Object Transaction Service supported by ORBS (Object Request Broker).
Security can be provided at the browser level using either the trust/no trust approach of Java 1.1 or the fine grained approach of Java 1.2 as is conventionally known.
Transaction order interface 18 receives and communicates information messages between transaction destinations 12 and schedule manager 16. Transaction order interface 18 can be implemented in the Java programming language and runs on its own server. Transaction order interface 18 maintains a table of messages which are received from transaction destinations 12 and order manager 16 for translation purposes. Transaction order interface 18 accepts messages from one or more transaction destinations 12 and continuously translates them into messages that schedule manager 16 can process and retransmit them to order manager 16.
Accordingly, the applet running on the user's web browser (i.e. user interface 14) sends messages to and queries information from schedule manager 16 which is implemented on a dedicated web site.
This dedicated web site in turn communicates with transaction destinations 12 using an established messaging protocol through transaction order interface 18. In this way, the user may communicate and transact with many different transaction destinations 12 via system implemented on a dedicated web site. The user only needs to periodically connect to the dedicated web site to enter, modify and cancel schedules or to update the status of orders and obtain details 5 completed transactions.
Fig. 3 shows a sample user screen with a representation of a user order schedule 39. The order schedule 39 has the form of a two dimensional graph with the horizontal axis denoting time. A number of order characteristic plots are shown extending horizontally across the IO order schedule, each of which identifies a specific order characteristic.
For example, the "Orderl5 PriceChangel" plot .represents a user entered evaluation schedule for the order characteristic of price associated with Order 15.
It should be understood that users may have several order schedules co-pending. For example, one order may be a conventional security order which is based on conventional price and quantity order characteristics, another which may be an auction order which is based on auction related criterion such as an auction offer price, and a third which is based on price and destination criterion only. System 10 can handle many different types and permutations of order characteristics including a variety of transaction destinations I2. For example, a user can schedule sending orders for selling oil while scheduling sending orders for buying securities. System 10 offers users flexibility in choosing exactly what order characteristics they wish to be evaluated for purposes of concluding a transaction using a full range of order characteristics or criteria (i.e. price, quantity, destination, etc.) The markers on each order characteristic plot, indicates when that particular order characteristic is to be evaluated by schedule manager 16, according to a user-selected evaluation heuristic. It should be understood that each marker could be independently associated with a distinct user-selected evaluation heuristic, although for discussion purposes each order characteristic plot will be assumed to be associated with a single evaluation heuristic. The markers on the "Orderl5 PriceChangel" plot each represent when the user-specified heuristic (i.e. a heuristic used to change order price) associated with that plot is to be executed.
In reference to Figs. 1 to 3, when an evaluation heuristic is executed by order manager 16, the results are entered into database server 32. If the evaluation heuristic is fulfilled, then on the subsequent query of the database server 32 by schedule supervisor server 38, an order message will be communicated to the appropriate transaction destination 12 through transaction order interface 18.
It is possible to have two plots (Fig. 3} running at the same time, each indicating when a different evaluation heuristic is to be executed for a certain order characteristic (i.e. price or quantity). For example, the "Orderl5PriceChangel" and "Orderl5 PriceChange2" plots can be run together each triggering their own evaluation heuristics at the indicated marked times. System 10 can be designed so that if a time conflict occurs between two plots, the most recently entered plot prevails (i.e. the heuristic associated with the plot entered last by the user is evaluated).
In addition, transaction supervisor server 36 monitors orders that allow partial completion and adjusts orders within database server 32 by the amount transacted so that future scheduled adjustments operate on the remaining order quantity. For example, if 400 tons of rice out of 1000 tons originally entered have been purchased, then 600 tons will remain in the buy order stored in database server 32.
As previously discussed, other order specifications within order schedule 39 can include the destination of the order, the treatment of a reduction in quantity either as a cancel/replace or as a modification of the former order (depending on the accepted queuing protocol of the transaction destination 12}, and the rating of a counterparty as a criteria for accepting or rejecting a possible match where such information is disclosed by the transaction destination 12.
The sample order schedule 39 of Fig. 3 can be defined and manipulated by the user through the browser-based applet running at user interface 14. Order schedules 39 can be communicated by web server 32 through firewall server 30 to schedule supervisor server 38.
This communication message is recognized by schedule superior server 38 as a database event and the transaction is stored by database server 32 and the list of order schedules to monitor is updated.
During. general operation of system 10, schedule superior server 38 picks out order schedules 39 from database server 32 that need to be re-evaluated based on their time criteria (as defined within each order schedule 39 as previously explained), and processes each by determining the action to be taken and using a user pre-specified methodology to calculate the order characteristics to be entered or changed. The results are provided to database server 32 (i.e. any order modifications and new orders) and a message is sent to transaction order interface 18 to initiate, cancel or modify an order, if necessary.
The transaction supervisor server 36 identifies messages that are returned from transaction destinations 12 through transaction order interface 18. These messages provide details on the status of orders, specifically whether the order has been received, if it has been accepted, if it has been filled in part or in total, and data on the exchange environment (i.e. whether systems are functioning properly and if communications are still possible between the systems). Other messages include data produced by the transaction destinations 12 such as general information on other transactions that have been matched, or aggregate information on transaction information on transactions (i.e. transaction destinations 12 can also act as a data source for system 10).
Referring to Figs. 1, 2 and 4A, the flow chart diagram (Fig.
4A) shows some of the steps of the routine used by the user applet of Fig. 1 to communicate order and schedule related information between the user interface 14 and order manager 16. For example, at step 100 user interface 14 is initiated by user using a prearranged login and password. At step 102, user interface 14 displays main page, current order information and a listing of existing order schedules for the user.
At step I04, if the user wishes to modify or create an order schedule, user interface 14 will provide interactive menus to allow the user to enter the appropriate information and/or changes to existing order schedules. At step 108, user interface 14 sends the information to order manager 16 so that the user order schedules can be properly recorded in the database server 32.
Referring to Figs. l, 2, and 4B, the flow chart diagram (Fig.
4B) illustrates one embodiment of the routine used by the order manager of Fig. 1 to monitor and update the order schedules.
Specifically, at step 110, a timer loop is shown which is used to clock both the activity of the schedule supervisor server 38 as well as the transaction supervisor server 36.
The schedule supervisor server 38 implements steps 102 to 116 as follows. At step 102, schedule supervisor server 38 queries database server 32 for a list of orders whose schedules qualify for evaluation according to the stored list of order schedules. At step 104, the various orders are evaluated in turn within an assessment loop until all of the orders have been evaluated. The evaluation loop begins with step 106 where a qualifying order is selected.
At step 108 the qualifying order schedule is selected for that order and at step 110 all the associated plots listed in the schedule are evaluated according to the evaluation heuristics associated with each marker, as discussed above. As previously discussed, for simplicity, each order plot is associated with a single evaluation heuristic, although it would also be possible to associate a separate evaluation heuristic with each individual marker within a piot. At step 112, the results of the evaluation are written into a changes array (i.e. temporary storage), including order modifications and new orders that have been generated due to changing variables. This loop is repeated until all qualifying orders have been processed as discussed above.
At step 114, all the values stored in the changes array are written to database server 32. Finally at step 116, order modifications, order cancellations and orders activations are sent to transaction destinations 12 through transaction order interface 18,- as explained above.
The transaction supervisor server 36 of order manager 16 monitors the state of orders which are sent from transaction destinations 12 through transaction order interface 18 to database server 32 in steps 118 and 120. At step 118, transaction supervisor server 36 queries database server 32 for messages relating to completed transactions, partial fills, rejections and accepted order messages. At step 120, transaction supervisor server 36 recalculates outstanding orders, partially completed orders and completed orders and sends the updated results to database server 32. Other information such as whether various exchange systems are functioning properly and whether communication links are active can also be monitored and used by system 10 to efficiently process orders with available transaction destinations 12.
Referring to Figs. 1, 2 and 4C, the flow chart diagram (Fig. 4C) illustrating one embodiment of the process used by the transaction order interface 18 of Fig. 1 to receive and translate order messages between the transaction destinations and the order manager. At step 130, transaction order interface 18 receives order messages from order manager 16 or transaction destination 12. At step 132, if the message from transaction destination 12 then at step I34, the message is identified and translated and provided at step 136 to order manager 16.
Otherwise, the order message is translated at step 138 into a form which can be processed by the transaction destination 12 at step 140.
Referring generally to Figs. 1 to 4C, as previously discussed, a user-selected heuristic is evaluated at each marker point on particular order characteristic plot for an order schedule 39. It should be understood that a wide range of different types of evaluation heuristics can be preselected for execution and can include information that is known within system 10 (e.g. prior price of an order), information that is known within the transaction destination 12 (e.g. prior trade of the same type of item on the same exchange system), as well as other external data sources (e.g. interest rates). Typically, each methodology uses one or several datafeed inputs (from external information sources such as weather stations or the like), one or more weights, and one or more user specific spread quantities.
One example evaluation heuristic which would be executed to implement a static table of prices at which a user was willing to sell over a period of time, with each amount being initiated at different points on the schedule. This evaluation heuristic would be useful for a user who wishes to set the price of a plant growth enzyme at progressively higher prices each week of the growing season.
Another example evaluation heuristic could be where the offer price or quantity is derived by multiplying a predetermined weight W 1 by an generalized index value. A generalized index value can be provided by a preselected data source for a particular item in a particular field of operation, which can be represented by index (datasource, item, field). That is, the evaluation heuristic could evaluate the relation:
W 1 * index (datasource, item, field) For example, if a user wished to sell 50 megawatts hours of electricity for five days starting at 12:OO:Olam June 8, 2001, the offer price could be calculated using the relation discussed above, where W1 is 100.17% and index (datasource, item, field) is the current bid price. Consequently, the offer price would be 100.17% of the current bid price.
Another example evaluation heuristic could be where the offer price or quantity is derived by multiplying a constant weight W1 by a generalized index value and adding the result to another constant weight W2. That is, the evaluation heuristic could evaluate the relation:
WZ + (W1 * index (datasource, item, field)) For example, an order price for 200 memory chipcards, Wintel compatible, 14 pin of 64 meg size at a price per chipcard could be calculated using the above relation where W2 is a constant dollar amount, W 1 is a certain percentage value, and index (datasource, item, field) is set to be the price of 128 meg memory chipcards, Wintel compatible, 14 pin.
Another example evaluation heuristic could be where the offer price or quantity is derived by combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
W 1 + (indexl (datasource, item, field)) + (W2 * (index2 (datasource, item, field)) * % change in index3 (datasource, item, field)) For example, an order price for one million dollars of home insurance could be derived using the above relation where W1 is $18.95, indexl(datasource, item,field) is a base home insurance rate, W2 is 1, index2 (datasource, item, field) is the price for the same product quoted a year ago, and index3 is the temperature of the ocean surface and the change of the temperature is calculated over a period of a year.
Another example evaluation heuristic could be where the offer price or quantity is derived by combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
W 1 + W2 (indexl (datasource, item, field)) + (W3 * (index2 (datasource, item, field}) * % change in index3 (datasource, item, field)) For example, an order price for one million dollars of home insurance could be derived using the above relation where W1 is $18.95, indexl(datasource, item,field) is a base home insurance rate, W2 is 95%, index2 (datasource, item, field) is the price for the same product quoted a year ago, and index3 is the temperature of the ocean surface and the change of the temperature is calculated over a period of a year and W3 is 110%.
Finally, another example evaluation heuristic wherein the offer price or quantity is derived using case based criteria combining a number of constant values with a number of generalized indexes. For example, the evaluation heuristic could evaluate the relation:
if condition 1 is true then calculation 1 if condition 2 is true then calculation 2 if condition 3 is true then calculation 3, where calculation 1, 2, 3 can be any of the evaluation heuristics discussed above. An example of use would be where offer loans (with same yield and same tranche sizes) but credit grade equals the prior month standard grade less one grade if total loans generated in the third quarter are less than 40 million.
These evaluation heuristics can be used to determine the specific value of an order characteristic for order price, order quantity, as well as an order satisfaction density profiles (as disclosed in U.S.
Patent No. 5,845,266 to L,upien et al.) which combines price and quantity, rule based numeric thresholds or standards, choice of transaction destination (i.e. an auction site or order matching system), segmentation of an aggregate order between multiple destinations, means of delivery, quality standards, credit standards, as well as many other conventional transaction related or financial instrument or commodity related characteristics.
In use, a user will connect to system 10 using a conventional web browser and establish a number of order schedules as well as the particular evaluation heuristics that are desired to be executed at the various marker points (i.e. at specific times) specified in the order schedule. Once the order schedules and associated evaluation heuristics are established by the user and recorded within database server 32 of schedule manager 16, system 10 will proceed to check and calculate on a timed basis according to the order schedule.
System 10 will provide users with order schedules in a steady state when all existing schedules have 'been evaluated, and all orders reassessed based on reported, completed transactions. At such a time, there will exist a potential group of unfilled buy schedules and a potential group of unfilled sell schedules for each subject instrument, but no opposite orders being concurrently active and transactable, having the same exchange system destination specified and overlapping prices.
System 10 allows users to specify the ways that various terms and conditions (i.e. specific valuations of order characteristics) at which they are willing to transact may change over time in an automated fashion while still retaining the ability to intervene at any time. The impact of such a system 10 is that users will not have to constantly adjust their orders but will be able to plan their attitudes towards the items to be transacted over time in advance using the order schedules and associated transaction evaluation heuristic. System 10 will allow users to improve their transaction satisfaction and matching results based on the criteria of time, composition of fills, relative price as well as price and quantity.
It should be understood that several different architectures can be used to implement system 10. Specifically, Fig. 5A shows an alternative implementation for system 10, whereby the user interface 14 sends messages to and queries information from transaction destinations 12 via the schedule manager 16 which is hosted on a web server associated with each transaction destination 12. In this case, schedule manager 16 operates at the web server of the transaction destination 12 according to the order schedules entered by the user through user interface 14.
Fig. 5B shows an alternative implementation for system 10, whereby the user interface 14 and schedule manager 16 are combined to run together on the user's desktop browser software. All communications are carried out with the transaction destinations 12 using a standardized messaging protocol or by integrating the transaction order interface 18 into the user's software system. In such a case, it is necessary for the user's browser to remain open in order to transmit and receive messages for controlling a.nd managing orders as stipulated by the order schedules. It should be understood that it is possible for the user to specify that various transaction destinations may be chosen to transact with.
System 10 can he easily tailored to comply with the rules of.
any specific computerized transaction systems for entering, terminating and adjusting orders. For instance, some transactions systems permit an order's quantity t~ be reduced without losing its place (priority) in the transaction system's queue, instead of cancelling and entering a revised order which process loses any priority standing. The former approach is optimal and can be accommodated by system 10 and implemented where permitted.
System IO can also easily handle "baskets" of orders. For example, if the user wishes to sell 10 used PalmPilotV's on an English/Dutch auction type web site such as eBay.com and to buy 10 new PalmPilotVII's in a collective bidding arrangement at a web site such as mercata.com, the participant would create a buy schedule for the PalmPilotVII's and a sell schedule for the PalmPilotV's and indicate that these schedules are to be linked together such that the sell bid can be automatically activated if notification is received electronically that the PalmPilotV offer has been accepted by another participant.
Such a, linking process can be accomplished by arranging a secure, encrypted message to be transmitted over the Internet from the "eBay/English or Dutch auction type" web site back to the system on the site that the user connects to. 'This notification would cause the sell schedule to be reevaluated now that it has been filled or partially filled and during this evaluation the linkage flag would initiate reevaluation of the buy order schedule. The reevaluation of the buy order schedule would initiate the buy order or part of the buy order depending on how the link is configured.
As will be apparent to those skilled in the art, various modifications and adaptations of the method and system described above are possible without departing from the present invention, the scope of which is defined in the appended claims.
Claims (3)
1. A method of matching orders for a user according to an evaluation heuristic, comprising:
a) selecting an evaluation heuristic;
b) scheduling a time to execute the selected evaluation heuristic;
c) executing the selected evaluation heuristic;
d) creating an order message for communication to a transaction destination if the selected evaluation heuristic matches the order; and e) repeating steps a) through d) until the order is fulfilled.
a) selecting an evaluation heuristic;
b) scheduling a time to execute the selected evaluation heuristic;
c) executing the selected evaluation heuristic;
d) creating an order message for communication to a transaction destination if the selected evaluation heuristic matches the order; and e) repeating steps a) through d) until the order is fulfilled.
2. An order matching system for matching orders by a user by computer according to an evaluation heuristic, comprising:
a) a user interface for selecting the evaluation heuristic;
b) a user interface for scheduling execution of the selected evaluation heuristic;
c) a computer program for executing the selected evaluation heuristic at the scheduled time; and d) a communications network coupled to the computer program for creating an order message to be dispatched to a transaction destination if the selected evaluation heuristic matches the order.
a) a user interface for selecting the evaluation heuristic;
b) a user interface for scheduling execution of the selected evaluation heuristic;
c) a computer program for executing the selected evaluation heuristic at the scheduled time; and d) a communications network coupled to the computer program for creating an order message to be dispatched to a transaction destination if the selected evaluation heuristic matches the order.
3. An order schedule for use in an order matching system that creates an order message for communication to a transaction destination upon matching an order to evaluation heuristics selected by a user, the order schedule comprising:
a) a user interface that allows for the selecting of the evaluation heuristic; and b) a user interface for creating a schedule to execute the evaluation heuristic.
a) a user interface that allows for the selecting of the evaluation heuristic; and b) a user interface for creating a schedule to execute the evaluation heuristic.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17764900P | 2000-01-27 | 2000-01-27 | |
US60/177,649 | 2000-01-27 |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2332498A1 true CA2332498A1 (en) | 2001-07-27 |
Family
ID=22649401
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002332498A Abandoned CA2332498A1 (en) | 2000-01-27 | 2001-01-26 | Order matching system |
Country Status (3)
Country | Link |
---|---|
US (3) | US7110975B2 (en) |
CA (1) | CA2332498A1 (en) |
GB (1) | GB2366637A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113285855A (en) * | 2021-07-14 | 2021-08-20 | 天聚地合(苏州)数据股份有限公司 | Server monitoring method and system |
Families Citing this family (85)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7966234B1 (en) | 1999-05-17 | 2011-06-21 | Jpmorgan Chase Bank. N.A. | Structured finance performance analytics system |
US7110975B2 (en) * | 2000-01-27 | 2006-09-19 | Marks De Chabris Gloriana | Order matching system |
US7249095B2 (en) | 2000-06-07 | 2007-07-24 | The Chase Manhattan Bank, N.A. | System and method for executing deposit transactions over the internet |
US7392212B2 (en) * | 2000-09-28 | 2008-06-24 | Jpmorgan Chase Bank, N.A. | User-interactive financial vehicle performance prediction, trading and training system and methods |
US7313541B2 (en) * | 2000-11-03 | 2007-12-25 | Jpmorgan Chase Bank, N.A. | System and method for estimating conduit liquidity requirements in asset backed commercial paper |
US8527396B2 (en) * | 2000-12-22 | 2013-09-03 | Marketaxess Holdings, Inc. | Method and system for computer-implemented trading of secondary debt market securities |
US7596526B2 (en) * | 2001-04-16 | 2009-09-29 | Jpmorgan Chase Bank, N.A. | System and method for managing a series of overnight financing trades |
US7418421B2 (en) * | 2002-03-28 | 2008-08-26 | International Business Machines Corporation | Method, system, and apparatus for dynamically creating electronic contracts |
US8224723B2 (en) | 2002-05-31 | 2012-07-17 | Jpmorgan Chase Bank, N.A. | Account opening system, method and computer program product |
US8244622B2 (en) * | 2002-06-05 | 2012-08-14 | The Nasdaq Omx Group, Inc. | Order matching process and method |
US20030225674A1 (en) * | 2002-06-05 | 2003-12-04 | Hughes John T. | Order chronicle process and method |
US20030225675A1 (en) * | 2002-06-05 | 2003-12-04 | Santino Failla | Information distribution system and method |
US8090640B2 (en) * | 2002-06-05 | 2012-01-03 | The Nasdaq Omx Group, Inc. | Order delivery in a securities market |
US7921051B2 (en) * | 2002-06-05 | 2011-04-05 | The Nasdaq Omx Group, Inc. | Security-based order processing technique |
US9311673B2 (en) * | 2002-06-05 | 2016-04-12 | Nasdaq, Inc. | Security transaction matching |
US7895112B2 (en) * | 2002-06-05 | 2011-02-22 | The Nasdaq Omx Group, Inc. | Order book process and method |
US7124110B1 (en) | 2002-07-15 | 2006-10-17 | Trading Technologies International Inc. | Method and apparatus for message flow and transaction queue management |
US20050044033A1 (en) * | 2003-01-10 | 2005-02-24 | Gelson Andrew F. | Like-kind exchange method |
US7693775B2 (en) * | 2003-01-21 | 2010-04-06 | Lavaflow, Inc. | Automated system for routing orders for financial instruments based upon undisclosed liquidity |
US20040148247A1 (en) * | 2003-01-24 | 2004-07-29 | Lawrence Miller | Network-based systems, methods, and software for initiating or executing financial transactions |
US7634435B2 (en) * | 2003-05-13 | 2009-12-15 | Jp Morgan Chase Bank | Diversified fixed income product and method for creating and marketing same |
US7770184B2 (en) * | 2003-06-06 | 2010-08-03 | Jp Morgan Chase Bank | Integrated trading platform architecture |
US8306900B2 (en) * | 2003-06-10 | 2012-11-06 | Itg Software Solutions, Inc. | System, method, and computer program product for executing a buy or sell order |
US20050015324A1 (en) * | 2003-07-15 | 2005-01-20 | Jacob Mathews | Systems and methods for trading financial instruments across different types of trading platforms |
US7970688B2 (en) * | 2003-07-29 | 2011-06-28 | Jp Morgan Chase Bank | Method for pricing a trade |
US20050060256A1 (en) * | 2003-09-12 | 2005-03-17 | Andrew Peterson | Foreign exchange trading interface |
WO2005076778A2 (en) * | 2003-10-10 | 2005-08-25 | Bloomberg Lp | Relative pricing for proposals for trading of financial interests |
US7593876B2 (en) * | 2003-10-15 | 2009-09-22 | Jp Morgan Chase Bank | System and method for processing partially unstructured data |
US8655755B2 (en) * | 2003-10-22 | 2014-02-18 | Scottrade, Inc. | System and method for the automated brokerage of financial instruments |
US7266573B2 (en) * | 2003-12-23 | 2007-09-04 | Sap Ag | Cross-system update method and system |
US8738498B2 (en) | 2004-01-29 | 2014-05-27 | Bgc Partners, Inc. | System and method for routing a trading order |
US10304097B2 (en) | 2004-01-29 | 2019-05-28 | Bgc Partners, Inc. | System and method for controlling the disclosure of a trading order |
US8423447B2 (en) * | 2004-03-31 | 2013-04-16 | Jp Morgan Chase Bank | System and method for allocating nominal and cash amounts to trades in a netted trade |
US20050222937A1 (en) * | 2004-03-31 | 2005-10-06 | Coad Edward J | Automated customer exchange |
US7895199B2 (en) * | 2004-04-20 | 2011-02-22 | Honda Motor Co., Ltd. | Method and system for modifying orders |
US20050251478A1 (en) * | 2004-05-04 | 2005-11-10 | Aura Yanavi | Investment and method for hedging operational risk associated with business events of another |
US7693770B2 (en) | 2004-08-06 | 2010-04-06 | Jp Morgan Chase & Co. | Method and system for creating and marketing employee stock option mirror image warrants |
AU2005299602B2 (en) * | 2004-10-27 | 2012-12-13 | Bloomberg L.P. | System and method for trading financial instruments based on undisclosed values |
US20090132428A1 (en) * | 2004-11-15 | 2009-05-21 | Stephen Jeffrey Wolf | Method for creating and marketing a modifiable debt product |
US20090164384A1 (en) * | 2005-02-09 | 2009-06-25 | Hellen Patrick J | Investment structure and method for reducing risk associated with withdrawals from an investment |
US8688569B1 (en) | 2005-03-23 | 2014-04-01 | Jpmorgan Chase Bank, N.A. | System and method for post closing and custody services |
US20090187512A1 (en) * | 2005-05-31 | 2009-07-23 | Jp Morgan Chase Bank | Asset-backed investment instrument and related methods |
US7840477B2 (en) * | 2005-06-07 | 2010-11-23 | Bgc Partners, Inc. | System and method for routing a trading order based upon quantity |
US7822682B2 (en) * | 2005-06-08 | 2010-10-26 | Jpmorgan Chase Bank, N.A. | System and method for enhancing supply chain transactions |
US20110035306A1 (en) * | 2005-06-20 | 2011-02-10 | Jpmorgan Chase Bank, N.A. | System and method for buying and selling securities |
US20070027708A1 (en) * | 2005-08-01 | 2007-02-01 | Rentalmetro, Inc. D/B/A Nuvorent | Systems and methods to facilitate rental transactions |
US8484122B2 (en) | 2005-08-04 | 2013-07-09 | Bgc Partners, Inc. | System and method for apportioning trading orders based on size of displayed quantities |
EP1929438A4 (en) * | 2005-08-04 | 2010-08-04 | Espeed Inc | System for submitting trading orders |
US8494951B2 (en) | 2005-08-05 | 2013-07-23 | Bgc Partners, Inc. | Matching of trading orders based on priority |
US7567928B1 (en) | 2005-09-12 | 2009-07-28 | Jpmorgan Chase Bank, N.A. | Total fair value swap |
US7818238B1 (en) | 2005-10-11 | 2010-10-19 | Jpmorgan Chase Bank, N.A. | Upside forward with early funding provision |
US8768817B2 (en) * | 2006-01-26 | 2014-07-01 | Hitachi, Ltd. | Transaction system |
US8280794B1 (en) | 2006-02-03 | 2012-10-02 | Jpmorgan Chase Bank, National Association | Price earnings derivative financial product |
US7979339B2 (en) | 2006-04-04 | 2011-07-12 | Bgc Partners, Inc. | System and method for optimizing execution of trading orders |
US7620578B1 (en) | 2006-05-01 | 2009-11-17 | Jpmorgan Chase Bank, N.A. | Volatility derivative financial product |
US7647268B1 (en) | 2006-05-04 | 2010-01-12 | Jpmorgan Chase Bank, N.A. | System and method for implementing a recurrent bidding process |
US9811868B1 (en) | 2006-08-29 | 2017-11-07 | Jpmorgan Chase Bank, N.A. | Systems and methods for integrating a deal process |
US7827096B1 (en) | 2006-11-03 | 2010-11-02 | Jp Morgan Chase Bank, N.A. | Special maturity ASR recalculated timing |
US20080177637A1 (en) | 2006-12-30 | 2008-07-24 | David Weiss | Customer relationship management methods and systems |
EP2168091A4 (en) * | 2007-06-01 | 2012-05-09 | Ften Inc | Method and system for monitoring market data to identify user defined market conditions |
US8306809B2 (en) * | 2008-07-17 | 2012-11-06 | International Business Machines Corporation | System and method for suggesting recipients in electronic messages |
US20100088213A1 (en) * | 2008-10-07 | 2010-04-08 | Czupek Andrew P | System and method for matching one or more incoming order to a standing order based on multiple order priority |
US20100088215A1 (en) * | 2008-10-07 | 2010-04-08 | Czupek Andrew P | System and method for matching one or more incoming order to a standing order based on multiple order priority allocation |
US20100088216A1 (en) * | 2008-10-07 | 2010-04-08 | Czupek Andrew P | System and method for matching one or more incoming order to a standing order based on time order priority allocation |
US8732062B2 (en) | 2008-10-07 | 2014-05-20 | Chicago Mercantile Exchange Inc. | System and method for matching one or more incoming order to a standing order based on multi-level allocation |
US8566218B2 (en) * | 2008-10-07 | 2013-10-22 | Chicago Mercantile Exchange Inc. | Systems and methods for matching one or more incoming order to a standing order as a function of an inner market parameter |
WO2010042599A2 (en) * | 2008-10-08 | 2010-04-15 | Pipeline Financial Group, Inc. | List execution and cash balancing |
WO2010101703A1 (en) * | 2009-03-06 | 2010-09-10 | Bgc Partners, Inc. | Interprogram communication using messages related to events and actions on an exchange |
US10380689B2 (en) * | 2009-03-06 | 2019-08-13 | Bgc Partners, Inc. | Method and apparatus for exchange-based condition processing |
US10453130B2 (en) * | 2009-03-18 | 2019-10-22 | Bgc Partners, Inc. | Electronic exchange system using messages related to events and actions on an exchange |
US20100312716A1 (en) * | 2009-06-08 | 2010-12-09 | Richard Lane | System and Method for Conditional Modification of Buy and Sell Orders in Electronic Trading Exchange |
CA2779202C (en) | 2009-10-28 | 2016-07-19 | Ften, Inc. | Intraday risk management data cloud system controlling execution of orders |
US8738514B2 (en) | 2010-02-18 | 2014-05-27 | Jpmorgan Chase Bank, N.A. | System and method for providing borrow coverage services to short sell securities |
US20110208670A1 (en) * | 2010-02-19 | 2011-08-25 | Jpmorgan Chase Bank, N.A. | Execution Optimizer |
US8352354B2 (en) * | 2010-02-23 | 2013-01-08 | Jpmorgan Chase Bank, N.A. | System and method for optimizing order execution |
US10262365B2 (en) | 2012-04-16 | 2019-04-16 | Nasdaq Technology Ab | Method and a computerized exchange system for processing trade orders |
US20140129404A1 (en) | 2012-11-07 | 2014-05-08 | Goldman, Sachs & Co. | Session-Based Electronic Trading |
US20140129405A1 (en) * | 2012-11-07 | 2014-05-08 | Goldman, Sachs & Co. | Session-Based Electronic Trading And Order Handling |
WO2014161566A1 (en) * | 2013-04-02 | 2014-10-09 | Telefonaktiebolaget L M Ericsson (Publ) | A radio antenna alignment tool |
US10664548B2 (en) | 2013-07-12 | 2020-05-26 | Trading Technologies International, Inc. | Tailored messaging |
US10078862B2 (en) | 2015-06-30 | 2018-09-18 | Bank Of America Corporation | Providing consolidated order management |
US10223733B2 (en) | 2015-06-30 | 2019-03-05 | Bank Of America Corporation | Providing consolidated order management |
US10366453B2 (en) | 2015-06-30 | 2019-07-30 | Bank Of America Corporation | Providing consolidated order management |
WO2017117191A1 (en) * | 2015-12-30 | 2017-07-06 | Chicago Mercantile Exchange Inc. | Execution of co-dependent transactions in a transaction processing system |
US11082351B2 (en) | 2017-01-05 | 2021-08-03 | Chicago Mercantile Exchange Inc. | Network congestion reduction based on routing and matching data packets |
Family Cites Families (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3581072A (en) | 1968-03-28 | 1971-05-25 | Frederick Nymeyer | Auction market computation system |
US3573747A (en) * | 1969-02-24 | 1971-04-06 | Institutional Networks Corp | Instinet communication system for effectuating the sale or exchange of fungible properties between subscribers |
US4412287A (en) | 1975-05-29 | 1983-10-25 | Braddock Iii Walter D | Automated stock exchange |
US4158455A (en) * | 1978-02-02 | 1979-06-19 | Spencer Brown | Wall panel installation jig |
US4254945A (en) * | 1980-04-21 | 1981-03-10 | Paulson Leland E | Fixture for hanging large panels |
US4486853A (en) | 1981-04-01 | 1984-12-04 | Telemet American, Inc. | Apparatus for receiving and displaying continuously updated data |
US4903201A (en) | 1983-11-03 | 1990-02-20 | World Energy Exchange Corporation | Automated futures trading exchange |
US4674044A (en) * | 1985-01-30 | 1987-06-16 | Merrill Lynch, Pierce, Fenner & Smith, Inc. | Automated securities trading system |
US4709460A (en) * | 1985-06-10 | 1987-12-01 | Vladimir Luhowyj | Panel installation tool and method |
GB9027249D0 (en) * | 1990-12-17 | 1991-02-06 | Reuters Ltd | Offer matching system |
US6023686A (en) | 1996-02-20 | 2000-02-08 | Health Hero Network | Method for conducting an on-line bidding session with bid pooling |
US5794207A (en) | 1996-09-04 | 1998-08-11 | Walker Asset Management Limited Partnership | Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven conditional purchase offers |
GB9320379D0 (en) * | 1993-10-04 | 1993-11-24 | Earp Michael J | Panel support device |
US5407183A (en) * | 1994-03-01 | 1995-04-18 | Singeltary; James C. | Drywall installation tool |
US5948040A (en) | 1994-06-24 | 1999-09-07 | Delorme Publishing Co. | Travel reservation information and planning system |
GB9416673D0 (en) | 1994-08-17 | 1994-10-12 | Reuters Ltd | Data exchange filtering system |
US5845265A (en) | 1995-04-26 | 1998-12-01 | Mercexchange, L.L.C. | Consignment nodes |
US5845266A (en) * | 1995-12-12 | 1998-12-01 | Optimark Technologies, Inc. | Crossing network utilizing satisfaction density profile with price discovery features |
US5689652A (en) * | 1995-04-27 | 1997-11-18 | Optimark Technologies, Inc. | Crossing network utilizing optimal mutual satisfaction density profile |
US5802499A (en) * | 1995-07-13 | 1998-09-01 | Cedel Bank | Method and system for providing credit support to parties associated with derivative and other financial transactions |
CA2193582A1 (en) * | 1995-12-21 | 1997-06-22 | Aidan O'leary | Order processing method |
US6119101A (en) * | 1996-01-17 | 2000-09-12 | Personal Agents, Inc. | Intelligent agents for electronic commerce |
US5950176A (en) | 1996-03-25 | 1999-09-07 | Hsx, Inc. | Computer-implemented securities trading system with a virtual specialist function |
US5835896A (en) | 1996-03-29 | 1998-11-10 | Onsale, Inc. | Method and system for processing and transmitting electronic auction information |
US5890138A (en) | 1996-08-26 | 1999-03-30 | Bid.Com International Inc. | Computer auction system |
US5658113A (en) * | 1996-07-25 | 1997-08-19 | Lazo; David | Building panel handling device and method of use therefor |
US5873071A (en) * | 1997-05-15 | 1999-02-16 | Itg Inc. | Computer method and system for intermediated exchange of commodities |
US5794998A (en) * | 1997-09-09 | 1998-08-18 | Lapierre; Clement | Carrying and handling tool for construction boards |
US5960411A (en) * | 1997-09-12 | 1999-09-28 | Amazon.Com, Inc. | Method and system for placing a purchase order via a communications network |
US5960406A (en) | 1998-01-22 | 1999-09-28 | Ecal, Corp. | Scheduling system for use between users on the web |
US6131361A (en) * | 1998-03-04 | 2000-10-17 | Murphy; James T. | Displaceable support bracket for drywall panel installation |
US6161824A (en) * | 1998-05-08 | 2000-12-19 | Gustavson; Ido H. | Wallboard installation facilitating tool |
US6311144B1 (en) * | 1998-05-13 | 2001-10-30 | Nabil A. Abu El Ata | Method and apparatus for designing and analyzing information systems using multi-layer mathematical models |
US6532217B1 (en) * | 1998-06-29 | 2003-03-11 | Ip Dynamics, Inc. | System for automatically determining a network address |
WO2000021013A1 (en) | 1998-10-06 | 2000-04-13 | Andrew Lustig | Method and apparatus for auctions with automatic matching |
WO2000026834A2 (en) | 1998-10-30 | 2000-05-11 | Optimark Technologies, Inc. | Crossing network and method |
US6408282B1 (en) * | 1999-03-01 | 2002-06-18 | Wit Capital Corp. | System and method for conducting securities transactions over a computer network |
US7617144B2 (en) * | 1999-03-19 | 2009-11-10 | Primex Holdings Llc | Auction market with price improvement mechanism |
US6278982B1 (en) * | 1999-04-21 | 2001-08-21 | Lava Trading Inc. | Securities trading system for consolidation of trading on multiple ECNS and electronic exchanges |
US6629082B1 (en) * | 1999-06-15 | 2003-09-30 | W.R. Hambrecht & Co. | Auction system and method for pricing and allocation during capital formation |
EP1208508A4 (en) | 1999-07-09 | 2002-08-07 | Salomon Smith Barney Inc | Interest matching and price improvement platform method and system |
US6230469B1 (en) * | 2000-01-11 | 2001-05-15 | Cathy D. Santa Cruz | Method for beveling wallboard panels and installing same to create a recessed flush butt-joint |
US7110975B2 (en) | 2000-01-27 | 2006-09-19 | Marks De Chabris Gloriana | Order matching system |
US6293058B1 (en) * | 2000-03-17 | 2001-09-25 | Michael Sink | Drywall support system |
US6364303B1 (en) * | 2001-03-09 | 2002-04-02 | Ido H. Gustavson | Multifunction wallboard installation tool |
-
2001
- 2001-01-25 US US09/770,108 patent/US7110975B2/en not_active Expired - Lifetime
- 2001-01-26 CA CA002332498A patent/CA2332498A1/en not_active Abandoned
- 2001-01-26 GB GB0102094A patent/GB2366637A/en not_active Withdrawn
-
2006
- 2006-09-18 US US11/532,660 patent/US20070067231A1/en not_active Abandoned
-
2010
- 2010-03-08 US US12/719,537 patent/US8108294B2/en not_active Expired - Fee Related
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113285855A (en) * | 2021-07-14 | 2021-08-20 | 天聚地合(苏州)数据股份有限公司 | Server monitoring method and system |
Also Published As
Publication number | Publication date |
---|---|
GB0102094D0 (en) | 2001-03-14 |
US20020013753A1 (en) | 2002-01-31 |
US8108294B2 (en) | 2012-01-31 |
US20100169238A1 (en) | 2010-07-01 |
US20070067231A1 (en) | 2007-03-22 |
GB2366637A (en) | 2002-03-13 |
US7110975B2 (en) | 2006-09-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7110975B2 (en) | Order matching system | |
US20210256603A1 (en) | Auction market with price improvement mechanism | |
US7389263B2 (en) | Method and system for the automated trading of financial instruments | |
US10269061B2 (en) | Anonymous block trade matching system | |
CA2370789C (en) | A securities trading system for consolidation of trading on multiple ecns and electronic exchanges | |
US20150073966A1 (en) | Method And Apparatus For Processing And Routing Transactions | |
US20150161729A1 (en) | System and method for physicals commodity trading | |
US20070005481A1 (en) | Real time graphical user interface for on-line trading | |
US20040133500A1 (en) | Apparatus and method for displaying trading trends | |
US20080215430A1 (en) | Credit derivative trading platform | |
WO2001052166A1 (en) | Automated batch auctions in conjunction with continuous financial markets | |
JP2003524241A (en) | Method and system for obtaining disclosure price | |
US20020188546A1 (en) | Pricing delivery system | |
Weber | Transparency and bypass in electronic financial markets | |
US20080120246A1 (en) | System and method for trading financial instruments associated with future events | |
US7672893B1 (en) | System and method for trading taxable and non-taxable securities | |
Clemons et al. | The Optimark Experience: What Welearned | |
AU2018275000A1 (en) | Anonymous block trade matching system | |
CA2642400A1 (en) | Credit derivative trading platform | |
AU2013273772A1 (en) | Anonymous block trade matching system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued | ||
FZDE | Discontinued |
Effective date: 20060605 |