{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:42:36Z","timestamp":1778906556034,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,2]]},"DOI":"10.1145\/3533271.3561692","type":"proceedings-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T22:20:22Z","timestamp":1666304422000},"page":"334-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Risk-Aware Linear Bandits with Application in Smart Order Routing"],"prefix":"10.1145","author":[{"given":"Jingwei","family":"Ji","sequence":"first","affiliation":[{"name":"University of Southern California, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renyuan","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Southern California, CN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruihao","family":"Zhu","sequence":"additional","affiliation":[{"name":"Cornell University, US"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"D\u00e1vid P\u00e1l, and Csaba Szepesv\u00e1ri.","author":"\u00a0al Abbasi-Yadkori","year":"2011","unstructured":"Abbasi-Yadkori et \u00a0al . ( 2011 ) Yasin Abbasi-Yadkori , D\u00e1vid P\u00e1l, and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. Advances in neural information processing systems 24 (2011), 2312\u20132320. Abbasi-Yadkori et\u00a0al. (2011) Yasin Abbasi-Yadkori, D\u00e1vid P\u00e1l, and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. Advances in neural information processing systems 24 (2011), 2312\u20132320."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 9\u201316","author":"\u00a0al Agarwal","year":"2010","unstructured":"Agarwal et \u00a0al . ( 2010 ) Alekh Agarwal, Peter Bartlett, and Max Dama. 2010. Optimal allocation strategies for the dark pool problem . In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 9\u201316 . Agarwal et\u00a0al. (2010) Alekh Agarwal, Peter Bartlett, and Max Dama. 2010. Optimal allocation strategies for the dark pool problem. In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 9\u201316."},{"key":"e_1_3_2_1_3_1","first-page":"1453","article-title":"Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, and Assaf Zeevi. 2019. Mnl-bandit: A dynamic learning approach to assortment selection","volume":"67","author":"\u00a0al Agrawal","year":"2019","unstructured":"Agrawal et \u00a0al . ( 2019 ) Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, and Assaf Zeevi. 2019. Mnl-bandit: A dynamic learning approach to assortment selection . Operations Research 67 , 5 (2019), 1453 \u2013 1485 . Agrawal et\u00a0al. (2019) Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, and Assaf Zeevi. 2019. Mnl-bandit: A dynamic learning approach to assortment selection. Operations Research 67, 5 (2019), 1453\u20131485.","journal-title":"Operations Research"},{"key":"e_1_3_2_1_4_1","first-page":"397","article-title":"Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs","author":"Auer","year":"2002","unstructured":"Auer ( 2002 ) Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs . Journal of Machine Learning Research 3 , Nov (2002), 397 \u2013 422 . Auer (2002) Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research 3, Nov (2002), 397\u2013422.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_3_2_1_5_1","volume-title":"Bastien Baldacci and Iuliia Manziuk","author":"Manziuk Baldacci","year":"2020","unstructured":"Baldacci and Manziuk ( 2020 ) Bastien Baldacci and Iuliia Manziuk . 2020. Adaptive trading strategies across liquidity pools. arXiv preprint arXiv:2008.07807(2020). Baldacci and Manziuk (2020) Bastien Baldacci and Iuliia Manziuk. 2020. Adaptive trading strategies across liquidity pools. arXiv preprint arXiv:2008.07807(2020)."},{"key":"e_1_3_2_1_6_1","first-page":"21","article-title":"Rama Cont and Arseniy Kukanov. 2017. Optimal order placement in limit order markets","volume":"17","author":"Kukanov Cont","year":"2017","unstructured":"Cont and Kukanov ( 2017 ) Rama Cont and Arseniy Kukanov. 2017. Optimal order placement in limit order markets . Quantitative Finance 17 , 1 (2017), 21 \u2013 39 . Cont and Kukanov (2017) Rama Cont and Arseniy Kukanov. 2017. Optimal order placement in limit order markets. Quantitative Finance 17, 1 (2017), 21\u201339.","journal-title":"Quantitative Finance"},{"key":"e_1_3_2_1_7_1","volume-title":"Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein.","author":"\u00a0al Cormen","year":"2009","unstructured":"Cormen et \u00a0al . ( 2009 ) Thomas\u00a0H. Cormen , Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. In MIT Press . Cormen et\u00a0al. (2009) Thomas\u00a0H. Cormen, Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. In MIT Press."},{"key":"e_1_3_2_1_8_1","volume-title":"Thomas\u00a0P Hayes, and Sham\u00a0M Kakade.","author":"\u00a0al Dani","year":"2008","unstructured":"Dani et \u00a0al . ( 2008 ) Varsha Dani , Thomas\u00a0P Hayes, and Sham\u00a0M Kakade. 2008. Stochastic linear optimization under bandit feedback. (2008). Dani et\u00a0al. (2008) Varsha Dani, Thomas\u00a0P Hayes, and Sham\u00a0M Kakade. 2008. Stochastic linear optimization under bandit feedback. (2008)."},{"key":"e_1_3_2_1_9_1","first-page":"99","article-title":"Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, and Jennifer\u00a0Wortman Vaughan. 2010. Censored exploration and the dark pool problem","volume":"53","author":"\u00a0al Ganchev","year":"2010","unstructured":"Ganchev et \u00a0al . ( 2010 ) Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, and Jennifer\u00a0Wortman Vaughan. 2010. Censored exploration and the dark pool problem . Commun. ACM 53 , 5 (2010), 99 \u2013 107 . Ganchev et\u00a0al. (2010) Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, and Jennifer\u00a0Wortman Vaughan. 2010. Censored exploration and the dark pool problem. Commun. ACM 53, 5 (2010), 99\u2013107.","journal-title":"Commun. ACM"},{"key":"e_1_3_2_1_10_1","volume-title":"Renyuan Xu, and Huining Yang.","author":"\u00a0al Hambly","year":"2021","unstructured":"Hambly et \u00a0al . ( 2021 ) Ben Hambly , Renyuan Xu, and Huining Yang. 2021. Recent advances in reinforcement learning in finance. arXiv preprint arXiv:2112.04553(2021). Hambly et\u00a0al. (2021) Ben Hambly, Renyuan Xu, and Huining Yang. 2021. Recent advances in reinforcement learning in finance. arXiv preprint arXiv:2112.04553(2021)."},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on Machine Learning. PMLR, 2800\u20132809","author":"\u00a0al Hsieh","year":"2019","unstructured":"Hsieh et \u00a0al . ( 2019 ) Ping-Chun Hsieh, Xi Liu, Anirban Bhattacharya, and PR Kumar. 2019. Stay with me: Lifetime maximization through heteroscedastic linear bandits with reneging . In International Conference on Machine Learning. PMLR, 2800\u20132809 . Hsieh et\u00a0al. (2019) Ping-Chun Hsieh, Xi Liu, Anirban Bhattacharya, and PR Kumar. 2019. Stay with me: Lifetime maximization through heteroscedastic linear bandits with reneging. In International Conference on Machine Learning. PMLR, 2800\u20132809."},{"key":"e_1_3_2_1_12_1","volume-title":"Tor Lattimore and Csaba Szepesv\u00e1ri","author":"Szepesv\u00e1ri Lattimore","year":"2020","unstructured":"Lattimore and Szepesv\u00e1ri ( 2020 ) Tor Lattimore and Csaba Szepesv\u00e1ri . 2020. Bandit algorithms. Cambridge University Press . Lattimore and Szepesv\u00e1ri (2020) Tor Lattimore and Csaba Szepesv\u00e1ri. 2020. Bandit algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 19th international conference on World wide web. 661\u2013670","author":"\u00a0al Li","year":"2010","unstructured":"Li et \u00a0al . ( 2010 ) Lihong Li, Wei Chu, John Langford, and Robert\u00a0E Schapire. 2010. A contextual-bandit approach to personalized news article recommendation . In Proceedings of the 19th international conference on World wide web. 661\u2013670 . Li et\u00a0al. (2010) Lihong Li, Wei Chu, John Langford, and Robert\u00a0E Schapire. 2010. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web. 661\u2013670."},{"key":"e_1_3_2_1_14_1","first-page":"7791","article-title":"Harry Markowitz. 1952. Portfolio selection","volume":"7","author":"Markowitz","year":"1952","unstructured":"Markowitz ( 1952 ) Harry Markowitz. 1952. Portfolio selection . The Journal of Finance 7 , 1 (1952), 7791 . Markowitz (1952) Harry Markowitz. 1952. Portfolio selection. The Journal of Finance 7, 1 (1952), 7791.","journal-title":"The Journal of Finance"},{"key":"e_1_3_2_1_15_1","volume-title":"Tobias Preis","author":"Preis","year":"2011","unstructured":"Preis ( 2011 ) Tobias Preis . 2011. Price-time priority and pro rata matching in an order book model of financial markets. In Econophysics of Order-driven Markets. Springer , 65\u201372. Preis (2011) Tobias Preis. 2011. Price-time priority and pro rata matching in an order book model of financial markets. In Econophysics of Order-driven Markets. Springer, 65\u201372."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/1540-6261.00453"},{"key":"e_1_3_2_1_17_1","volume-title":"Alessandro Lazaric, and R\u00e9mi Munos.","author":"\u00a0al Sani","year":"2012","unstructured":"Sani et \u00a0al . ( 2012 ) Amir Sani , Alessandro Lazaric, and R\u00e9mi Munos. 2012. Risk-Aversion in Multi-armed Bandits. In NIPS. Sani et\u00a0al. (2012) Amir Sani, Alessandro Lazaric, and R\u00e9mi Munos. 2012. Risk-Aversion in Multi-armed Bandits. In NIPS."},{"key":"e_1_3_2_1_18_1","volume-title":"Jun Wang, Yu-Gang Jiang, and Hongyuan Zha.","author":"\u00a0al Shen","year":"2015","unstructured":"Shen et \u00a0al . ( 2015 ) Weiwei Shen , Jun Wang, Yu-Gang Jiang, and Hongyuan Zha. 2015. Portfolio choices with orthogonal bandit learning. In Twenty-fourth international joint conference on artificial intelligence. Shen et\u00a0al. (2015) Weiwei Shen, Jun Wang, Yu-Gang Jiang, and Hongyuan Zha. 2015. Portfolio choices with orthogonal bandit learning. In Twenty-fourth international joint conference on artificial intelligence."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 30th International Conference on Machine Learning.","year":"2013","unstructured":"Shipra\u00a0Agrawal ( 2013 ) Navin\u00a0Goyal Shipra\u00a0Agrawal. 2013. Thompson Sampling for Contextual Bandits with Linear Payoffs . In Proceedings of the 30th International Conference on Machine Learning. Shipra\u00a0Agrawal (2013) Navin\u00a0Goyal Shipra\u00a0Agrawal. 2013. Thompson Sampling for Contextual Bandits with Linear Payoffs. In Proceedings of the 30th International Conference on Machine Learning."},{"key":"e_1_3_2_1_20_1","volume-title":"Prashanth L.A.,, and Krishna Jagannathan.","author":"\u00a0al Tan","year":"2022","unstructured":"Tan et \u00a0al . ( 2022 ) Vincent Y.\u00a0F. Tan , Prashanth L.A.,, and Krishna Jagannathan. 2022. A Survey of Risk-Aware Multi-Armed Bandits. In IJCAI-ECAI. Tan et\u00a0al. (2022) Vincent Y.\u00a0F. Tan, Prashanth L.A.,, and Krishna Jagannathan. 2022. A Survey of Risk-Aware Multi-Armed Bandits. In IJCAI-ECAI."},{"key":"e_1_3_2_1_21_1","first-page":"6","article-title":"Sattar Vakili and Qing Zhao. 2016. Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure","volume":"10","author":"Zhao Vakili","year":"2016","unstructured":"Vakili and Zhao ( 2016 ) Sattar Vakili and Qing Zhao. 2016. Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure . IEEE Journal of Selected Topics in Signal Processing 10 , 6 (Sep 2016), 1093\u20131111. https:\/\/doi.org\/10.1109\/jstsp.2016.2592622 10.1109\/jstsp.2016.2592622 Vakili and Zhao (2016) Sattar Vakili and Qing Zhao. 2016. Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure. IEEE Journal of Selected Topics in Signal Processing 10, 6 (Sep 2016), 1093\u20131111. https:\/\/doi.org\/10.1109\/jstsp.2016.2592622","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"e_1_3_2_1_22_1","first-page":"1466","article-title":"Xun\u00a0Yu Zhou and George Yin. 2003. Markowitz\u2019s mean-variance portfolio selection with regime switching: A continuous-time model","volume":"42","author":"Yin Zhou","year":"2003","unstructured":"Zhou and Yin ( 2003 ) Xun\u00a0Yu Zhou and George Yin. 2003. Markowitz\u2019s mean-variance portfolio selection with regime switching: A continuous-time model . SIAM Journal on Control and Optimization 42 , 4 (2003), 1466 \u2013 1482 . Zhou and Yin (2003) Xun\u00a0Yu Zhou and George Yin. 2003. Markowitz\u2019s mean-variance portfolio selection with regime switching: A continuous-time model. SIAM Journal on Control and Optimization 42, 4 (2003), 1466\u20131482.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning.","author":"Tan Zhu","year":"2020","unstructured":"Zhu and Tan ( 2020 ) Qiuyu Zhu and Vincent Y.\u00a0F. Tan. 2020. Thompson Sampling Algorithms for Mean-Variance Bandits . In Proceedings of the 37th International Conference on Machine Learning. Zhu and Tan (2020) Qiuyu Zhu and Vincent Y.\u00a0F. Tan. 2020. Thompson Sampling Algorithms for Mean-Variance Bandits. In Proceedings of the 37th International Conference on Machine Learning."},{"key":"e_1_3_2_1_24_1","volume-title":"Ruihao Zhu and Branislav Kveton","author":"Kveton Zhu","year":"2022","unstructured":"Zhu and Kveton ( 2022 ) Ruihao Zhu and Branislav Kveton . 2022. Safe Data Collection for Offline and Online Policy Learning. In arXiv:2111.04835 [cs.LG]. Zhu and Kveton (2022) Ruihao Zhu and Branislav Kveton. 2022. Safe Data Collection for Offline and Online Policy Learning. In arXiv:2111.04835 [cs.LG]."}],"event":{"name":"ICAIF '22: 3rd ACM International Conference on AI in Finance","location":"New York NY USA","acronym":"ICAIF '22","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the Third ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533271.3561692","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3533271.3561692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:38Z","timestamp":1750186838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533271.3561692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,26]]},"references-count":24,"alternative-id":["10.1145\/3533271.3561692","10.1145\/3533271"],"URL":"https:\/\/doi.org\/10.1145\/3533271.3561692","relation":{},"subject":[],"published":{"date-parts":[[2022,10,26]]},"assertion":[{"value":"2022-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}