does algorithmic trading improve liquidity?

23
Does Algorithmic Trading Improve Liquidity? Terry Hendershott 1 Charles M. Jones 2 Albert J. Menkveld 3 1 Haas School of Business, UC Berkeley 2 Graduate School of Business, Columbia University 3 Tinbergen Institute, VU University Amsterdam WFA, June 2008

Upload: others

Post on 25-Dec-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Does Algorithmic Trading Improve Liquidity?

Does Algorithmic Trading Improve Liquidity?

Terry Hendershott1 Charles M. Jones2 Albert J. Menkveld3

1Haas School of Business, UC Berkeley

2Graduate School of Business, Columbia University

3Tinbergen Institute, VU University Amsterdam

WFA, June 2008

Page 2: Does Algorithmic Trading Improve Liquidity?

Time trend bid-ask spread (ctd)

Relative bid-ask spread Dow Jones stocks(all stocks 1900-1928, DJIA stocks 1929-2000)

Spreads for the long run

Figure 1. Bid-ask spreads on Dow Jones stocks(all DJ stocks 1900-1928, DJIA stocks 1929-present)

0.00%

0.20%

0.40%

0.60%

0.80%

1.00%

1.20%

1.40%

1.60%

1900 1910 1920 1930 1940 1950 1960 1970 1980 1990 2000

Prop

ortio

nal s

prea

d

Page 3: Does Algorithmic Trading Improve Liquidity?

Time trend bid-ask spread (ctd)

