没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论
Algorithm Selection: A Quantitative Approach
JIAN YANG AND BRETT JIU
April 25, 2006
Abstract
The widespread use of algorithmic trading has led to the question of whether the most suitable
algorithm is always being used. We propose a practical framework to help traders qualitatively
characterize algorithms as well as quantitatively evaluate comparative performance among vari-
ous algorithms. We demonstrate the applicability of the quantitative model using historical data
from orders executed through ITG Algorithms.
BRETT JIU is a senior research analyst at ITG Solutions Network, Inc., 44 Farnsworth
Street, Boston MA 02210, Tel: (617)-692-6741; E-mail:
bjiu@itginc.com
J
IAN YANG is a senior vice president at ITG Solutions Network, Inc., 44 Farnsworth
Street, Boston MA 02210, Tel: (617)-692-6860; E-mail:
jyang@itginc.com
The authors wish to thank Milan Borkovec, Gabe Butler, Vitaly Serbin, Xiangyang Wang, James Wong, Henry
Yegerman and Ian Domowitz all of ITG Inc., as well as Yingchuan Wang for their support and comments. The
information contained herein is for informational purposes only. Nothing herein is investment advice as de-
fined by the Investment Advisers Act of 1940. ITG Inc. does not guarantee its accuracy or completeness and
ITG Inc. does not make any warranties regarding results from usage. Any opinions expressed herein reflect
the judgment of the authors at the time of publication and are subject to change without notice and may not
reflect the opinion of ITG Inc. This communication is neither an offer to sell nor a solicitation of an offer to
buy any security or financial instrument in any jurisdiction where such offer or solicitation would be illegal.
All trademarks not owned by ITG are owned by their respective owners.
© 2006, ITG Inc. Member NASD, SIPC. All rights reserved. Compliance #22206-64331
he relentless pursuit of lower transaction costs has led to increasing demand for sophis-
ticated trading tools and algorithms, which in turn has led to an explosion in the num-
ber of algorithmic products offered in the marketplace today. Yang and Borkovec
[2005] predict that this trend will continue as more investment management firms em-
brace best execution as a top priority.
T
Having more algorithms at their disposal offers traders both opportunities and challenges.
On the up side, a trader now has the opportunity to pick the suitable algorithm that will most
likely achieve the trading objective for each order. On the down side, the number of algorithm
choices can be so large as to make it difficult to make a quick and correct choice.
1
Adding to the algorithm selection challenge is the fact that algorithms offered by sell-side
vendors usually come in the form of a “black box,” with inner workings hidden to the end users.
Because of this lack of transparency, users may find it difficult to clearly understand the per-
formance characteristics of a particular algorithm, which, in turn, further complicates the algo-
rithm selection decision.
Instead of looking inside an algorithm, we propose a systematic, quantitative approach to
evaluating an algorithm’s historical performance by identifying the determining factors of rela-
tive performance across alternative algorithms, and we present a framework for algorithmic se-
lection based on these underlying factors. Our methodology is easy to implement in practice and
provides a quantitative framework for conducting performance attribution on algorithmic prod-
ucts. We will demonstrate how we perform empirical analysis on the algorithm performance and
how we turn historical data-based model parameters into forward-looking algorithm selection
criteria. Our proposed approach can also help investment managers and traders become more
proactive in selecting algorithms that are of the highest value to them, and help to ensure the
alignment of algorithmic trading with their investment objectives.
ALGORITHMIC STRATEGY SPECTRUM
The significance of conducting pre-trade “homework” on algorithms is well understood.
The need to understand the nature of an algorithm starts at the point when an algorithm is offered
by a third-party vendor. We begin our discussion of algorithm choice with a look at how algo-
rithms can be categorized.
2
At its core, a trading algorithm takes an order, or trade list, and structures a sequence of
trades that aim to achieve the objectives of the user, e.g., minimizing cost (vis-à-vis a specific
benchmark), maximizing fill rate, or minimizing execution risk. Domowitz and Yegerman
[2005a] suggest that, at the most abstract level, the different kinds of algorithms can be thought
of as occupying a trade structure continuum, ranging from the less structured to the very struc-
tured. In Exhibit 1, we divide this range into three categories.
EXHIBIT 1
Spectrum of Algorithmic Strategies
Less structured More structured
Opportunistic Evaluative Schedule-driven
• ITG Active
• ITG Real Time
Volume Participation
• ITG ACE
®
• ITG Horizon (VWAP)
• IT
G
T
W
AP
E
xamples:
On the less structured side, we find strategies that can be called opportunistic, in the
sense that these strategies do not have pre-defined execution schedules; instead, they utilize real-
time information to actively search for optimal times when trades can be executed. These strate-
gies create execution schedules as they go along. At the beginning of an order, a trader does not
know what the execution schedule will look like. An example is ITG Active (formerly known as
ITG activePeg
®
to clients), an algorithm that employs sophisticated agent-like logic to continu-
ously search for liquidity opportunities.
At the other extreme – on the more structured end – are algorithms that follow precisely-
defined execution schedules; we call these algorithms schedule-driven strategies. The schedules
are based on historical data, pre-programmed into the strategy’s logic and, save for small updates
which incorporate real-time information, are followed precisely in optimizing trade entries. All
VWAP- and TWAP-based strategies, for example, can be categorized this way. The realized
3
trade schedule will be similar to the pre-defined one, absent significant, unusual changes in li-
quidity over the order horizon.
Between these two ends is a category that we call evaluative strategies. Not surprisingly,
these strategies combine approaches of both opportunistic and schedule-driven algorithms. At
the macro level, these algorithms suggest how to optimally slice a large order in different time
intervals, for example, half-hour bins. At the micro level, intelligent rules – often quantitative in
nature – are employed to execute each part of the original order while balancing the tradeoff be-
tween cost and risk. Oftentimes these micro rules require the input of substantial real-time in-
formation, which makes them similar to opportunistic strategies. The trader will have a good
idea of what the execution trajectory may look like, but the ex post trajectory may differ little or
greatly from the ex ante prediction. An example is ITG ACE, a highly quantitative strategy that
actively evaluates the potential price impact of each slice and continuously adjusts how and
when each slice of the big order is executed in order to minimize the impact.
While our three-part categorization of algorithms is only a guide,
2
dividing algorithms
into different categories is a necessary first step in deciphering the nature of the myriad strategies
available. It is important to see beyond general descriptions and get a clear sense of what kind of
strategy any given algorithm is at its core.
ALGORITHM SELECTION: A QUANTITATIVE FRAMEWORK
Given the availability of a basket of algorithmic strategies, attention is now turned to or-
der-specific pre-trade analysis. Specifically, there are two questions concerning algorithm selec-
tion:
1. Is the order at hand suitable for algorithmic trading?
2. If so, which algorithm is the optimal one for trading this order?
It is well known that not all orders can be traded using an algorithmic approach. This is
because, essentially, algorithms are pre-programmed logic run on computers. As such, algo-
rithmic trading is not, and will never be, the magic bullet that solves all transaction cost-related
problems. This is an important pre-trade analysis issue that is beyond the scope of this paper; in-
stead, we focus on the optimal algorithm selection question.
4
剩余15页未读,继续阅读
资源评论
spacetoicpr
- 粉丝: 0
- 资源: 4
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功