{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:20:39Z","timestamp":1767705639517,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["CGS-D Scholarship and Discovery Grant"],"award-info":[{"award-number":["CGS-D Scholarship and Discovery Grant"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007631","name":"Canadian Institute for Advanced Research","doi-asserted-by":"publisher","award":["Canada AI Research Chair (Alberta Machine Intelligence Institute)"],"award-info":[{"award-number":["Canada AI Research Chair (Alberta Machine Intelligence Institute)"]}],"id":[{"id":"10.13039\/100007631","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Digital Research Alliance of Canada","award":["RAC Allocation"],"award-info":[{"award-number":["RAC Allocation"]}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-19-2-0222","CFDA \\\\#12.910 (Air Force Research Laboratory)"],"award-info":[{"award-number":["FA8750-19-2-0222","CFDA \\\\#12.910 (Air Force Research Laboratory)"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Facebook Research"},{"name":"Amazon Research"},{"DOI":"10.13039\/100017637","name":"Simons Institute for the Theory of Computing, University of California Berkeley","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017637","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673644","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"1102-1130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4116-8729","authenticated-orcid":false,"given":"Greg","family":"d'Eon","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4559-5525","authenticated-orcid":false,"given":"Neil","family":"Newman","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7644-5327","authenticated-orcid":false,"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2020","article-title":"Modeling Settlement Bargaining with Algorithmic Game Theory","author":"Abramowicz Michael","year":"2020","unstructured":"Michael Abramowicz. 2020. Modeling Settlement Bargaining with Algorithmic Game Theory. Research Paper 2020-80. GWU Legal Studies.","journal-title":"Research Paper"},{"key":"e_1_3_2_1_2_1","volume-title":"Jordan","author":"Ai Rui","year":"2022","unstructured":"Rui Ai, Boxiang Lyu, Zhaoran Wang, Zhuoran Yang, and Michael I. Jordan. 2022. A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design. arXiv:2210.10278"},{"volume-title":"Multi-Agent Reinforcement Learning: Foundations and Modern Approaches","author":"Albrecht Stefano V.","unstructured":"Stefano V. Albrecht, Filippos Christianos, and Lukas Sch\u00e4fer. 2024. Multi-Agent Reinforcement Learning: Foundations and Modern Approaches. MIT Press. https:\/\/www.marl-book.com","key":"e_1_3_2_1_3_1"},{"unstructured":"Thomas Anthony Tom Eccles Andrea Tacchetti J\u00e1nos Kram\u00e1r Ian Gemp Thomas C. Hudson Nicolas Porcel Marc Lanctot Julien P\u00e9rolat Richard Everett Roman Werpachowski Satinder Singh Thore Graepel and Yoram Bachrach. 2022. Learning to Play No-Press Diplomacy with Best Response Policy Iteration. arXiv:2006.04635 [cs.LG]","key":"e_1_3_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1257\/0002828043052330"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1111\/iere.12431"},{"doi-asserted-by":"crossref","unstructured":"Lawrence M Ausubel Peter Cramton and Paul Milgrom. 2006. The clock-proxy auction: A practical combinatorial auction design. In Handbook of spectrum auction design. MIT 120--140.","key":"e_1_3_2_1_7_1","DOI":"10.1017\/9781316471609.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1126\/science.ade9097"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/3490486.3538244"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.artint.2019.103216"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s10994-022-06179-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1038\/s42256-021-00365-4"},{"key":"e_1_3_2_1_13_1","volume-title":"Computing Bayes-Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging. Operations Research","author":"Bichler Martin","year":"2023","unstructured":"Martin Bichler, Max Fichtl, and Matthias Oberlechner. 2023. Computing Bayes-Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging. Operations Research (2023)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1287\/mnsc.2022.4465"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1613\/jair.1.11525"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3465456.3467609"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1126\/science.1259433"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1126\/science.aao1733"},{"doi-asserted-by":"publisher","unstructured":"Noam Brown and Tuomas Sandholm. 2019a. Solving imperfect-information games via discounted regret minimization. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence (AAAI'19\/IAAI'19\/EAAI'19). AAAI Press Article 225 8 pages. 10.1609\/aaai.v33i01.33011829","key":"e_1_3_2_1_19_1","DOI":"10.1609\/aaai.v33i01.33011829"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1126\/science.aay2400"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1250910.1250949"},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning. PMLR, 1706--1715","author":"D\u00fctting Paul","year":"2019","unstructured":"Paul D\u00fctting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. 2019. Optimal auctions through deep learning. In International Conference on Machine Learning. PMLR, 1706--1715."},{"key":"e_1_3_2_1_23_1","volume-title":"Optimal auctions through deep learning: Advances in differentiable economics. J. ACM","author":"D\u00fctting Paul","year":"2023","unstructured":"Paul D\u00fctting, Zhe Feng, Harikrishna Narasimhan, David C Parkes, and Sai Srivatsa Ravindranath. 2023. Optimal auctions through deep learning: Advances in differentiable economics. J. ACM (2023)."},{"key":"e_1_3_2_1_24_1","volume-title":"Application Procedures for Broadcast Incentive Auction Scheduled to Begin on","author":"FCC.","year":"2016","unstructured":"FCC. 2015. Application Procedures for Broadcast Incentive Auction Scheduled to Begin on March 29, 2016. https:\/\/www.fcc.gov\/document\/application-procedures-broadcast-incentive-auction. FCC Public Notice DA 15-1183 (2015)."},{"unstructured":"FCC. 2019. Auction 102 Clock Phase Technical Guide. https:\/\/www.fcc.gov\/file\/14284\/download. (2019).","key":"e_1_3_2_1_25_1"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS'20)","author":"Flokas Lampros","year":"2020","unstructured":"Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, and Georgios Piliouras. 2020. No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. In Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS'20). Article 117, 12 pages."},{"key":"e_1_3_2_1_27_1","volume-title":"Harsanyi and Reinhard Selten","author":"John","year":"1988","unstructured":"John C. Harsanyi and Reinhard Selten. 1988. A General Theory of Equilibrium Selection in Games. MIT Press."},{"key":"e_1_3_2_1_28_1","volume-title":"Strong Activity Rules for Iterative Combinatorial Auctions. Computers & Operations Research 37 (07","author":"Harsha Pavithra","year":"2010","unstructured":"Pavithra Harsha, Cynthia Barnhart, David Parkes, and Haoqi Zhang. 2010. Strong Activity Rules for Iterative Combinatorial Auctions. Computers & Operations Research 37 (07 2010), 1271--1284."},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"1918","author":"Hartford Jason","year":"2018","unstructured":"Jason Hartford, Devon Graham, Kevin Leyton-Brown, and Siamak Ravanbakhsh. 2018. Deep Models of Interactions Across Sets. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 80), Jennifer Dy and Andreas Krause (Eds.). PMLR, 1909--1918."},{"unstructured":"ISED. 2012. Consultation on a Licensing Framework for Mobile Broadband Services (MBS) --- 700 MHz Band. https:\/\/ised-isde.canada.ca\/site\/spectrum-management-telecommunications\/en\/spectrum-allocation\/auctions\/700-mhz-2014\/consultation-licensing-framework-mobile-broadband-services-mbs-700-mhz-band. (2012). Accessed 2024-02-12.","key":"e_1_3_2_1_30_1"},{"unstructured":"ISED. 2018. Technical Policy and Licensing Framework for Spectrum in the 600 MHz Band. https:\/\/ised-isde.canada.ca\/site\/spectrum-management-telecommunications\/sites\/default\/files\/attachments\/2022\/SLPB-002-18-600MHz-decision-e.pdf. Spectrum Management and Telecommunications SLPB-002-18 (2018). Accessed 2024-02-12.","key":"e_1_3_2_1_31_1"},{"unstructured":"ISED. 2021. Policy and Licensing Framework for Spectrum in the 3500 MHz Band. https:\/\/ised-isde.canada.ca\/site\/spectrum-management-telecommunications\/en\/spectrum-allocation\/policy-and-licensing-framework-spectrum-3500-mhz-band. Spectrum Management and Telecommunications SLPB-001-20 (26 4 2021). Accessed 2024-02-12.","key":"e_1_3_2_1_32_1"},{"unstructured":"ISED. 2022. Policy and Licensing Framework for Spectrum in the 3800 MHz Band. https:\/\/ised-isde.canada.ca\/site\/spectrum-management-telecommunications\/en\/spectrum-allocation\/policy-and-licensing-framework-spectrum-3800-mhz-band. Spectrum Management and Telecommunications SPB-002-22 (06 2022). Accessed 2024-02-12.","key":"e_1_3_2_1_33_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/3269206.3272021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.2307\/1912767"},{"key":"e_1_3_2_1_36_1","volume-title":"Brennan Saeta, James Bradbury, David Ding, Sebastian Borgeaud, Matthew Lai, Julian Schrittwieser, Thomas Anthony, Edward Hughes, Ivo Danihelka, and Jonah Ryan-Davis.","author":"Lanctot Marc","year":"2019","unstructured":"Marc Lanctot, Edward Lockhart, Jean-Baptiste Lespiau, Vinicius Zambaldi, Satyaki Upadhyay, Julien P\u00e9rolat, Sriram Srinivasan, Finbarr Timbers, Karl Tuyls, Shayegan Omidshafiei, Daniel Hennes, Dustin Morrill, Paul Muller, Timo Ewalds, Ryan Faulkner, J\u00e1nos Kram\u00e1r, Bart De Vylder, Brennan Saeta, James Bradbury, David Ding, Sebastian Borgeaud, Matthew Lai, Julian Schrittwieser, Thomas Anthony, Edward Hughes, Ivo Danihelka, and Jonah Ryan-Davis. 2019. OpenSpiel: A Framework for Reinforcement Learning in Games. CoRR abs\/1908.09453 (2019). arXiv:1908.09453 [cs.LG] http:\/\/arxiv.org\/abs\/1908.09453"},{"key":"e_1_3_2_1_37_1","volume-title":"Monte Carlo sampling for regret minimization in extensive games. Advances in neural information processing systems 22","author":"Lanctot Marc","year":"2009","unstructured":"Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling. 2009. Monte Carlo sampling for regret minimization in extensive games. Advances in neural information processing systems 22 (2009)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1257\/aer.20141212"},{"key":"e_1_3_2_1_39_1","volume-title":"Wellman","author":"Li Zun","year":"2023","unstructured":"Zun Li, Marc Lanctot, Kevin R. McKee, Luke Marris, Ian M. Gemp, Daniel Hennes, Paul Muller, K. Larson, Yoram Bachrach, and Michael P. Wellman. 2023. Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning. ArXiv abs\/2302.00797 (2023)."},{"key":"e_1_3_2_1_40_1","volume-title":"OpenAI Pieter Abbeel, and Igor Mordatch","author":"Lowe Ryan","year":"2017","unstructured":"Ryan Lowe, YI WU, Aviv Tamar, Jean Harb, OpenAI Pieter Abbeel, and Igor Mordatch. 2017. Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/68a9750337a418a86fe06c1991a1d64c-Paper.pdf"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1086\/262118"},{"volume-title":"Putting Auction Theory to Work","author":"Milgrom Paul","unstructured":"Paul Milgrom. 2004. Putting Auction Theory to Work. Cambridge University Press.","key":"e_1_3_2_1_42_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1609\/aaai.v35i6.16702"},{"doi-asserted-by":"crossref","unstructured":"Neil Newman Kevin Leyton-Brown Paul Milgrom and Ilya Segal. 2024. Incentive Auction Design Alternatives: A Simulation Study. Management Science. forthcoming.","key":"e_1_3_2_1_44_1","DOI":"10.1287\/mnsc.2020.02489"},{"key":"e_1_3_2_1_45_1","volume-title":"Lin (Eds.)","volume":"33","author":"Nguyen Kim Thang","year":"2020","unstructured":"Kim Thang Nguyen. 2020. A Bandit Learning Algorithm and Applications to Auction Design. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin (Eds.), Vol. 33. Curran Associates, Inc., 12070--12079. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2020\/file\/8ccf1fb8b09a8212bafea305cf5d5e9f-Paper.pdf"},{"doi-asserted-by":"crossref","unstructured":"Alexandre Pacaud Aurelien Bechler and Marceau Coupechoux. 2023. Bidding efficiently in Simultaneous Ascending Auctions with budget and eligibility constraints using Simultaneous Move Monte Carlo Tree Search. arXiv:2307.11428 [cs.GT]","key":"e_1_3_2_1_46_1","DOI":"10.1109\/TG.2024.3424246"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.2139\/ssrn.3844338"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1126\/science.add4679"},{"unstructured":"Fabian R. Pieroth Nils Kohring and Martin Bichler. 2023. Equilibrium Computation in Multi-Stage Auctions and Contests. arXiv:2312.11751","key":"e_1_3_2_1_49_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.3389\/frobt.2016.00040"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1016\/j.artint.2012.09.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1007\/s00199-005-0039-5"},{"key":"e_1_3_2_1_53_1","volume-title":"Proximal Policy Optimization Algorithms. CoRR abs\/1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. CoRR abs\/1707.06347 (2017). arXiv:1707.06347 http:\/\/arxiv.org\/abs\/1707.06347"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1038\/nature16961"},{"key":"e_1_3_2_1_55_1","volume-title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. ArXiv abs\/1712.01815","author":"Silver David","year":"2017","unstructured":"David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, L. Sifre, Dharshan Kumaran, Thore Graepel, Timothy P. Lillicrap, Karen Simonyan, and Demis Hassabis. 2017. Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. ArXiv abs\/1712.01815 (2017)."},{"volume-title":"Advances in Neural Information Processing Systems","author":"Sutton Richard S.","unstructured":"Richard S. Sutton, David McAllester, Satinder Singh, and Yishay Mansour. 1999. Policy Gradient Methods for Reinforcement Learning with Function Approximation. In Advances in Neural Information Processing Systems, S. Solla, T. Leen, and K. M\u00fcller (Eds.), Vol. 12. MIT Press.","key":"e_1_3_2_1_56_1"},{"unstructured":"Oskari Tammelin. 2014. Solving Large Imperfect Information Games Using CFR+. arXiv:1407.5042 [cs.GT]","key":"e_1_3_2_1_57_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.5555\/3171837.3172032"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_59_1","DOI":"10.1111\/sjoe.12441"},{"unstructured":"Vinzenz Thoma Vitor Bosshard and Sven Seuken. 2023a. Computing Perfect Bayesian Equilibria in Sequential Auctions. arXiv:2312.04516","key":"e_1_3_2_1_60_1"},{"unstructured":"Vinzenz Thoma Michael Curry Niao He and Sven Seuken. 2023b. Learning Best Response Policies in Dynamic Auctions via Deep Reinforcement Learning. arXiv:2312.13232","key":"e_1_3_2_1_61_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_62_1","DOI":"10.1609\/aaai.v31i1.10592"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_63_1","DOI":"10.1016\/j.geb.2017.02.009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_64_1","DOI":"10.1145\/3543507.3583523"},{"key":"e_1_3_2_1_65_1","volume-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems","author":"Weiss Michael","year":"2017","unstructured":"Michael Weiss, Benjamin Lubin, and Sven Seuken. 2017. SATS: A Universal Spectrum Auction Test Suite. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. S\u00e3o Paulo, Brazil, 51--59."},{"key":"e_1_3_2_1_66_1","first-page":"1552","article-title":"Methods for empirical game-theoretic analysis","volume":"980","author":"Wellman Michael P.","year":"2006","unstructured":"Michael P. Wellman. 2006. Methods for empirical game-theoretic analysis. In AAAI, Vol. 980. 1552--1556.","journal-title":"AAAI"},{"key":"e_1_3_2_1_67_1","volume-title":"The AI Economist: Taxation policy design via two-level deep multiagent reinforcement learning. Science advances 8, 18","author":"Zheng Stephan","year":"2022","unstructured":"Stephan Zheng, Alexander Trott, Sunil Srinivasa, David C Parkes, and Richard Socher. 2022. The AI Economist: Taxation policy design via two-level deep multiagent reinforcement learning. Science advances 8, 18 (2022), eabk2607."},{"key":"e_1_3_2_1_68_1","volume-title":"Roweis (Eds.)","volume":"20","author":"Zinkevich Martin","year":"2007","unstructured":"Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione. 2007. Regret Minimization in Games with Incomplete Information. In Advances in Neural Information Processing Systems, J. Platt, D. Koller, Y. Singer, and S. Roweis (Eds.), Vol. 20. Curran Associates, Inc."}],"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '24","name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673644","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:09:55Z","timestamp":1750295395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":68,"alternative-id":["10.1145\/3670865.3673644","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673644","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}