NYSE value-weighted average effective spread!"#$%"%&'()*+%'((,%"-%+*&*#-%./)-(+0

0.00%

0.05%

0.10%

0.15%

0.20%

0.25%

1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004

Pro

po

rtio

nal

eff

ecti

ve

spre

ad

Figure 1. NYSE value-weighted proportional effective spreads

Page 4: Does Algorithmic Trading Improve Liquidity?

Institutional trading

How do institutions trade prior to algorithms? To buy 100,000IBM shares, they

I hire a broker-dealer to take down or shop a blockI hire NYSE floor broker who uses judgement to slowly

“work” the orderBroker-dealers now offer algos that minimize price concessionthrough a dynamic trading strategy that optimizes over price,quantity, time, and venue

And, broker-dealers and hedge funds supply liquidity with algos(e.g. D.E. Shaw, Getco,. . . )

Page 5: Does Algorithmic Trading Improve Liquidity?

Related literature

IO of liquidity supplyI competition: Kyle (1985), Biais, Martimort, and Rochet

(2000)Free trading option of limit orders (Copeland and Galai (1983))

I monitoring public information flow is costly (Foucault,Roell, and Sandas (2003))

I AT may raise costs of non-AT limit orders (Rock (1990))Optimal execution of large orders (Keim and Madhavan (1995),Bertsimas and Lo (1998), Almgren and Chriss (2000))

I market vs. limit, aggressiveness (Harris (1998), Griffiths,Smith, Turnbull, and White (2000), Lo, MacKinlay, andZhang (2002), Boehmer, Saar, and Yu (2005), Hasbrouckand Saar (2007), Obizhaeva and Wang (2005))

Page 6: Does Algorithmic Trading Improve Liquidity?

What do we do?

We measure algo trading through normalized (electronic)message traffic at the NYSE

I message traffic is electronic order submissions, cancels, andtrade reports

Panel regressions associate time-series increases in algo tradingwith more liquid markets

I we exploit the exogenous, staggered introduction ofautoquote at the NYSE as an instrument to establishcausality

Page 7: Does Algorithmic Trading Improve Liquidity?

2002 2003 2004 2005 2006

50

100

150

200

250

messagesit (#electronic messages per minute i.e. proxy for algorithmic activity (/minute))Q1 Q3 Q5

Q2 Q4 95% conf. interval

Page 8: Does Algorithmic Trading Improve Liquidity?

2002 2003 2004 2005 2006

−70

−60

−50

−40

−30

−20

−10

algo_tradit (dollar volume per electronic message times (−1) to proxy for algorithmic trading ($100))

Q1 Q3 Q5

Q2 Q4 95% conf. interval

Page 9: Does Algorithmic Trading Improve Liquidity?

Autoquote

Decimals in 2001 shrink inside quote depth

In October 2002 NYSE proposes “liquidity quote”I firm bid and offer for substantial size (> 15, 000 shares)

“Autoquote” is proposed simultaneously to free up thespecialist to concentrate on the liquidity quote

I specialists had been manually disseminating the insidequote

I software would now “autoquote” any change to bookLiquidity quote delayed, autoquote immediate

Autoquote is important for ATI immediate feedback about terms of trade

I algo liquidity suppliers see abnormally wide inside quoteI algo liquidity demanders access quote more quickly

Page 10: Does Algorithmic Trading Improve Liquidity?

0 20 40 60 80 100 120 140 160

25

50

75

100

125

150

175

200

↓ 12/2/02 start of sample

↓ 1/29/03 first stocks to Autoquote

↑ 5/27/03 last stocks to Autoquote

7/31/03 end of sample ↓↓ 12/2/02 start of sample

↓ 1/29/03 first stocks to Autoquote

↑ 5/27/03 last stocks to Autoquote

7/31/03 end of sample ↓↓ 12/2/02 start of sample

↓ 1/29/03 first stocks to Autoquote

↑ 5/27/03 last stocks to Autoquote

7/31/03 end of sample ↓↓ 12/2/02 start of sample

↓ 1/29/03 first stocks to Autoquote

↑ 5/27/03 last stocks to Autoquote

7/31/03 end of sample ↓↓ 12/2/02 start of sample

↓ 1/29/03 first stocks to Autoquote

↑ 5/27/03 last stocks to Autoquote

7/31/03 end of sample ↓

#stocks that trade in AutoquoteQ1 Q3 Q5

Q2 Q4

Page 11: Does Algorithmic Trading Improve Liquidity?

Autoquote dummy as instrument for algo tradit

Table 4: Overall, Between, and Within Correlations Autoquote Analysis

This table presents the overall, between, and within correlations for the variables used in the autoquoteanalysis. It is based on daily observations in the period when autoquote was phased in, i.e. December2, 2003, through July 31, 2003. For variable definitions, we refer to Table 1. We exploit the exogenousautoquote dummy (0 before the autoquote introduction, 1 after) to instrument for algo tradit in order toidentify causality from algo tradit to our liquidity measures. In the IV estimation, we exclude identificationoff of a time trend (by adding time dummies) and thus solely rely on the nonsynchronous introduction ofautoquote (see Figure 5). Before we report the IV estimation results in subsequent tables, this table reportscorrelations between the instrument (auto quoteit) and the endogenous variable (algo tradit) after removingthe time trend.

messa−gesit

algotradit

shareturnoverit

vola-tilityit

1/priceit ln mar−ket capit

Panel A: Overall, between, and within correlation after removing the time trendauto quoteit ρ(overall) 0.15* -0.05* 0.02* 0.03* 0.02* 0.10*

ρ(between) 0.23* -0.16* 0.06 0.09* 0.04 0.18*ρ(within) 0.08* 0.03* -0.01* 0.00 0.01* -0.01*

Panel B: Within correlation by quintile after removing the time trendauto quoteit Q1 ρ(within) 0.15* 0.03* 0.01* -0.00 0.03* -0.03*auto quoteit Q2 ρ(within) 0.03* 0.04* -0.01* 0.00 -0.02* 0.01*auto quoteit Q3 ρ(within) 0.05* 0.03* 0.00 -0.00 0.01 -0.02*auto quoteit Q4 ρ(within) 0.01* 0.00 -0.00 -0.00 -0.01 0.01auto quoteit Q5 ρ(within) -0.00 0.03* -0.02* 0.00 0.05* -0.04*a: Based on the time means i.e. xi = 1

T

∑Tt=1 xi,t.

b: Based on the deviations from time means i.e. x∗i,t = xi,t − xi.*: Significant at a 95% level.

F -tests reject null that instruments do not enter first-stageregression for all our IV regressions

Page 12: Does Algorithmic Trading Improve Liquidity?

IV regression including T/O, volatility, price, and size

Lit = αi + γt + βAit + δXit + εit

Table 5: Effect of AT on Spread: Nonsynchronous Autoquote Introduction as Instrumental Variable

This table regresses various measures of the (half) spread on our algorithmic trading proxy. It is based on daily observations in the period whenautoquote was phased in, i.e. December 2, 2003, through July 31, 2003. We use the exogenous nonsynchronous autoquote introduction to instrumentfor the endogenous algo tradit to identify causality from algorithmic trading to liquidity. We estimate

Lit = αi + γt + βAit + δXit + εit

where Lit is a spread measure for stock i on day t, Ait is the algorithmic trading measure algo tradit, and Xit is a vector of control variables, includingshare turnover, volatility, 1/price, and log market cap. We always include fixed effects and time dummies. The set of instruments we use consists ofall explanatory variables, except that we replace algo tradit with auto quoteit. We regress by quintile and report t-values based on standard errorsthat are robust to general cross-section and time-series heteroskedasticity and within-group autocorrelation (see Arellano and Bond (1991)).

Coefficient on algo tradit Coefficients on control variablesa

Q1 Q2 Q3 Q4 Q5 shareturnoverit

vola−tilityit

1/priceitln mktcapit

timedum-mies

DF teststatisticb

Panel A: quoted spread, quoted depth, and effective spreadqspreadit -0.52** -0.42** -0.43 -0.16 9.92 -2.80** 0.90** 108.30** -3.55** Yes -321.0**

(-3.23) (-2.21) (-1.44) (-0.05) (1.22) (-3.01) (9.70) (7.49) (-2.27)qdepthit -3.47** -1.43 -1.99 15.49 0.61 -5.16 -1.64* -3.90 12.12 Yes -300.3**

(-2.50) (-1.16) (-1.07) (0.39) (0.19) (-0.64) (-1.87) (-0.03) (0.83)espreadit -0.18** -0.32** -0.35 -1.63 4.65 -1.01** 0.69** 72.72** -1.27 Yes -329.8**

(-2.65) (-2.23) (-1.56) (-0.42) (1.16) (-2.32) (9.51) (10.91) (-1.45)Panel B: spread decompositionsrspreadit 0.35** 0.76** 1.03** 14.26 15.88 3.13* -1.06** 45.81** 5.06 Yes -303.6**

(3.53) (3.97) (2.06) (0.46) (1.36) (1.92) (-2.15) (4.14) (1.18)adv selectionit -0.53** -1.07** -1.39** -15.48 -11.21 -4.12** 1.75** 26.61* -6.27 Yes -298.3**

(-3.57) (-4.08) (-2.06) (-0.47) (-1.33) (-2.24) (3.29) (1.84) (-1.34)#observations: 1082*167 (stock*day)*/**: Significant at a 95%/99% level.a: We use quintile-specific coefficients for the control variables and time dummies. For brevity, we only report the (across the quintiles) market-cap-weighted coefficient for the control variables and its t-statistic.b: We report the Dickey-Fuller test statistic based on the residuals in order to diagnose nonstationarity. A significant test statistic rejects the nullthat the series contains a unit root, i.e. it rejects nonstationarity.

Page 13: Does Algorithmic Trading Improve Liquidity?

2002 2003 2004 2005 2006

0.5

1.0

1.5

2.0

2.5

stdev_tradecorr_compit (stdev of trade−correlated component of eff. price innovations cf. Hasbrouck (1991a,1991b) (bps))Q1 Q3 Q5

Q2 Q4 95% conf. interval

Page 14: Does Algorithmic Trading Improve Liquidity?

2002 2003 2004 2005 2006

0.5

1.0

1.5

2.0

2.5

3.0

3.5

stdev_nontradecorr_compit (stdev of non−trade−correlated component of eff. price innovations cf. Hasbrouck (1991a,1991b) (bps))Q1 Q3 Q5

Q2 Q4 95% conf. interval

Page 15: Does Algorithmic Trading Improve Liquidity?

IV regression for LSB and Hasbrouck decompositions

Mit = αi + γt + βAit + δXit + εit

Table 7: Lin-Sanger-Booth and Hasbrouck Decompositions: Nonsynchronous Autoquote Introduction as In-strumental Variable

This table regresses the components of Lin-Sanger-Booth (LSB) and Hasbrouck decompositions on our algorithmic trading proxy. It is based ondaily observations in the period when autoquote was phased in, i.e. December 2, 2003, through July 31, 2003. The LSB decomposition accounts fororder persistence in decomposing the bid-ask spread. It identifies a fixed (transitory) component (LSB95 fixedit), an adverse selection component(LSB95 adv selit), and a component due to order persistence (LSB95 order persistit) (see Section 3.3.1 and Lin, Sanger, and Booth (1995) fordetails). As the LSB decomposition limits persistence to that of an AR(1) process, we also estimate a Hasbrouck VAR-based model to identify the sizeof the trade-related (stdev tradecorr compit) and trade-unrelated (stdev nontradecorr compit) components of permanent price changes in betweentransactions (see Section 3.3.2 and Hasbrouck (1991a, 1991b) for details). For the regressions, we use the exogenous nonsynchronous introduction ofautoquote to instrument for the endogenous algo tradit to identify causality from algorithmic trading to these LSB and Hasbrouck components. Weestimate Mit = αi + γt + βAit + δXit + εit

where Mit is a LSB or Hasbrouck component for stock i on day t, Ait is the algorithmic trading measure, and Xit is a vector of control variables,including share turnover, volatility, 1/price, and log market cap. We always include fixed effects and time dummies, but leave out the control variablesin the Hasbrouck component regressions. We regress by quintile and report t-values based on standard errors that are robust to general cross-sectionand time-series heteroskedasticity and within-group autocorrelation (see Arellano and Bond (1991)).

Coefficient on algo tradit Coefficients on control variablesa

Q1 Q2 Q3 Q4 Q5 shareturnoverit

vola−tilityit

1/priceitln mktcapit

timedum-mies

DFteststatistica

Panel A: Lin, Sanger, and Booth (1995)LSB95 fixedit 0.26** 0.59** 0.69** 9.91 8.97 2.35** -0.28 26.23** 3.85 Yes -296.4**

(3.63) (4.16) (2.26) (0.46) (1.36) (2.07) (-0.80) (3.81) (1.29)LSB95 adv selit -0.26** -0.61** -0.84** -12.19 -7.72 -2.58* 0.57 15.70** -4.26 Yes -291.7**

(-3.46) (-3.80) (-2.14) (-0.46) (-1.32) (-1.85) (1.32) (1.99) (-1.15)LSB95 order persistit -0.18** -0.30** -0.21 0.66 3.30 -0.82** 0.41** 30.68** -0.90 Yes -328.2**

(-3.06) (-3.10) (-1.60) (0.28) (1.21) (-2.33) (8.66) (6.24) (-1.43)Panel B: “Hasbrouck decomposition”stdev tradecorr compit -0.22** -0.26** -0.30* -3.39 -0.57** Yes -257.2**

(-2.62) (-3.08) (-1.69) (-0.30) (-2.73)stdev nontradecorr compit 0.13** 0.13** 0.13 1.03 0.13 Yes -272.2**

(2.48) (2.36) (1.47) (0.28) (1.12)#observations: 1082*167 (stock*day)*/**: Significant at a 95%/99% level.a: We use quintile-specific coefficients for the control variables and time dummies. For brevity, we only report the (across the quintiles) market-cap-weighted coefficient for the control variables and its t-statistic.

Page 16: Does Algorithmic Trading Improve Liquidity?

Interpretation: generalized Roll model

i.i.d. innovation in efficient price in each of two periods,mt = mt−1 + wt, with wt ∈ {−ε,+ε} equally likely

1. At t = 0, risk-neutral humans submit a bid and ask quoteand, given full competition, the first one arriving bids herreservation price.

2. At t = 1, humans can buy the information w1 at cost c. Ifbought, they can submit a new limit order.

3. At t = 2, two informed liquidity demanders arrive, onewith a positive private value associated with a trade, +θ,the other with a negative private value, −θ.

Assume1. 2c > θ i.e. cost of “observing” for humans is sufficiently

high (“quotes become stale”)2. ε > θ i.e. large innovations prevent simultaneous

transaction by both liquidity demanders (unimportant)

Page 17: Does Algorithmic Trading Improve Liquidity?

Interpretation: generalized Roll model (ctd)

Humans only

4.1 A generalized Roll model

The “game” has two periods, each with an i.i.d. innovation in the efficient price:

mt = mt−1 + wt, (13)

where wt ∈ {ε,−ε} , each with probability 0.5. The game features three stages:

- At t = 0, risk-neutral humans can submit a bid and ask quote and, given full compe-

tition, the first one arriving bids her reservation price.

- At t = 1, humans can buy the information w1 at cost c. If they buy the information,

they can submit a new limit order.

- At t = 2, two informed liquidity demanders arrive, one with a positive private value

associated with a trade, +θ, the other with a negative private value, -θ.

We assume that 2c > θ, i.e., the cost of “observing” information for humans is

sufficiently high that they do not update their quotes. The technical assumption 2ε > θ is

also required so that only one of the two arriving liquidity demanders transacts at t = 2.

muu2

mu1

mud2

mdd2

m0

md1

A0 A1

B0 B1

ε

There are four equally likely paths through the binomial tree: uu, ud, du, and dd,

where u represents a positive increment of ε to the fundamental value and d is a negative

increment. In equilibrium, humans do not buy the w1 information and update the quote at

t = 1, since they have to quote so far away from the efficient price to make up for c that

neither liquidity demander will transact at that quote (as 2c > θ). Given that they do not

acquire the w1 information, humans protect themselves by setting the bid price equal to

21

1. 2c > θ i.e. the cost of “observing” information for humans is high so thatthey do not update quotes on the arrival of public information (“quotesbecome stale”).

2. 2ε > θ i.e. efficient price innovations are large enough so that we rule outthat both liquidity demanders (+θ or −θ) transact at the same time (notimportant).

A graph of the price tree and the (equilibrium) bid and ask quotes is:

muu2

mu1

mud2

mdd2

m0

md1

A0 A1

B0 B1

ε

The important result is that the humans do not buy the w1 information andupdate the quote at t = 1, since they have to quote so far away from theefficient price to make up for c that neither liquidity demander will transact atthat quote (as 2c > θ). For example, if w1 is positive, they could put in a newbid of mu

1 − ε−2c, but, even if w2 is negative, the liquidity seller’s private valueis too small to consume the bid quote.

In this case, we have the following outcomes:

probability state efficient transactionprice price

.25 uu muu2 muu

2

.50 ud and du mud2 = mdu

2 no transaction.25 dd mdd

2 mdd2

And, estimating the Hasbrouck model gives:

Pa − Pb = 2εu, u ∈ {1, 0,−1} is the trade sign, (2)

where Pa (Pb) is the transaction price after (before) the period. Clearly, thereis no public information component and all information comes from the orderflow.1

1For simplicity, I put u = 0 for no transaction and set Pa = Pb in this case. Ideally, onerepeats the game until a transaction occurs and it seems that the result continues to hold (i.e.all innovation comes from order flow).

2

I at t = 1 public information does not enter quotesI “welfare loss” due to possible unrealized private value

Page 18: Does Algorithmic Trading Improve Liquidity?

Interpretation: generalized Roll model (ctd)

Introduce an algo that buys information at zero cost

m0 − 2ε and the ask price equal to m0 + 2ε. One of the liquidity demanders trades at t = 2

if the path is either uu or dd; the quote providers break even. If the path is ud or du, then

there is no trade, because the liquidity demander’s private value is too small relative to the

spread.

Clearly, under these assumptions all price changes are associated with order flow,

and there is no public information component.

4.1.1 The model with algorithmic trading

muu2

mu1

mud2m0

A0 A1

B0

B1

θ

Now we introduce an algorithm that can buy the w1 information at zero cost (c = 0).

The results at t = 0 remain unchanged. At t = 1, the algorithm optimally issues a new quote.

To illustrate the idea, suppose w1 > 0. The algorithm knows that it is the only liquidity

provider in possession of w1, and so it puts in a new bid equal to m0 − θ. If w2 > 0 as well,

then a transaction takes place at the original ask of m0 + 2ε. If w2 < 0, then a liquidity

demander will hit the algorithm’s bid. This bid is below the efficient price, so there will

eventually be a reversal, and there is a temporary component in prices. Contrariwise, if

w1 < 0, the algorithm places a new ask at m0 + θ, which is traded with if it turns out that

w2 > 0.

In the presence of algorithmic trading, part of the change in the efficient price is

revealed through a quote update without trade. Public information now accounts for a

portion of price discovery, and imputed revenue to liquidity suppliers is now positive. Thus,

the model can explain even the surprising empirical findings on realized spreads and trade-

correlated price moves. The model also delivers narrower quoted spreads and more frequent

trades, both of which are also observed in the data.

22

3 After AT

We introduce a machine that can buy the w1 information at zero cost (c = 0).All above is unchanged except that the machine issues a new quote at t = 1. Toillustrate the idea, suppose w1 > 0. The machine, if alone, enjoys full marketpower and rationally puts in a new bid of mu

1 −ε−θ as depicted in the followinggraph:

muu2

mu1

mud2m0

A0 A1

B0

B1

θ

In this case, we have the following outcomes:

probability state efficient transactionprice price

.25 uu muu2 muu

2

.25 ud mud2 = mdu

2 mud2 − θ

.50 du mdu2 = mud

2 mdu2 + θ

.25 dd mdd2 mdd

2

And, estimating the Hasbrouck model gives:

Pa − Pb = w1 + εu− I[mud2 ,mdu

2 ]θsign(w1), u ∈ {1,−1} is the trade sign, (3)

where the first two terms contain information and the last term is a transientprice change (reflecting the machine’s market rent). We see that the variance ofthe efficient price innovations is unchanged, but the decomposition now assignshalf the value to public information (due to the quote update) and the other halfto order flow. And, the last term introduces pricing errors, which are absent inthe pre-AT era.

References

Boehmer, E., and E. Kelley. 2007. “Institutional Investors and the Informa-tional Efficiency of Prices.” Technical Report, Texas A&M University. AFA2007 Paper.

Hasbrouck, J. 1993. “Assessing the Quality of a Security Market: A NewApproach to Transaction-Cost Measurement.” Review of Financial Studies6:191–212.

3

I at t = 1 public information enters quotes, but midquotebecomes “noisy” measure of true value

I no unrealized private value

Page 19: Does Algorithmic Trading Improve Liquidity?

Interpretation: generalized Roll model (ctd)

Efficient price is revealed without trades i.e. public informationenters quotes without trades

Revenue to liquidity suppliers is positive

Also matches other findings: more frequent trades, narrowerquotes

Note: model assumes that algo competition is less intense thathuman competition

Page 20: Does Algorithmic Trading Improve Liquidity?

Conclusion

1. Panel regressions time-series increases in algo tradingcorrelate with liquidity improvement

2. Staggered introduction of structural change (autoquote) asan instrument confirms algo trading lowers trading costand increases price informativeness

3. Surprisingly, revenues to liquidity suppliers increase withalgo trading. Market power for some period afterintroduction?

Page 21: Does Algorithmic Trading Improve Liquidity?

Does Algorithmic Trading Improve Liquidity?

Terry Hendershott1 Charles M. Jones2 Albert J. Menkveld3

1Haas School of Business, UC Berkeley

2Graduate School of Business, Columbia University

3Tinbergen Institute, VU University Amsterdam

WFA, June 2008

Page 22: Does Algorithmic Trading Improve Liquidity?

Almgren, R. and N. Chriss (2000).Optimal execution of portfolio transactions.Journal of Risk 3, 5–39.

Bertsimas, D. and A. Lo (1998).Optimal control of execution costs.Journal of Financial Markets 1, 1–50.

Biais, B., D. Martimort, and J. Rochet (2000).Competing mechanisms in a common value environment.Econometrica 68, 799–837.

Boehmer, E., G. Saar, and L. Yu (2005).Lifting the veil: An analysis of pre-trade transparency at the nyse.Journal of Finance 60, 783–815.

Copeland, T. and D. Galai (1983).Information effects on the bid-ask spread.Journal of Finance 38, 1457–1469.

Foucault, T., A. Roell, and P. Sandas (2003).Market making with costly monitoring: An analysis of the soes controversy.Review of Financial Studies 16, 345–384.

Griffiths, M., B. Smith, D. Turnbull, and R. White (2000).The costs and determinants of order aggressiveness.Journal of Financial Economics 56, 65–88.

Harris, L. (1998).Optimal dynamic order submission strategies in some stylized trading problems.Financial Markets, Institutions, and Instruments 7, 1–76.

Hasbrouck, J. (1991a).Measuring the information content of stock trades.Journal of Finance 46, 179–207.

Page 23: Does Algorithmic Trading Improve Liquidity?

Hasbrouck, J. (1991b).The summary informativeness of stock trades: An econometric analysis.Review of Financial Studies 4, 571–595.

Hasbrouck, J. and G. Saar (2007).Technology and liquidity provision: The blurring of traditional definitions.Technical report, New York University.

Keim, D. and A. Madhavan (1995).Anatomy of the trading process: Empirical evidence on the behavior of institutional traders.

Journal of Financial Economics 37, 371–398.

Kyle, A. (1985).Continuous auctions and insider trading.Econometrica 53, 1315–1335.

Lin, J., G. Sanger, and G. Booth (1995).Trade size and components of the bid-ask spread.Review of Financial Studies 8, 1153–1183.

Lo, W., A. MacKinlay, and J. Zhang (2002).Econometric models of limit-order executions.Journal of Financial Economics 65, 31–71.

Obizhaeva, A. and J. Wang (2005).Optimal trading strategy and supply/demand dynamics.Technical report, MIT.

Rock, K. (1990).The specialist’s order book and price anomalies.Technical report, Harvard University.