{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:59:33Z","timestamp":1775815173517,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":72,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The European Research Council (ERC)","award":["740282"],"award-info":[{"award-number":["740282"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512055","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Auctions between Regret-Minimizing Agents"],"prefix":"10.1145","author":[{"given":"Yoav","family":"Kolumbus","sequence":"first","affiliation":[{"name":"The Hebrew University, Israel"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"The Hebrew University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35389-6_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_3_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning 47, 2","author":"Auer Peter","year":"2002","unstructured":"Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning 47, 2 (2002), 235\u2013256."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1795"},{"key":"e_1_3_2_1_5_1","unstructured":"James\u00a0P Bailey Sai\u00a0Ganesh Nagarajan and Georgios Piliouras. 2021. Stochastic Multiplicative Weights Updates in Zero-Sum Games. arXiv preprint arXiv:2110.02134(2021)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219235"},{"key":"e_1_3_2_1_7_1","volume-title":"Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Science 65, 9","author":"Balseiro R","year":"2019","unstructured":"Santiago\u00a0R Balseiro and Yonatan Gur. 2019. Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Science 65, 9 (2019)."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems. 1118\u20131128","author":"Ben-Porat Omer","year":"2018","unstructured":"Omer Ben-Porat and Moshe Tennenholtz. 2018. A game-theoretic approach to recommendation systems with strategic content providers. In Proceedings of the 32nd International Conference on Neural Information Processing Systems. 1118\u20131128."},{"key":"e_1_3_2_1_9_1","volume-title":"Optimally Deceiving a Learning Leader in Stackelberg Games. arXiv:2006.06566","author":"Birmpas Georgios","year":"2020","unstructured":"Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco\u00a0J Marmolejo-Coss\u00edo, Ninad Rajgopal, and Alexandros\u00a0A Voudouris. 2020. Optimally Deceiving a Learning Leader in Stackelberg Games. arXiv:2006.06566 (2020)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374430"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Avrim Blum and Yishay Monsour. 2007. Learning regret minimization and equilibria. (2007).","DOI":"10.1017\/CBO9780511800481.006"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219233"},{"key":"e_1_3_2_1_14_1","unstructured":"George\u00a0W Brown. 1951. Iterative solution of games by fictitious play. Activity analysis of production and allocation 13 1(1951) 374\u2013376."},{"key":"e_1_3_2_1_15_1","volume-title":"Conference on Learning Theory. PMLR, 280\u2013296","author":"Cai Yang","year":"2015","unstructured":"Yang Cai, Constantinos Daskalakis, and Christos Papadimitriou. 2015. Optimum statistical estimation with strategic data sources. In Conference on Learning Theory. PMLR, 280\u2013296."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.010"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365772"},{"key":"e_1_3_2_1_18_1","volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2483188"},{"key":"e_1_3_2_1_20_1","first-page":"15265","article-title":"Learning Strategy-Aware Linear Classifiers","volume":"33","author":"Chen Yiling","year":"2020","unstructured":"Yiling Chen, Yang Liu, and Chara Podimata. 2020. Learning Strategy-Aware Linear Classifiers. Advances in Neural Information Processing Systems 33 (2020), 15265\u201315276.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16170-4_11"},{"key":"e_1_3_2_1_22_1","volume-title":"Learning in auctions: Regret is hard, envy is easy. In 2016 ieee 57th annual symposium on foundations of computer science (focs)","author":"Daskalakis Constantinos","unstructured":"Constantinos Daskalakis and Vasilis Syrgkanis. 2016. Learning in auctions: Regret is hard, envy is easy. In 2016 ieee 57th annual symposium on foundations of computer science (focs). IEEE, 219\u2013228."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Xiaotie Deng Xinyan Hu Tao Lin and Weiqiang Zheng. 2021. Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions. arXiv preprint arXiv:2110.03906(2021).","DOI":"10.1145\/3485447.3512059"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450052"},{"key":"e_1_3_2_1_25_1","first-page":"1579","article-title":"Strategizing against No-regret Learners","volume":"32","author":"Deng Yuan","year":"2019","unstructured":"Yuan Deng, Jon Schneider, and Balasubramanian Sivan. 2019. Strategizing against No-regret Learners. Advances in Neural Information Processing Systems 32 (2019), 1579\u20131587.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219193"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0920"},{"key":"e_1_3_2_1_28_1","volume-title":"Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review 97, 1","author":"Edelman Benjamin","year":"2007","unstructured":"Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review 97, 1 (2007), 242\u2013259."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_10"},{"key":"e_1_3_2_1_30_1","unstructured":"Zhe Feng Guru Guruganesh Christopher Liaw Aranyak Mehta and Abhishek Sethi. 2020. Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions. arXiv preprint arXiv:2009.06136(2020)."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems. 8274\u20138283","author":"Gan Jiarui","year":"2019","unstructured":"Jiarui Gan, Qingyu Guo, Long Tran-Thanh, Bo An, and Michael Wooldridge. 2019. Manipulating a learning defender and ways to counteract. In Proceedings of the 33rd International Conference on Neural Information Processing Systems. 8274\u20138283."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329629"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Matthew\u00a0L Gentry Timothy\u00a0P Hubbard Denis Nekipelov Harry\u00a0J Paarsch 2018. Structural econometrics of auctions: A review.","DOI":"10.1561\/0800000031"},{"key":"e_1_3_2_1_34_1","volume-title":"Strategic Classification in the Dark. 139","author":"Ghalme Ganesh","year":"2021","unstructured":"Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, and Nir Rosenfeld. 2021. Strategic Classification in the Dark. 139 (2021), 3672\u20133681. https:\/\/proceedings.mlr.press\/v139\/ghalme21a.html"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00032-0"},{"key":"e_1_3_2_1_36_1","volume-title":"Article 23","author":"Haghtalab Nika","year":"2021","unstructured":"Nika Haghtalab, Nicole Immorlica, Brendan Lucier, and Jack\u00a0Z. Wang. 2021. Maximizing Welfare with Incentive-Aware Evaluation Mechanisms., Article 23 (2021), 7\u00a0pages."},{"key":"e_1_3_2_1_37_1","volume-title":"Contributions to the Theory of Games (AM-39)","author":"Hannan James","unstructured":"James Hannan. 1957. Approximation to Bayes Risk in Repeated Play. In Contributions to the Theory of Games (AM-39), Volume III. Princeton University Press, 97\u2013139."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840730"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Sergiu Hart and Andreu Mas-Colell. 2013. Simple adaptive strategies: from regret-matching to uncoupled dynamics. Vol.\u00a04. World Scientific.","DOI":"10.1142\/8408"},{"key":"e_1_3_2_1_41_1","first-page":"3061","article-title":"No-Regret Learning in Bayesian Games","volume":"28","author":"Hartline Jason","year":"2015","unstructured":"Jason Hartline, Vasilis Syrgkanis, and Eva Tardos. 2015. No-Regret Learning in Bayesian Games. Advances in Neural Information Processing Systems 28 (2015), 3061\u20133069.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Darrell Hoy Kamal Jain and Christopher\u00a0A Wilkens. 2013. A dynamic axiomatic approach to first-price auctions. (2013) 583\u2013584.","DOI":"10.1145\/2482540.2482567"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJEB.2008.018068"},{"key":"e_1_3_2_1_44_1","unstructured":"Adam Kalai and Santosh Vempala. 2002. Geometric algorithms for online optimization. In Journal of Computer and System Sciences. Citeseer."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Yoav Kolumbus and Noam Nisan. 2021. Auctions Between Regret-Minimizing Agents. arXiv preprint arXiv:2110.11855(2021). https:\/\/arxiv.org\/pdf\/2110.11855.pdf","DOI":"10.1145\/3485447.3512055"},{"key":"e_1_3_2_1_47_1","unstructured":"Yoav Kolumbus and Noam Nisan. 2021. How and Why to Manipulate Your Own Agent. arXiv preprint arXiv:2112.07640(2021). https:\/\/arxiv.org\/pdf\/2112.07640.pdf"},{"key":"e_1_3_2_1_48_1","volume-title":"Auction theory","author":"Krishna Vijay","unstructured":"Vijay Krishna. 2009. Auction theory. Academic press."},{"key":"e_1_3_2_1_49_1","volume-title":"Epoch-Greedy algorithm for multi-armed bandits with side information. Advances in Neural Information Processing Systems (NIPS 2007) 20","author":"Langford John","year":"2007","unstructured":"John Langford and Tong Zhang. 2007. Epoch-Greedy algorithm for multi-armed bandits with side information. Advances in Neural Information Processing Systems (NIPS 2007) 20 (2007), 1."},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning, Marina Meila and Tong Zhang (Eds.). Vol.\u00a0139","author":"Levanon Sagi","year":"2021","unstructured":"Sagi Levanon and Nir Rosenfeld. 2021. Strategic Classification Made Practical. In Proceedings of the 38th International Conference on Machine Learning, Marina Meila and Tong Zhang (Eds.). Vol.\u00a0139. 6243\u20136253. https:\/\/proceedings.mlr.press\/v139\/levanon21a.html"},{"key":"e_1_3_2_1_51_1","volume-title":"Advances in economic theory: Fifth world congress, Vol.\u00a01","author":"R Milgrom","unstructured":"Paul\u00a0R Milgrom 1987. Auction theory. In Advances in economic theory: Fifth world congress, Vol.\u00a01. Cambridge University Press Cambridge, 32."},{"key":"e_1_3_2_1_52_1","unstructured":"Mehryar Mohri and Andres Munoz. 2014. Optimal regret minimization in posted-price auctions with strategic buyers. In Advances in Neural Information Processing Systems. 1871\u20131879."},{"key":"e_1_3_2_1_53_1","volume-title":"Limits and limitations of no-regret learning in games. The Knowledge Engineering Review 32","author":"Monnot Barnab\u00e9","year":"2017","unstructured":"Barnab\u00e9 Monnot and Georgios Piliouras. 2017. Limits and limitations of no-regret learning in games. The Knowledge Engineering Review 32 (2017)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764522"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Thanh Nguyen and Haifeng Xu. 2019. Imitative Attacker Deception in Stackelberg Security Games.. In IJCAI. 528\u2013534.","DOI":"10.24963\/ijcai.2019\/75"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012133"},{"key":"e_1_3_2_1_57_1","volume-title":"Introduction to mechanism design (for computer scientists). Algorithmic game theory 9","author":"Noam Nisan","year":"2007","unstructured":"Noam Nisan 2007. Introduction to mechanism design (for computer scientists). Algorithmic game theory 9 (2007), 209\u2013242."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052621"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085111"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449968"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.3390\/e20100782"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Julia Robinson. 1951. An iterative method of solving a game. Annals of mathematics(1951) 296\u2013301.","DOI":"10.2307\/1969530"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229078"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176788.3176790"},{"key":"e_1_3_2_1_65_1","article-title":"Minimizing regret with multiple reserves","volume":"7","author":"Roughgarden Tim","year":"2019","unstructured":"Tim Roughgarden and Joshua\u00a0R Wang. 2019. Minimizing regret with multiple reserves. ACM Transactions on Economics and Computation (TEAC) 7, 3 (2019).","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"e_1_3_2_1_66_1","volume-title":"Online learning and online convex optimization. Foundations and trends in Machine Learning 4","author":"Shai","year":"2011","unstructured":"Shai Shalev-Shwartz 2011. Online learning and online convex optimization. Foundations and trends in Machine Learning 4 (2011), 107\u2013194."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488635"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340922"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Hal\u00a0R Varian. 2007. Position auctions. international Journal of industrial Organization 25 6(2007) 1163\u20131178.","DOI":"10.1016\/j.ijindorg.2006.10.002"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"H\u00a0Peyton Young. 2004. Strategic learning and its limits. OUP Oxford.","DOI":"10.1093\/acprof:oso\/9780199269181.001.0001"},{"key":"e_1_3_2_1_72_1","volume-title":"Proceedings of the 20th international conference on machine learning. 928\u2013936","author":"Zinkevich Martin","year":"2003","unstructured":"Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th international conference on machine learning. 928\u2013936."}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:07Z","timestamp":1750188607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":72,"alternative-id":["10.1145\/3485447.3512055","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512055","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}