{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:56:50Z","timestamp":1783749410242,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","funder":[{"name":"Engineering and Physical Research Council","award":["EP\/V025562\/1"],"award-info":[{"award-number":["EP\/V025562\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,27]]},"DOI":"10.1145\/3729878.3746616","type":"proceedings-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T13:47:17Z","timestamp":1755611237000},"page":"85-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Runtime Bounds for a Coevolutionary Algorithm on Classes of Potential Games"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3529-0434","authenticated-orcid":false,"given":"Mario Hevia","family":"Fajardo","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-0346","authenticated-orcid":false,"given":"Jamal","family":"Toutouh","sequence":"additional","affiliation":[{"name":"University of Malaga, Malaga, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8905-1186","authenticated-orcid":false,"given":"Erik","family":"Hemberg","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6923-8445","authenticated-orcid":false,"given":"Una-May","family":"O'Reilly","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9521-1251","authenticated-orcid":false,"given":"Per Kristian","family":"Lehre","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4630793"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654216"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4068(02)00082-4"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. 1557--1559","author":"Cabannes Theophile","year":"2022","unstructured":"Theophile Cabannes, Mathieu Lauri\u00e8re, Julien Perolat, Raphael Marinier, Sertan Girgin, Sarah Perrin, Olivier Pietquin, Alexandre M Bayen, Eric Goubault, and Romuald Elie. 2022. Solving N-Player Dynamic Routing Games with Congestion: A Mean-Field Approach. In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. 1557--1559."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.07.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110303"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2753538"},{"key":"e_1_3_2_1_8_1","volume-title":"Lin (Eds.)","volume":"33","author":"Czarnecki Wojciech M.","year":"2020","unstructured":"Wojciech M. Czarnecki, Gauthier Gidel, Brendan Tracey, Karl Tuyls, Shayegan Omidshafiei, David Balduzzi, and Max Jaderberg. 2020. Real World Games Look Like Spinning Tops. 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., 17443--17454."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17457"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-016-0264-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3055559"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.09.010"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590506"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3594805.3607132"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-010-0233-y"},{"key":"e_1_3_2_1_17_1","volume-title":"Parallel Problem Solving from Nature --- PPSN III, Yuval Davidor, Hans-Paul Schwefel, and Reinhard M\u00e4nner (Eds.)","author":"Horn Jeffrey","unstructured":"Jeffrey Horn, David E. Goldberg, and Kalyanmoy Deb. 1994. Long path problems. In Parallel Problem Solving from Nature --- PPSN III, Yuval Davidor, Hans-Paul Schwefel, and Reinhard M\u00e4nner (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 149--158."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of National Conference on Artificial Intelligence (AAAI) (proceedings of national conference on artificial intelligence (aaai) ed.). American Association for Artificial Intelligence.","author":"Ieong Samuel","year":"2005","unstructured":"Samuel Ieong, Robert McGrew, Eugene Nudelman, Yoav Shoham, and Qixiang Sun. 2005. Fast and Compact: A Simple Class of Congestion Games. In Proceedings of National Conference on Artificial Intelligence (AAAI) (proceedings of national conference on artificial intelligence (aaai) ed.). American Association for Artificial Intelligence."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528853"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590411"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/767"},{"key":"e_1_3_2_1_23_1","volume-title":"Parallel Problem Solving from Nature - PPSN XVIII, Michael Affenzeller, Stephan M","author":"Lehre Per Kristian","unstructured":"Per Kristian Lehre and Shishen Lin. 2024. Overcoming Binary Adversarial Optimisation with Competitive Coevolution. In Parallel Problem Solving from Nature - PPSN XVIII, Michael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Heike Trautmann, Tea Tu\u0161ar, Penousal Machado, and Thomas B\u00e4ck (Eds.). Springer Nature Switzerland, Cham, 117--132."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00862-3"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-01044-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-012-0245-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1996.0014"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-020-09389-y"},{"key":"e_1_3_2_1_30_1","volume-title":"Levine (Eds.)","volume":"36","author":"Panageas Ioannis","year":"2023","unstructured":"Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, and Volkan Cevher. 2023. Exponential Lower Bounds for Fictitious Play in Potential Games. In Advances in Neural Information Processing Systems, A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine (Eds.), Vol. 36. Curran Associates, Inc., 32401--32423."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1162\/artl.1994.1.353"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219198999000219"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2013.6565153"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2121063"},{"key":"e_1_3_2_1_37_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":{"name":"FOGA '25: Foundations of Genetic Algorithms XVIII","location":"Leiden Netherlands","acronym":"FOGA '25","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 18th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729878.3746616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T16:24:36Z","timestamp":1759163076000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729878.3746616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":37,"alternative-id":["10.1145\/3729878.3746616","10.1145\/3729878"],"URL":"https:\/\/doi.org\/10.1145\/3729878.3746616","relation":{},"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"2025-08-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}