By Kuzman Ganchev, Yuriy nevmyvaka, Michael Kearns, and Jennifer Wortman Vaughan abstract Dark pools are a recent type of stock exchange in which information about outstanding orders is deliberately hidden in order to minimize the market impact of large-volume trades. The success and proliferation of dark pools have created challenging and interesting problems in algorithmic trading-in particular, the problem of optimizing the allocation of a large trade over multiple competing dark pools. In this work, we formalize this optimization as a problem of multi-venue exploration from censored data, and provide a provably efficient and near-optimal algorithm for its solution. Our algorithm and its analysis have much in common with well-studied algorithms for managing the exploration-exploitation trade-off in reinforcement learning. We also provide an extensive experimental evaluation of our algorithm using dark pool execution data from a large brokerage.
Another piece of related work is REF , which presented an algorithm for optimising the amount of trades to be placed over multiple competing dark pools.
Censored exploration and the dark pool problem
CACM
Computer Science Mathematics