nips nips2013 nips2013-26 nips2013-26-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Jacob Abernethy, Satyen Kale
Abstract: We consider the design of strategies for market making in an exchange. A market maker generally seeks to profit from the difference between the buy and sell price of an asset, yet the market maker also takes exposure risk in the event of large price movements. Profit guarantees for market making strategies have typically required certain stochastic assumptions on the price fluctuations of the asset in question; for example, assuming a model in which the price process is mean reverting. We propose a class of “spread-based” market making strategies whose performance can be controlled even under worst-case (adversarial) settings. We prove structural properties of these strategies which allows us to design a master algorithm which obtains low regret relative to the best such strategy in hindsight. We run a set of experiments showing favorable performance on recent real-world stock price data. 1
[1] J. Abernethy, Y. Chen, and J. Wortman Vaughan. An optimization-based framework for automated market-making. In Proceedings of the 12th ACM Conference on Electronic Commerce, pages 297–306, 2011.
[2] S. Agrawal, E. Delag, M. Peters, Z. Wang, and Y. Ye. A unified framework for dynamic prediction market design. Operations research, 59(3):550–568, 2011.
[3] A. Blum and A. Kalai. Universal portfolios with and without transaction costs. Machine Learning, 35(3):193–205, 1999.
[4] T. Chakraborty and M. Kearns. Market making and mean reversion. In Proceedings of the 12th ACM conference on Electronic commerce, pages 307–314. ACM, 2011.
[5] Y. Chen and D. M. Pennock. A utility framework for bounded-loss market makers. In Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, pages 49–56, 2007.
[6] Y. Chen and J. Wortman Vaughan. A new understanding of prediction markets via no-regret learning. In Proceedings of the 11th ACM Conference on Electronic Commerce, pages 189– 198, 2010.
[7] T. M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2):348–363, 1996.
[8] S. Das. A learning market-maker in the glosten–milgrom model. Quantitative Finance, 5(2):169–180, 2005.
[9] S. Das. The effects of market-making on price dynamics. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 887–894, 2008.
[10] S. Das and M. Magdon-Ismail. Adapting to a market shock: Optimal sequential marketmaking. In Proceedings of the 21th Annual Conference on Neural Information Processing Systems, pages 361–368, 2008.
[11] L. R. Glosten and P. R. Milgrom. Bid, ask and transaction prices in a specialist market with heterogeneously informed traders. Journal of financial economics, 14(1):71–100, 1985.
[12] R. Hanson. Combinatorial information market design. 5(1):105–119, 2003. Information Systems Frontiers,
[13] R. Hanson. Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets, 1(1):3–15, 2007.
[14] E. Hazan, A. Kalai, S. Kale, and A. Agarwal. Logarithmic regret algorithms for online convex optimization. In Learning Theory, pages 499–513. Springer, 2006.
[15] D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth. On-line portfolio selection using multiplicative updates. Mathematical Finance, 8(4):325–347, 1998.
[16] A. T. Kalai and S. Vempala. Efficient algorithms for universal portfolios. The Journal of Machine Learning Research, 3:423–440, 2003.
[17] A. T. Kalai and S. Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291–307, 2005.
[18] N. Littlestone and M. K. Warmuth. 108(2):212–261, 1994. The weighted majority algorithm. Inf. Comput.,
[19] N. Della Penna and M. D. Reid. Bandit market makers. arXiv preprint arXiv:1112.0076, 2011.
[20] T. M. Cover. Universal portfolios. Mathematical Finance, 1(1):1–29, January 1991. 9