Optimal Execution Algorithms: TWAP, VWAP & Market Impact › Execution Algorithms and Optimal Execution

When a portfolio manager decides to buy one million shares of a stock, the real challenge has just begun. Sending that order to an exchange is only the first step. As we explored in the previous chapter on market microstructure and as we examined in depth in our discussion of transaction costs and market impact, your large orders move markets. The very act of buying pushes prices higher, eroding the alpha that motivated the trade in the first place.

Execution algorithms emerged to solve this fundamental problem. Unlike the alpha-seeking strategies we covered in Part VI, execution algorithms have a different objective. They take a given trading decision as input and focus purely on minimizing the cost of implementation. A portfolio manager might use machine learning to identify an undervalued stock, but the execution algorithm's job is to buy that stock as cheaply as possible, not to question whether it should be bought at all. This chapter develops the theory and practice of optimal execution. We begin with simple schedule-based algorithms like TWAP and VWAP, progress to implementation shortfall frameworks, and culminate in the Almgren-Chriss model, which provides a rigorous mathematical foundation for balancing the competing costs that execution traders face. Understanding these algorithms is essential for anyone building or evaluating quantitative trading systems, as execution quality often determines whether a profitable strategy remains profitable after accounting for real-world frictions.