{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:01:46Z","timestamp":1781071306126,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T00:00:00Z","timestamp":1635897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC Centre for Doctoral Training in Mathematics of Random Systems","award":["EP\/S023925\/1"],"award-info":[{"award-number":["EP\/S023925\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,3]]},"DOI":"10.1145\/3490354.3494397","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T03:50:06Z","timestamp":1651722606000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Interactions of market making algorithms"],"prefix":"10.1145","author":[{"given":"Wei","family":"Xiong","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rama","family":"Cont","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3559308"},{"key":"e_1_3_2_1_2_1","volume-title":"Church","author":"Ackert Lucy F","year":"1998","unstructured":"Lucy F Ackert and Bryan K . Church . 1998 . Competitiveness and Price. Federal Reserve Bank of Atlanta Economic Review ( 1998). Lucy F Ackert and Bryan K. Church. 1998. Competitiveness and Price. Federal Reserve Bank of Atlanta Economic Review (1998)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907353"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3386\/w28535"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20190623"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1994.tb04782.x"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1257\/jep.9.3.199"},{"key":"e_1_3_2_1_8_1","volume-title":"Algorithms: How they can reduce competition and harm consumers. Technical Report.","author":"Markets Authority Competition","year":"2021","unstructured":"Competition & Markets Authority . 2021 . Algorithms: How they can reduce competition and harm consumers. Technical Report. Competition & Markets Authority. 2021. Algorithms: How they can reduce competition and harm consumers. Technical Report."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/mafi.12325"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1257\/jep.29.2.191"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/2329563"},{"key":"e_1_3_2_1_12_1","article-title":"Sustainable and Unchallenged Algorithmic Tacit Collusion","volume":"17","author":"Ezrachi Ariel","year":"2020","unstructured":"Ariel Ezrachi and Maurice E. Stucke . 2020 . Sustainable and Unchallenged Algorithmic Tacit Collusion . Nw. J. Tech. and Intell. Prop. 17 , 2 (2020). Ariel Ezrachi and Maurice E. Stucke. 2020. Sustainable and Unchallenged Algorithmic Tacit Collusion. Nw. J. Tech. and Intell. Prop. 17, 2 (2020).","journal-title":"Nw. J. Tech. and Intell. Prop."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.38.2.121"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11794"},{"key":"e_1_3_2_1_15_1","volume-title":"Reinforcement Learning for Market Making in a Multi-agent Dealer Market. NeurIPS","author":"Ganesh Sumitra","year":"2019","unstructured":"Sumitra Ganesh , Nelson Vadori , Mengda Xu , Hua Zheng , Prashant Reddy , and Manuela Veloso . 2019. Reinforcement Learning for Market Making in a Multi-agent Dealer Market. NeurIPS ( 2019 ). arXiv:1911.05892 http:\/\/arxiv.org\/abs\/1911.05892 Sumitra Ganesh, Nelson Vadori, Mengda Xu, Hua Zheng, Prashant Reddy, and Manuela Veloso. 2019. Reinforcement Learning for Market Making in a Multi-agent Dealer Market. NeurIPS (2019). arXiv:1911.05892 http:\/\/arxiv.org\/abs\/1911.05892"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/2032478"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-405X(85)90044-3"},{"key":"e_1_3_2_1_18_1","unstructured":"Bingyan Han. 2021. Understanding algorithmic collusion with experience replay. (2021). arXiv:2102.09139 http:\/\/arxiv.org\/abs\/2102.09139  Bingyan Han. 2021. Understanding algorithmic collusion with experience replay. (2021). arXiv:2102.09139 http:\/\/arxiv.org\/abs\/2102.09139"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3785966"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the fifteenth international conference on machine learning 242","author":"Hu Junling","year":"1998","unstructured":"Junling Hu and Michael P Wellman . 1998 . Multiagent reinforcement learning: Theoretical framework and an algorithm . Proceedings of the fifteenth international conference on machine learning 242 (1998), 250. Junling Hu and Michael P Wellman. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. Proceedings of the fifteenth international conference on machine learning 242 (1998), 250."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3046405"},{"key":"e_1_3_2_1_22_1","volume-title":"3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings","author":"Diederik","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Lei Ba. 2015. Adam: A method for stochastic optimization . 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings ( 2015 ), 1--15. arXiv:1412.6980 Diederik P. Kingma and Jimmy Lei Ba. 2015. Adam: A method for stochastic optimization. 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings (2015), 1--15. arXiv:1412.6980"},{"key":"e_1_3_2_1_23_1","volume-title":"Multi-agent actor-critic for mixed cooperative-competitive environments. Advances in Neural Information Processing Systems 2017-Decem","author":"Lowe Ryan","year":"2017","unstructured":"Ryan Lowe , Yi Wu , Aviv Tamar , Jean Harb , Pieter Abbeel , and Igor Mordatch . 2017. Multi-agent actor-critic for mixed cooperative-competitive environments. Advances in Neural Information Processing Systems 2017-Decem ( 2017 ), 6380--6391. arXiv:1706.02275 Ryan Lowe, Yi Wu, Aviv Tamar, Jean Harb, Pieter Abbeel, and Igor Mordatch. 2017. Multi-agent actor-critic for mixed cooperative-competitive environments. Advances in Neural Information Processing Systems 2017-Decem (2017), 6380--6391. arXiv:1706.02275"},{"key":"e_1_3_2_1_24_1","first-page":"75","article-title":"The Implications of Algorithmic Pricing for Coordinated Effects Analysis and Price Discrimination Markets in Antitrust Enforcement","volume":"32","author":"McSweeny Terrell","year":"2017","unstructured":"Terrell McSweeny and Brian O'Dea . 2017 . The Implications of Algorithmic Pricing for Coordinated Effects Analysis and Price Discrimination Markets in Antitrust Enforcement . Antitrust 32 , 1 (2017), 75 . Terrell McSweeny and Brian O'Dea. 2017. The Implications of Algorithmic Pricing for Coordinated Effects Analysis and Price Discrimination Markets in Antitrust Enforcement. Antitrust 32, 1 (2017), 75.","journal-title":"Antitrust"},{"key":"e_1_3_2_1_25_1","unstructured":"Volodymyr Mnih Koray Kavukcuoglu David Silver Alex Graves Ioannis Antonoglou Daan Wierstra and Martin Riedmiller. 2013. Playing Atari with Deep Reinforcement Learning. (2013) 1--9. arXiv:1312.5602 http:\/\/arxiv.org\/abs\/1312.5602  Volodymyr Mnih Koray Kavukcuoglu David Silver Alex Graves Ioannis Antonoglou Daan Wierstra and Martin Riedmiller. 2013. Playing Atari with Deep Reinforcement Learning. (2013) 1--9. arXiv:1312.5602 http:\/\/arxiv.org\/abs\/1312.5602"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"e_1_3_2_1_27_1","volume-title":"Algorithms and collusion. Oecd","author":"OECD.","year":"2017","unstructured":"OECD. 2017. Algorithms and collusion. Oecd ( 2017 ), 1--66. www.oecd.org\/competition\/algorithms-collusion-competition-policy-in-the-digital-age.htm OECD. 2017. Algorithms and collusion. Oecd (2017), 1--66. www.oecd.org\/competition\/algorithms-collusion-competition-policy-in-the-digital-age.htm"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2993855"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3232631"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jedc.2008.01.003"},{"key":"e_1_3_2_1_31_1","unstructured":"Christopher J C H Watkins. 1989. Learning from delayed rewards. 233--235 pages.  Christopher J C H Watkins. 1989. Learning from delayed rewards. 233--235 pages."}],"event":{"name":"ICAIF'21: 2nd ACM International Conference on AI in Finance","location":"Virtual Event","acronym":"ICAIF'21","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the Second ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490354.3494397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490354.3494397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:42Z","timestamp":1750188642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490354.3494397"}},"subtitle":["a study on perceived collusion"],"short-title":[],"issued":{"date-parts":[[2021,11,3]]},"references-count":31,"alternative-id":["10.1145\/3490354.3494397","10.1145\/3490354"],"URL":"https:\/\/doi.org\/10.1145\/3490354.3494397","relation":{},"subject":[],"published":{"date-parts":[[2021,11,3]]},"assertion":[{"value":"2022-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}