{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:13:44Z","timestamp":1781799224110,"version":"3.54.5"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BI-1057\/1-9"],"award-info":[{"award-number":["BI-1057\/1-9"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-021-00365-4","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T16:28:56Z","timestamp":1628526536000},"page":"687-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Learning equilibria in symmetric auction games using artificial neural networks"],"prefix":"10.1038","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5491-2935","authenticated-orcid":false,"given":"Martin","family":"Bichler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maximilian","family":"Fichtl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6591-9822","authenticated-orcid":false,"given":"Stefan","family":"Heidekr\u00fcger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nils","family":"Kohring","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Sutterer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"365_CR1","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1126\/science.aay2400","volume":"365","author":"N Brown","year":"2019","unstructured":"Brown, N. & Sandholm, T. Superhuman AI for multiplayer poker. Science 365, 885\u2013890 (2019).","journal-title":"Science"},{"key":"365_CR2","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V. & Zeng, H. Training gans with optimism. Preprint at https:\/\/arxiv.org\/abs\/1711.00141 (2017)."},{"key":"365_CR3","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D. et al. A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science 362, 1140\u20131144 (2018).","journal-title":"Science"},{"key":"365_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P. & Papadimitriou, C. The complexity of computing a nash equilibrium. SIAM J. Comput. 39, 195\u2013259 (2009).","journal-title":"SIAM J. Comput."},{"key":"365_CR5","volume-title":"Activity Analysis of Production and Allocation","author":"GW Brown","year":"1951","unstructured":"Brown, G. W in Activity Analysis of Production and Allocation (ed. Koopmans, T. C.) 374\u2013376 (Wiley, 1951)."},{"key":"365_CR6","unstructured":"Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In Proc. 20th International Conference on Machine Learning 928\u2013936 (ICML, 2003)."},{"key":"365_CR7","unstructured":"Bowling, M. Convergence and no-regret in multiagent learning. In Advances in Neural Information Processing Systems 209\u2013216 (NIPS, 2005)."},{"key":"365_CR8","doi-asserted-by":"crossref","unstructured":"Milgrom, P. R. & Weber, R. J. A theory of auctions and competitive bidding. Econometrica 50, 1089\u20131122 (1982).","DOI":"10.2307\/1911865"},{"key":"365_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1111\/1467-6419.00083","volume":"13","author":"P Klemperer","year":"1999","unstructured":"Klemperer, P. Auction theory: a guide to the literature. J. Econ. Surveys 13, 227\u2013286 (1999).","journal-title":"J. Econ. Surveys"},{"key":"365_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W. Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16, 8\u201337 (1961).","journal-title":"J. Finance"},{"key":"365_CR11","unstructured":"Krishna, V. Auction Theory (Academic, 2009)."},{"key":"365_CR12","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1111\/j.1467-937X.2009.00553.x","volume":"76","author":"D Bergemann","year":"2009","unstructured":"Bergemann, D. & Morris, S. Robust implementation in direct mechanisms. Rev. Econ. Stud. 76, 1175\u20131204 (2009).","journal-title":"Rev. Econ. Stud."},{"key":"365_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/jae.697","volume":"18","author":"S Campo","year":"2003","unstructured":"Campo, S., Perrigne, I. & Vuong, Q. Asymmetry in first-price auctions with affiliated private values. J. Appl. Econom. 18, 179\u2013207 (2003).","journal-title":"J. Appl. Econom."},{"key":"365_CR14","first-page":"177","volume":"13","author":"MC Janssen","year":"2020","unstructured":"Janssen, M. C. Reflections on the 2020 Nobel Memorial Prize awarded to Paul Milgrom and Robert Wilson. Erasmus J. Philos. Econ. 13, 177\u2013184 (2020).","journal-title":"Erasmus J. Philos. Econ."},{"key":"365_CR15","unstructured":"Heinrich, J. & Silver, D. Deep reinforcement learning from self-play in imperfect-information games. Preprint at https:\/\/arxiv.org\/abs\/1603.01121 (2016)."},{"key":"365_CR16","unstructured":"Lanctot, M. et al. A unified game-theoretic approach to multiagent reinforcement learning. In Proc. 31st International Conference on Neural Information Processing Systems (NIPS, 2017)."},{"key":"365_CR17","unstructured":"Brown, N., Lerer, A., Gross, S. & Sandholm, T. Deep counterfactual regret minimization. In Proc. 36th International Conference on Machine Learning 793\u2013802 (PMLR, 2019)."},{"key":"365_CR18","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1126\/science.aay2400","volume":"365","author":"N Brown","year":"2019","unstructured":"Brown, N. & Sandholm, T. Superhuman AI for multiplayer poker. Science 365, 885\u2013890 (2019).","journal-title":"Science"},{"key":"365_CR19","unstructured":"Reeves, D. M. & Wellman, M. P. Computing equilibrium strategies in infinite games of incomplete information. Proc. 20th Conference on Uncertainty in Artificial Intelligence (UAI, 2004)."},{"key":"365_CR20","unstructured":"Naroditskiy, V. & Greenwald, A. Using Iterated Best-response to Find Bayes-Nash Equilibria in Auctions 1894\u20131895 (AAAI, 2007)."},{"key":"365_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.artint.2012.09.007","volume":"195","author":"Z Rabinovich","year":"2013","unstructured":"Rabinovich, Z., Naroditskiy, V., Gerding, E. H. & Jennings, N. R. Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types. Artif. Intell. 195, 106\u2013139 (2013).","journal-title":"Artif. Intell."},{"key":"365_CR22","doi-asserted-by":"crossref","unstructured":"Bosshard, V., B\u00fcnz, B., Lubin, B. & Seuken, S. Computing Bayes-Nash equilibria in combinatorial auctions with continuous value and action spaces. In Proc. 26th International Joint Conference on Artificial Intelligence 119\u2013127 (IJCAI, 2017).","DOI":"10.24963\/ijcai.2017\/18"},{"key":"365_CR23","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1613\/jair.1.11525","volume":"69","author":"V Bosshard","year":"2020","unstructured":"Bosshard, V., B\u00fcnz, B., Lubin, B. & Seuken, S. Computing Bayes-Nash equilibria in combinatorial auctions with verification. J. Artif. Intell. Res. 69, 531\u2013570 (2020).","journal-title":"J. Artif. Intell. Res."},{"key":"365_CR24","unstructured":"Feng, Z., Guruganesh, G., Liaw, C., Mehta, A. & Sethi, A. Convergence analysis of no-regret bidding algorithms in repeated auctions. Preprint at https:\/\/arxiv.org\/abs\/2009.06136 (2020)."},{"key":"365_CR25","doi-asserted-by":"crossref","unstructured":"Li, Z. & Wellman, M. P. Evolution strategies for approximate solution of Bayesian games. In Proc. AAAI Conference on Artificial Intelligence Vol. 35, 5531\u20135540 (AAAI, 2021).","DOI":"10.1609\/aaai.v35i6.16696"},{"key":"365_CR26","doi-asserted-by":"crossref","unstructured":"Cai, Y. & Papadimitriou, C. Simultaneous Bayesian auctions and computational complexity. In Proc. 15th ACM Conference on Economics and Computation 895\u2013910 (ACM, 2014).","DOI":"10.1145\/2600057.2602877"},{"key":"365_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1146\/annurev.economics.050708.142930","volume":"1","author":"D Fudenberg","year":"2009","unstructured":"Fudenberg, D. & Levine, D. K. Learning and equilibrium. Annu. Rev. Econ. 1, 385\u2013420 (2009).","journal-title":"Annu. Rev. Econ."},{"key":"365_CR28","unstructured":"Jafari, A., Greenwald, A., Gondek, D. & Ercal, G. On no-regret learning, fictitious play, and Nash equilibrium. Proc. 18th International Conference on Machine Learning 226\u2013233 (ICML, 2001)."},{"key":"365_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.geb.2006.04.007","volume":"59","author":"G Stoltz","year":"2007","unstructured":"Stoltz, G. & Lugosi, G. Learning correlated equilibria in games with compact sets of strategies. Games Econ. Behav. 59, 187\u2013208 (2007).","journal-title":"Games Econ. Behav."},{"key":"365_CR30","unstructured":"Hartline, J., Syrgkanis, V. & Tardos, E. No-regret learning in Bayesian games. In Advances in Neural Information Processing Systems (eds Cortes, C. et al.) Vol. 28, 3061\u20133069 (NIPS, 2015); http:\/\/papers.nips.cc\/paper\/6016-no-regret-learning-in-bayesian-games.pdf"},{"key":"365_CR31","unstructured":"Foster, D. J., Li, Z., Lykouris, T., Sridharan, K. & Tardos, E. Learning in games: robustness of fast convergence. In Advances in Neural Information Processing Systems 4734\u20134742 (NIPS, 2016)."},{"key":"365_CR32","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.jet.2012.07.003","volume":"148","author":"Y Viossat","year":"2013","unstructured":"Viossat, Y. & Zapechelnyuk, A. No-regret dynamics and fictitious play. J. Econ. Theory 148, 825\u2013842 (2013).","journal-title":"J. Econ. Theory"},{"key":"365_CR33","first-page":"103","volume":"2","author":"E Mazumdar","year":"2020","unstructured":"Mazumdar, E., Ratliff, L. J. & Sastry, S. S. On gradient-based learning in continuous games. SIMODS 2, 103\u2013131 (2020).","journal-title":"SIMODS"},{"key":"365_CR34","unstructured":"D\u00fctting, P., Feng, Z., Narasimhan, H., Parkes, D. & Ravindranath, S. S. Optimal auctions through deep learning. In International Conference on Machine Learning 1706\u20131715 (PMLR, 2019)."},{"key":"365_CR35","unstructured":"Feng, Z., Narasimhan, H. & Parkes, D. C. Deep learning for revenue-optimal auctions with budgets. In Proc. 17th International Conference on Autonomous Agents and Multiagent Systems 354\u2013362 (AAMAS, 2018)."},{"key":"365_CR36","unstructured":"Tacchetti, A., Strouse, D., Garnelo, M., Graepel, T. & Bachrach, Y. A neural architecture for designing truthful and efficient auctions. Preprint at https:\/\/arxiv.org\/abs\/1907.05181 (2019)."},{"key":"365_CR37","doi-asserted-by":"crossref","unstructured":"Weissteiner, J. & Seuken, S. Deep learning-powered iterative combinatorial auctions. In Proc. AAAI Conference on Artificial Intelligence Vol. 34, 2284\u20132293 (AAAI, 2020).","DOI":"10.1609\/aaai.v34i02.5606"},{"key":"365_CR38","unstructured":"Morrill, D. et al. Hindsight and sequential rationality of correlated play. Preprint at https:\/\/arxiv.org\/abs\/2012.05874 (2020)."},{"key":"365_CR39","unstructured":"Hartford, J. S. Deep Learning for Predicting Human Strategic Behavior. Ph.D. thesis, Univ. British Columbia (2016)."},{"key":"365_CR40","unstructured":"Ghani, R. & Simmons, H. Predicting the end-price of online auctions. In Proc. International Workshop on Data Mining and Adaptive Modelling Methods for Economics and Management (CiteSeer, 2004)."},{"key":"365_CR41","unstructured":"Zheng, S. et al. The AI economist: improving equality and productivity with AI-driven tax policies. Preprint at https:\/\/arxiv.org\/abs\/2004.13332 (2020)."},{"key":"365_CR42","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3982\/TE1198","volume":"11","author":"JK Goeree","year":"2016","unstructured":"Goeree, J. K. & Lien, Y. On the impossibility of core-selecting auctions. Theoretical Econ. 11, 41\u201352 (2016).","journal-title":"Theoretical Econ."},{"key":"365_CR43","doi-asserted-by":"crossref","unstructured":"Bichler, M. & Goeree, J. K. Handbook of Spectrum Auction Design (Cambridge Univ. Press, 2017).","DOI":"10.1017\/9781316471609"},{"key":"365_CR44","unstructured":"Debnath, L. et al. Introduction to Hilbert Spaces with Applications (Academic, 2005)."},{"key":"365_CR45","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1111\/poms.12301","volume":"24","author":"M Bichler","year":"2015","unstructured":"Bichler, M., Guler, K. & Mayer, S. Split-award procurement auctions-can bayesian equilibrium strategies predict human bidding behavior in multi-object auctions? Prod. Oper. Manag. 24, 1012\u20131027 (2015).","journal-title":"Prod. Oper. Manag."},{"key":"365_CR46","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jmateco.2016.02.004","volume":"63","author":"T Ui","year":"2016","unstructured":"Ui, T. Bayesian nash equilibrium and variational inequalities. J. Math. Econ. 63, 139\u2013146 (2016).","journal-title":"J. Math. Econ."},{"key":"365_CR47","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K. Approximation capabilities of multilayer feedforward networks. Neural Networks 4, 251\u2013257 (1991).","journal-title":"Neural Networks"},{"key":"365_CR48","first-page":"949","volume":"15","author":"D Wierstra","year":"2014","unstructured":"Wierstra, D. et al. Natural evolution strategies. J. Mach. Learn. Res. 15, 949\u2013980 (2014).","journal-title":"J. Mach. Learn. Res."},{"key":"365_CR49","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S. & Sutskever, I. Evolution strategies as a scalable alternative to reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/1703.03864 (2017)."},{"key":"365_CR50","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s13235-012-0040-0","volume":"2","author":"M Bena\u00edm","year":"2012","unstructured":"Bena\u00edm, M., Hofbauer, J. & Sorin, S. Perturbations of set-valued dynamical systems, with applications to game theory. Dyn. Games Appl. 2, 195\u2013205 (2012).","journal-title":"Dyn. Games Appl."},{"key":"365_CR51","first-page":"1","volume":"20","author":"A Letcher","year":"2019","unstructured":"Letcher, A. et al. Differentiable game mechanics. J. Mach. Learn. Res. 20, 1\u201340 (2019).","journal-title":"J. Mach. Learn. Res."},{"key":"365_CR52","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D. & Shapley, L. S. Potential games. Games Econ. Behav. 14, 124\u2013143 (1996).","journal-title":"Games Econ. Behav."},{"key":"365_CR53","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Lubin, B. & Seuken, S. Designing core-selecting payment rules: a computational search approach. In Proc. 2018 ACM Conference on Economics and Computation 109 (ACM, 2018).","DOI":"10.1145\/3219166.3219206"},{"key":"365_CR54","doi-asserted-by":"crossref","unstructured":"Ausubel, L. M. & Baranov, O. Core-selecting auctions with incomplete information. Int. J. Game Theory 49, 251\u2013273 (2019).","DOI":"10.1007\/s00182-019-00691-3"},{"key":"365_CR55","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10726-015-9454-6","volume":"25","author":"K Guler","year":"2016","unstructured":"Guler, K., Bichler, M. & Petrakis, I. Ascending combinatorial auctions with risk averse bidders. Group Decis. Negot. 25, 609\u2013639 (2016).","journal-title":"Group Decis. Negot."},{"key":"365_CR56","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1111\/j.1468-0262.2006.00675.x","volume":"74","author":"P Jehiel","year":"2006","unstructured":"Jehiel, P., Meyer-ter-Vehn, M., Moldovanu, B. & Zame, W. R. The limits of ex post implementation. Econometrica 74, 585\u2013610 (2006).","journal-title":"Econometrica"},{"key":"365_CR57","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Skoulakis, S. & Zampetakis, M. The complexity of constrained min\u2013max optimization. In Pro. 53rd Annual ACM SIGACT Symposium on Theory of Computing 1466\u20131478 (STOC, 2021).","DOI":"10.1145\/3406325.3451125"},{"key":"365_CR58","unstructured":"Vorobeychik, Y., Reeves, D. M. & Wellman, M. P. Constrained automated mechanism design for infinite games of incomplete information. In Proc. 23rd Conference on Uncertainty in Artificial Intelligence 400\u2013407 (UAI, 2007)."},{"key":"365_CR59","unstructured":"Viqueira, E. A., Cousins, C., Mohammad, Y. & Greenwald, A. Empirical mechanism design: designing mechanisms from data. In Proc. 35th Uncertainty in Artificial Intelligence Conference 1094\u20131104 (PMLR, 2020)."},{"key":"365_CR60","unstructured":"Kingma, D. P. & Ba, J. Adam: a method for stochastic optimization. Preprint at https:\/\/arxiv.org\/abs\/1412.6980 (2015)."},{"key":"365_CR61","unstructured":"Paszke, A. et al. Automatic differentiation in pytorch. In 31st Conference on Neural Information Processing Systems (NIPS, 2017)."},{"key":"365_CR62","unstructured":"Heidekr\u00fcger, S., Kohring, N., Sutterer, S. & Bichler, M. bnelearn: A Framework for Equilibrium Learning in Sealed-Bid Auctions (Github, 2021); https:\/\/github.com\/heidekrueger\/bnelearn"}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-021-00365-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-021-00365-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-021-00365-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T20:35:38Z","timestamp":1670099738000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-021-00365-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":62,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["365"],"URL":"https:\/\/doi.org\/10.1038\/s42256-021-00365-4","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"16 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}