{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:39:58Z","timestamp":1766137198546,"version":"build-2065373602"},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T00:00:00Z","timestamp":1558137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000739","name":"University of Southampton","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000739","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s13675-019-00114-8","type":"journal-article","created":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T02:22:29Z","timestamp":1558232549000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4512-3480","authenticated-orcid":false,"given":"Nicola","family":"Basilico","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-4385","authenticated-orcid":false,"given":"Stefano","family":"Coniglio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-3932","authenticated-orcid":false,"given":"Nicola","family":"Gatti","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Marchesi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-019-00114-8_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","article-title":"Jointly constrained biconvex programming","volume":"8","author":"Al-Khayyal","year":"1983","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-019-00114-8_CR2","doi-asserted-by":"crossref","unstructured":"Alves MJ, Antunes CH (2016) An illustration of different concepts of solutions in semivectorial bilevel programming. In: 2016 IEEE symposium series on computational intelligence (SSCI). IEEE, pp 1\u20137","DOI":"10.1109\/SSCI.2016.7850219"},{"issue":"7","key":"10.1007\/s13675-019-00114-8_CR3","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1109\/LCOMM.2013.060513.130351","article-title":"Network optimization problems subject to max-min fair flow allocation","volume":"17","author":"Amaldi","year":"2013","journal-title":"IEEE Commun Lett"},{"issue":"1-2","key":"10.1007\/s13675-019-00114-8_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-012-0596-x","article-title":"Coordinated cutting plane generation via multi-objective separation","volume":"143","author":"Amaldi","year":"2014","journal-title":"Math Program"},{"key":"#cr-split#-10.1007\/s13675-019-00114-8_CR5.1","doi-asserted-by":"crossref","unstructured":"Amaldi E, Coniglio S, Gualandi S (2010) Improving cutting plane generation with 0-1 inequalities by bi-criteria separation. In: Festa P","DOI":"10.1007\/978-3-642-13193-6_23"},{"key":"#cr-split#-10.1007\/s13675-019-00114-8_CR5.2","unstructured":"(ed) Experimental algorithms. SEA 2010. Lecture notes in computer science, vol 6049. Springer, Berlin, Heidelberg, pp 266-275"},{"issue":"1","key":"10.1007\/s13675-019-00114-8_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1978721.1978729","article-title":"Guards and Protect: next generation applications of security games","volume":"10","author":"An","year":"2011","journal-title":"ACM SIGecom Exch"},{"key":"10.1007\/s13675-019-00114-8_CR7","unstructured":"Basilico N, Coniglio S, Gatti N, Marchesi A (2017) Bilevel programming approaches to the computation of optimistic and pessimistic single-leader\u2013multi-follower equilibria. In: Iliopoulos CS, Pissism SP, Puglisi SJ, and Raman R (eds) 16th international symposium on experimental algorithms. SEA 2017. Leibniz international proceedings in informatics (LIPIcs), vol 75. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp 31:1\u201331:14"},{"key":"10.1007\/s13675-019-00114-8_CR8","unstructured":"Basilico N, Coniglio S, Gatti N (2016) Methods for finding leader-follower equilibria with multiple followers: (extended abstract). In: Proceedings of the 15th international joint conference on autonomous agents and multiagent systems, AAMAS 2016, pp 1363\u20131364"},{"issue":"2","key":"10.1007\/s13675-019-00114-8_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.2015.0676","article-title":"Bilevel knapsack with interdiction constraints","volume":"28","author":"Caprara","year":"2016","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-019-00114-8_CR10","doi-asserted-by":"crossref","unstructured":"Castiglioni M, Marchesi A, Gatti N, Coniglio S (2018) Leadership in singleton congestion games: what is hard and what is easy. CoRR. arXiv:1808.10209","DOI":"10.1016\/j.artint.2019.103177"},{"key":"10.1007\/s13675-019-00114-8_CR11","doi-asserted-by":"crossref","unstructured":"Chen X, Deng X (2006) Settling the complexity of two-player nash equilibrium. In: 2006 47th annual IEEE symposium on foundations of computer science (FOCS\u201906). IEEE, pp 261\u2013272","DOI":"10.1109\/FOCS.2006.69"},{"key":"#cr-split#-10.1007\/s13675-019-00114-8_CR12.1","doi-asserted-by":"crossref","unstructured":"Coniglio S, Tieves M (2015) On the generation of cutting planes which maximize the bound improvement. In: Bampis E","DOI":"10.1007\/978-3-319-20086-6_8"},{"key":"#cr-split#-10.1007\/s13675-019-00114-8_CR12.2","unstructured":"(ed) Experimental algorithms. SEA 2015. Lecture notes in computer science, vol 9125. Springer, Cham, pp 97-109"},{"key":"10.1007\/s13675-019-00114-8_CR13","doi-asserted-by":"crossref","unstructured":"Coniglio S, Gatti N, Marchesi A (2017) Pessimistic leader-follower equilibria with multiple followers. In: Proceedings of the 26th international joint conference on artificial intelligence, IJCAI 2017, pp 171\u2013177","DOI":"10.24963\/ijcai.2017\/25"},{"key":"10.1007\/s13675-019-00114-8_CR14","doi-asserted-by":"crossref","unstructured":"Coniglio S, Gatti N, Marchesi A (2018) Computing a pessimistic leader-follower equilibrium with multiple followers: the mixed-pure case. CoRR. arXiv:1808.01438","DOI":"10.24963\/ijcai.2017\/25"},{"issue":"2","key":"10.1007\/s13675-019-00114-8_CR15","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","article-title":"New complexity results about Nash equilibria","volume":"63","author":"Conitzer","year":"2008","journal-title":"Games Econ Behav"},{"key":"10.1007\/s13675-019-00114-8_CR16","doi-asserted-by":"crossref","unstructured":"Conitzer V, Korzhyk D (2011) Commitment to correlated strategies. In: Proceedings of the 25th AAAI conference on artificial intelligence, AAAI 2011, pp 632\u2013637","DOI":"10.1609\/aaai.v25i1.7875"},{"key":"10.1007\/s13675-019-00114-8_CR17","doi-asserted-by":"crossref","unstructured":"Conitzer V, Sandholm T (2006) Computing the optimal strategy to commit to. In: Proceedings of the 7th ACM conference on electronic commerce, EC 2006, pp 82\u201390","DOI":"10.1145\/1134707.1134717"},{"key":"10.1007\/s13675-019-00114-8_CR18","doi-asserted-by":"crossref","unstructured":"Costa A, Nannicini G, Schroepfer T, Wortmann T (2015) Black-box optimization of lighting simulation in architectural design. In: Cardin MA, Krob D, Lui P, Tan Y, Wood K (eds) Complex systems design & management Asia. Springer, Cham, pp 27\u201339","DOI":"10.1007\/978-3-319-12544-2_3"},{"key":"10.1007\/s13675-019-00114-8_CR19","unstructured":"Kiekintveld C, Jain M, Tsai J, Pita J, Ord\u00f3\u00f1ez F, Tambe M (2009) Computing optimal randomized resource allocations for massive security games. In: Proceedings of 8th international joint conference on autonomous agents and multiagent systems, AAMAS 2009, pp 689\u2013696"},{"issue":"1","key":"10.1007\/s13675-019-00114-8_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10479-015-2016-0","article-title":"Bilevel programming and price setting problems","volume":"240","author":"Labb\u00e9","year":"2016","journal-title":"Ann Oper Res"},{"issue":"4","key":"10.1007\/s13675-019-00114-8_CR21","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1080\/10556780903448052","article-title":"Solving multi-leader-common-follower games","volume":"25","author":"Leyffer","year":"2010","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-019-00114-8_CR22","doi-asserted-by":"crossref","unstructured":"Marchesi A, Coniglio S, Gatti N (2018) Leadership in singleton congestion games. In: Proceedings of the 27th international joint conference on artificial intelligence, IJCAI 2018, pp 447\u2013453","DOI":"10.24963\/ijcai.2018\/62"},{"issue":"1","key":"10.1007\/s13675-019-00114-8_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.orl.2016.11.005","article-title":"Protection of flows under targeted attacks","volume":"45","author":"Matuschke","year":"2017","journal-title":"Oper Res Lett"},{"issue":"1","key":"10.1007\/s13675-019-00114-8_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: Part I\u2014convex underestimating problems","volume":"10","author":"McCormick","year":"1976","journal-title":"Math Program"},{"key":"10.1007\/s13675-019-00114-8_CR25","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Nash","year":"1950","journal-title":"Proc Natl Acad Sci"},{"key":"10.1007\/s13675-019-00114-8_CR26","unstructured":"Nudelman E, Wortman J, Leyton-Brown K, Shoham Y (2004) Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms. In: Proceedings of the 3rd international joint conference on autonomous agents and multiagent systems, AAMAS 2004, pp 880\u2013887"},{"issue":"2","key":"10.1007\/s13675-019-00114-8_CR27","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.geb.2006.03.015","article-title":"Simple search methods for finding a nash equilibrium","volume":"63","author":"Porter","year":"2008","journal-title":"Games Econ Behav"},{"key":"10.1007\/s13675-019-00114-8_CR28","unstructured":"Sandholm T, Gilpin A, Conitzer V (2005) Mixed-integer programming methods for finding Nash equilibria. In: Proceedings of the 20th AAAI conference on artificial intelligence, AAAI 2005, pp 495\u2013501"},{"issue":"3","key":"10.1007\/s13675-019-00114-8_CR29","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J Discrete Math"},{"year":"2008","series-title":"Multiagent Systems: algorithmic, game theoretic and logical foundations","author":"Shoham","key":"10.1007\/s13675-019-00114-8_CR30"},{"year":"2010","series-title":"Market structure and equilibrium","author":"von Stackelberg","key":"10.1007\/s13675-019-00114-8_CR31"},{"issue":"1","key":"10.1007\/s13675-019-00114-8_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00199-009-0452-2","article-title":"Computation of nash equilibria in finite games: introduction to the symposium","volume":"42","author":"von Stengel","year":"2010","journal-title":"Econ Theory"},{"key":"10.1007\/s13675-019-00114-8_CR33","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.geb.2009.11.008","article-title":"Leadership games with convex strategy sets","volume":"69","author":"von Stengel","year":"2010","journal-title":"Games Econ Behavior"},{"key":"10.1007\/s13675-019-00114-8_CR34","doi-asserted-by":"crossref","first-page":"381","DOI":"10.15388\/LMJ.1968.20224","article-title":"Equilibrium points in polymatrix games","volume":"8","author":"Yanovskaya","year":"1968","journal-title":"Lith Math J"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-019-00114-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-019-00114-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-019-00114-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:58Z","timestamp":1761882478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["S2192440621000058"],"URL":"https:\/\/doi.org\/10.1007\/s13675-019-00114-8","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-019-00114-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2020 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd","name":"copyright","label":"Copyright"}]}}