{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:30:33Z","timestamp":1760243433396,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032080639","type":"print"},{"value":"9783032080646","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:00:00Z","timestamp":1760227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:00:00Z","timestamp":1760227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08064-6_5","type":"book-chapter","created":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:44:52Z","timestamp":1760219092000},"page":"81-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locally Optimal Solutions for\u00a0Integer Programming Games in\u00a0Cybersecurity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1331-3804","authenticated-orcid":false,"given":"Pravesh","family":"Koirala","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5281-0588","authenticated-orcid":false,"given":"Mel","family":"Krusniak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3982-3920","authenticated-orcid":false,"given":"Forrest","family":"Laine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,12]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1287\/opre.2020.2014","volume":"69","author":"A Baggio","year":"2021","unstructured":"Baggio, A., Carvalho, M., Lodi, A., Tramontani, A.: Multilevel approaches for the critical node problem. Oper. Res. 69(2), 486\u2013508 (2021)","journal-title":"Oper. Res."},{"key":"5_CR3","unstructured":"Carvalho, M., Dragotto, G., Lodi, A., Sankaranarayanan, S.: The cut-and-play algorithm: computing nash equilibria via outer approximations. arXiv preprint arXiv:2111.05726 (2021)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Carvalho, M., Dragotto, G., Lodi, A., Sankaranarayanan, S.: Integer programming games: a gentle computational overview. In: Tutorials in Operations Research: Advancing the Frontiers of OR\/MS: From Methodologies to Applications, pp. 31\u201351. INFORMS (2023)","DOI":"10.1287\/educ.2023.0260"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.ejor.2022.03.048","volume":"303","author":"M Carvalho","year":"2022","unstructured":"Carvalho, M., Lodi, A., Pedroso, J.P.: Computing equilibria for integer programming games. Eur. J. Oper. Res. 303(3), 1057\u20131070 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR6","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-71583-4_2","volume-title":"Operational Research","author":"M Carvalho","year":"2018","unstructured":"Carvalho, M., Lodi, A., Pedroso, J.P.: Existence of nash equilibria on integer programming games. In: Vaz, A.I.F., Almeida, J.P., Oliveira, J.F., Pinto, A.A. (eds.) APDIO 2017. SPMS, vol. 223, pp. 11\u201323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-71583-4_2"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2013.05.025","volume":"231","author":"M Constantino","year":"2013","unstructured":"Constantino, M., Klimentova, X., Viana, A., Rais, A.: New insights on integer-programming models for the kidney exchange problem. Eur. J. Oper. Res. 231(1), 57\u201368 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR8","unstructured":"Cplex, I.I.: V12. 1: user\u2019s manual for CPLEX. Int. Bus. Mach. Corp. 46(53), 157 (2009)"},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103426","volume":"133","author":"T Cr\u00f6nert","year":"2021","unstructured":"Cr\u00f6nert, T., Minner, S.: Location selection for hydrogen fuel stations under emerging provider competition. Transp. Res. Part C Emerg. Technol. 133, 103426 (2021)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1287\/opre.2022.2413","volume":"72","author":"T Cr\u00f6nert","year":"2024","unstructured":"Cr\u00f6nert, T., Minner, S.: Equilibrium identification and selection in finite games. Oper. Res. 72(2), 816\u2013831 (2024)","journal-title":"Oper. Res."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura","year":"2008","unstructured":"Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s10878-024-01173-3","volume":"47","author":"G Dragotto","year":"2024","unstructured":"Dragotto, G., Boukhtouta, A., Lodi, A., Taobane, M.: The critical node game. J. Comb. Optim. 47(5), 74 (2024)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1287\/ijoc.2022.0282","volume":"35","author":"G Dragotto","year":"2023","unstructured":"Dragotto, G., Scatamacchia, R.: The zero regrets algorithm: optimizing over pure nash equilibria via integer programming. INFORMS J. Comput. 35(5), 1143\u20131160 (2023)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/100817000","volume":"21","author":"A Dreves","year":"2011","unstructured":"Dreves, A., Facchinei, F., Kanzow, C., Sagratella, S.: On the solution of the KKT conditions of generalized nash equilibrium problems. SIAM J. Optim. 21(3), 1082\u20131108 (2011)","journal-title":"SIAM J. Optim."},{"key":"5_CR15","unstructured":"Dunne, P.E., Wooldridge, M.: Towards tractable boolean games. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, pp. 939\u2013946 (2012)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Emile, J.: Stackelberg (heinrich von) - the theory of the market economy, translated from the German and with an introduction by Alan T. Peacock. Revue \u00e9conomique 4, 944\u2013945 (1953). https:\/\/api.semanticscholar.org\/CorpusID:153285768","DOI":"10.2307\/3497517"},{"issue":"6","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615\u20131637 (2017)","journal-title":"Oper. Res."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1(2), 201\u2013222 (2009)","DOI":"10.1007\/s12532-009-0007-3"},{"key":"5_CR19","unstructured":"GNU Project: GNU Linear Programming Kit (GLPK) (2025). https:\/\/www.gnu.org\/software\/glpk\/glpk.html. Accessed 10 Feb 2025"},{"issue":"725\/36","key":"5_CR20","first-page":"725","volume":"10","author":"G Gordon","year":"2012","unstructured":"Gordon, G., Tibshirani, R.: Karush-kuhn-tucker conditions. Optimization 10(725\/36), 725 (2012)","journal-title":"Optimization"},{"key":"5_CR21","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2024). https:\/\/www.gurobi.com"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/261342.571216","volume":"28","author":"DS Hochba","year":"1997","unstructured":"Hochba, D.S.: Approximation algorithms for np-hard problems. ACM SIGACT News 28(2), 40\u201352 (1997)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"6","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1287\/opre.1110.0964","volume":"59","author":"M K\u00f6ppe","year":"2011","unstructured":"K\u00f6ppe, M., Ryan, C.T., Queyranne, M.: Rational generating functions and integer programming games. Oper. Res. 59(6), 1445\u20131460 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/990518.990521","volume":"7","author":"MS Krishnamoorthy","year":"1975","unstructured":"Krishnamoorthy, M.S.: An np-hard problem in bipartite graphs. ACM SIGACT News 7(1), 26 (1975)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ejor.2017.10.026","volume":"266","author":"A Lamas","year":"2018","unstructured":"Lamas, A., Chevalier, P.: Joint dynamic pricing and lot-sizing under competition. Eur. J. Oper. Res. 266(3), 864\u2013876 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1022938707934","volume":"119","author":"EK Lee","year":"2003","unstructured":"Lee, E.K., Fox, T., Crocker, I.: Integer programming applied to intensity-modulated radiation therapy treatment planning. Ann. Oper. Res. 119, 165\u2013181 (2003)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5_CR28","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"5_CR29","unstructured":"Maass, J., Mousseau, V., Wilczynski, A.: A hotelling-downs game for strategic candidacy with binary issues. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, pp. 2076\u20132084 (2023)"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2016.05.005","volume":"75","author":"AK Nandi","year":"2016","unstructured":"Nandi, A.K., Medal, H.R., Vadlamani, S.: Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model. Comput. Oper. Res. 75, 118\u2013131 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"5_CR31","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM (JACM) 28(4), 765\u2013768 (1981)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.26.3.434","volume":"26","author":"CH Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Some examples of difficult traveling salesman problems. Oper. Res. 26(3), 434\u2013443 (1978)","journal-title":"Oper. Res."},{"key":"5_CR33","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Courier Corporation (1998)"},{"key":"5_CR34","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming, vol.\u00a0149. Springer (2006)"},{"key":"5_CR35","unstructured":"Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. Computer scheduling of public transport urban passenger vehicle and crew scheduling, pp. 269\u2013280 (1981)"},{"issue":"4","key":"5_CR36","doi-asserted-by":"publisher","first-page":"2190","DOI":"10.1137\/15M1052445","volume":"26","author":"S Sagratella","year":"2016","unstructured":"Sagratella, S.: Computing all solutions of nash equilibrium problems with discrete strategy sets. SIAM J. Optim. 26(4), 2190\u20132218 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.ejor.2019.12.024","volume":"284","author":"S Sagratella","year":"2020","unstructured":"Sagratella, S., Schmidt, M., Sudermann-Merx, N.: The noncooperative fixed charge transportation problem. Eur. J. Oper. Res. 284(1), 373\u2013382 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"5_CR38","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10589-023-00500-4","volume":"86","author":"S Schwarze","year":"2023","unstructured":"Schwarze, S., Stein, O.: A branch-and-prune algorithm for discrete nash equilibrium problems. Comput. Optim. Appl. 86(2), 491\u2013519 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization \u2014 Eureka, You Shrink!","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization \u2014 Eureka, You Shrink! LNCS, vol. 2570, pp. 185\u2013207. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36478-1_17"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Wolsey, L.A.: Integer Programming. Wiley (2020)","DOI":"10.1002\/9781119606475"}],"container-title":["Lecture Notes in Computer Science","Game Theory and AI for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08064-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:44:59Z","timestamp":1760219099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08064-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,12]]},"ISBN":["9783032080639","9783032080646"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08064-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,12]]},"assertion":[{"value":"12 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Game Theory and AI for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.gamesec-conf.org\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}