![[ transaction costs ]](../images/TransTop168.gif)
| |
Analyzing the Performance of Crossing Networksby Nicolo G. Torre and Geoff A. Latham1 In other articles we have drawn attention to the importance of controlling transaction costs. Electronic Crossing Networks (ECNs), such as the POSIT system2, represent one approach to this problem. Participants in an ECN submit lists of orders they wish to do. The lists are matched up by a computer and matched orders are executed at the midpoint of the bid-ask spread. The system may support additional control by participants over the matching process, for instance the ability to specify minimum fill sizes. However, in this article we will focus on the bare bones of the matching process. ECNs provide users with two key advantages. First, participants have the opportunity to search for a trade counterparty without revealing their trading intentions to the world at large. Second, trades are executed at the midpoint of the bid-ask spread and thus may be cheaper than trades executed in the wider marketplace, which could incur halfspread and incremental market impact costs. The principal disadvantage of ECNs is that trades only occur when a counterparty happens to arrive. Thus, participants must expect that many of their orders will go unmatched. These orders either will need to wait in the ECN until the arrival of a counterparty, or will need to be worked through some other trading mechanism. Thus, analyzing the determinants of the match rate is essential for understanding the performance of an ECN. If we consider a match involving just two participants and assume that
all orders are to either buy or sell 100 shares, we can derive analytic
expressions for the results of the match. Suppose that the stock universe
contains N names, and that the first participant submits a list of n orders
and the second participant submits a list of p orders. The order lists
are assumed to contain stock selections in which no stock is favored over
another, and buy and sell orders occur with equal probabilitythat
is, the lists are unbiased. Without loss of generality, we may suppose
that p where FIGURE 1 plots pj (100,100, 1000). Clearly the most likely outcome is for 4 or 5 matches, but there is a tail of additional potential matches. FIGURE 1: Probability of crosses |
[client support]
[portfolio management]
[investment data]
[trading services] [search] [site map] [contact us] [home]
Any questions or bug reports regarding this service should go to contactus@barra.com. |