{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:38:32Z","timestamp":1743104312943,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826962"},{"type":"electronic","value":"9783031826979"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82697-9_9","type":"book-chapter","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T05:43:11Z","timestamp":1739770991000},"page":"112-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Complexity of\u00a0Equilibria with\u00a0Strategic Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3295-543X","authenticated-orcid":false,"given":"Bruce M.","family":"Kapron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8960-9282","authenticated-orcid":false,"given":"Koosha","family":"Samieefar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Ahmadi, A.A., Zhang, J.: Semidefinite Programming and Nash Equilibria in Bimatrix Games. INFORMS J. Comput. 33(2), 607\u2013628 (2021) https:\/\/doi.org\/10.1287\/ijoc.2020.0960","DOI":"10.1287\/ijoc.2020.0960"},{"issue":"10","key":"9_CR2","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/TAC.2009.2029302","volume":"54","author":"E Altman","year":"2009","unstructured":"Altman, E., Solan, E.: Constrained games: the impact of the attitude to adversary\u2019s constraints. IEEE Trans. Automat. Contr. 54(10), 2435\u20132440 (2009)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Arrow, K.J.: An Extension of the Basic Theorems of Classical welfare Economics (1951)","DOI":"10.1525\/9780520411586-038"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Austrin, P., Braverman, M., Chlamt\u00e1\u010d, E.: Inapproximability of NP-complete variants of Nash equilibrium. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 13\u201325. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22935-0_2"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2908734","volume":"63","author":"Y Babichenko","year":"2016","unstructured":"Babichenko, Y.: Query complexity of approximate Nash equilibria. J. ACM 63(4), 1\u201324 (2016)","journal-title":"J. ACM"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Barbanel, J.B.: Super envy-free cake division and independence of measures. J. Math. Anal. Appl. 197(1), 54\u201360 (1996). https:\/\/doi.org\/10.1006\/S0022-247X(96)90006-2. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022247X96900062","DOI":"10.1006\/S0022-247X(96)90006-2"},{"key":"9_CR7","unstructured":"Barman, S., Ghalme, G., Jain, S., Kulkarni, P., Narang, S.: Fair Division of Indivisible Goods Among Strategic Agents (2019)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Berthelsen, M.L.T., Hansen, K.A.: On the computational complexity of decision problems about multi-player Nash equilibria. Theory Comput. Syst. 66(3), 519\u2013545 (2022). https:\/\/doi.org\/10.1007\/s00224-022-10080-1","DOI":"10.1007\/s00224-022-10080-1"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Mavronicolas, M.: $$\\exists $$$$\\mathbb{R} $$-complete Decision Problems about (Symmetric) Nash equilibria in (symmetric) multi-player games. ACM Trans. Econ. Comput. 9(3), 1\u201325 (2021). https:\/\/doi.org\/10.1145\/3456758","DOI":"10.1145\/3456758"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00453-020-00763-x","volume":"83","author":"V Bil\u00f2","year":"2021","unstructured":"Bil\u00f2, V., Mavronicolas, M.: The complexity of computational problems about Nash equilibria in symmetric win-lose games. Algorithmica 83(2), 447\u2013530 (2021)","journal-title":"Algorithmica"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Br\u00e2nzei, S., Caragiannis, I., Kurokawa, D., Procaccia, A.: An algorithmic framework for strategic fair division. In: Proceedings of the AAAI Conference on Artificial Intelligence 30(1) (Feb 2016). https:\/\/doi.org\/10.1609\/aaai.v30i1.10042","DOI":"10.1609\/aaai.v30i1.10042"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Br\u00e2nzei, S., Gkatzelis, V., Mehta, R.: Nash social welfare approximation for strategic agents. Oper. Res. 70(1), 402\u2013415 (2022). https:\/\/doi.org\/10.1287\/opre.2020.2056","DOI":"10.1287\/opre.2020.2056"},{"key":"9_CR13","unstructured":"Br\u00e2nzei, S., Miltersen, P.B.: Equilibrium analysis in cake cutting. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-Agent Systems, pp. 327\u2013334. AAMAS \u201913, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2013)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Charnes, A.: Constrained games and linear programming. Proc. National Acad. Sci. 39(7), 639\u2013641 (1953). http:\/\/www.jstor.org\/stable\/88683","DOI":"10.1073\/pnas.39.7.639"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 1\u201357 (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Codenotti, B., \u0160tefankovi\u010d, D.: On the computational complexity of Nash equilibria for (0,1) bimatrix games. Inf. Process. Lett. 94(3), 145\u2013150 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.01.010, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019005000281","DOI":"10.1016\/j.ipl.2005.01.010"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: New complexity results about Nash equilibria. Games Econ. Behav. 63(2), 621\u2013641 (2008)","DOI":"10.1016\/j.geb.2008.02.015"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Deligkas, A., Fasoulakis, M., Fearnley, J., Jurdzi\u0144ski, M., Savani, R.: Distributed methods for computing approximate equilibria. In: Web and Internet Economics, pp. 15\u201328. Lecture notes in computer science, Springer Berlin Heidelberg, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-54110-4_2"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1007\/s00453-018-0465-y","volume":"81","author":"A Czumaj","year":"2019","unstructured":"Czumaj, A., Deligkas, A., Fasoulakis, M., Fearnley, J., Jurdzi\u0144ski, M., Savani, R.: Distributed methods for computing approximate equilibria. Algorithmica 81(3), 1205\u20131231 (2019)","journal-title":"Algorithmica"},{"key":"9_CR20","unstructured":"Czumaj, A., Fasoulakis, M., Jurdzinski, M.: Approximate Nash equilibria with near optimal social welfare. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 504\u2013510. IJCAI\u201915, AAAI Press (2015)"},{"key":"9_CR21","unstructured":"Czumaj, A., Fasoulakis, M., Jurdzinski, M.: Approximate plutocratic and egalitarian Nash equilibria: (extended abstract). In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 1409\u20131410. AAMAS \u201916, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2016)"},{"key":"9_CR22","unstructured":"Daskalakis, C.: Non-concave Games: A Challenge for Game Theory\u2019s Next 100 Years (2022)"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"issue":"17","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2008.12.031","volume":"410","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. Theor. Comput. Sci. 410(17), 1581\u20131588 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Daskalakis, C., Papadimitriou, C.H.: On oblivious PTAS\u2019s for Nash equilibrium. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 75\u201384. STOC \u201909, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536427","DOI":"10.1145\/1536414.1536427"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Debreu, G.: A social equilibrium existence theorem. Proc. Natl. Acad. Sci. 38(10), 886\u2013893 (1952). https:\/\/doi.org\/10.1073\/pnas.38.10.886, https:\/\/www.pnas.org\/doi\/abs\/10.1073\/pnas.38.10.886","DOI":"10.1073\/pnas.38.10.886"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Deligkas, A., Fearnley, J., Hollender, A., Melissourgos, T.: Pure-circuit: strong Inapproximability for Ppad. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 159\u2013170. IEEE Computer Society, Los Alamitos, CA, USA (nov 2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00022, https:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS54457.2022.00022","DOI":"10.1109\/FOCS54457.2022.00022"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Deligkas, A., Fasoulakis, M., Markakis, E.: A Polynomial-Time Algorithm for 1\/2-Well-Supported Nash Equilibria in Bimatrix Games (2022). https:\/\/doi.org\/10.48550\/ARXIV.2207.07007","DOI":"10.48550\/ARXIV.2207.07007"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-662-54110-4_3","volume-title":"Web and Internet Economics","author":"A Deligkas","year":"2016","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Inapproximability results for approximate Nash equilibria. In: Cai, Y., Vetta, A. (eds.) Web and Internet Economics, pp. 29\u201343. Springer, Berlin Heidelberg, Berlin, Heidelberg (2016)"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Computing constrained approximate equilibria in polymatrix games. In: Algorithmic Game Theory, pp. 93\u2013105. Springer International Publishing (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_8","DOI":"10.1007\/978-3-319-66700-3_8"},{"issue":"6","key":"9_CR31","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Kanzow, C.: Generalized Nash equilibrium problems. 4OR 5(3), 173\u2013210 (2007)","DOI":"10.1007\/s10288-007-0054-4"},{"issue":"1","key":"9_CR33","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10479-009-0653-x","volume":"175","author":"F Facchinei","year":"2010","unstructured":"Facchinei, F., Kanzow, C.: Generalized Nash equilibrium problems. Ann. Oper. Res. 175(1), 177\u2013211 (2010)","journal-title":"Ann. Oper. Res."},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Filos-Ratsikas, A., Hansen, K.A., H\u00f8gh, K., Hollender, A.: Fixp-membership via convex optimization: games, cakes, and markets. SIAM J. Comput. 0(0), FOCS21\u201330\u2013FOCS21\u201384 (0).https:\/\/doi.org\/10.1137\/22M1472656","DOI":"10.1137\/22M1472656"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Filos-Ratsikas, A., Hansen, K.A., H\u00f8gh, K., Hollender, A.: PPAD-membership for problems with exact rational solutions: a general approach via convex optimization. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. STOC \u201924, ACM (Jun 2024). https:\/\/doi.org\/10.1145\/3618260.3649645","DOI":"10.1145\/3618260.3649645"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Garg, J., Mehta, R., Vazirani, V.V., Yazdanbod, S.: ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria. In: Automata, Languages, and Programming, pp. 554\u2013566. Springer Berlin Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_45","DOI":"10.1007\/978-3-662-47672-7_45"},{"key":"9_CR37","unstructured":"George, G., Stern, M.: Puzzle-math the Big Bang to Black Holes. Viking Press (1958)"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria: some complexity considerations. Games Econom. Behav. 1(1), 80\u201393 (1989). https:\/\/doi.org\/10.1016\/0899-8256(89)90006-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0899825689900067","DOI":"10.1016\/0899-8256(89)90006-7"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Goos, M., Rubinstein, A.: Near-optimal communication lower bounds for approximate Nash equilibria. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (Oct 2018)","DOI":"10.1109\/FOCS.2018.00045"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Hazan, E., Krauthgamer, R.: How hard is it to approximate the best Nash equilibrium? SIAM J. Comput. 40(1), 79\u201391 (2011). https:\/\/doi.org\/10.1137\/090766991","DOI":"10.1137\/090766991"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Kaneko, M., Nakamura, K.: The Nash social welfare function. Econometrica 47(2), 423\u2013435 (1979). http:\/\/www.jstor.org\/stable\/1914191","DOI":"10.2307\/1914191"},{"key":"9_CR42","unstructured":"Kapron, B.M., Samieefar, K.: On the computational complexity of quasi-variational inequalities and multi-leader-follower games. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, pp. 2324\u20132326. AAMAS \u201924, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2024)"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 4th ACM Conference on Electronic Commerce - EC \u201903. ACM Press, New York, New York, USA (2003)","DOI":"10.1145\/779928.779933"},{"key":"9_CR44","unstructured":"McKinsey, J.: Introduction to the Theory of Games. McGraw-Hill Book Co. (1952)"},{"issue":"2","key":"9_CR45","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.geb.2009.10.003","volume":"68","author":"A McLennan","year":"2010","unstructured":"McLennan, A., Tourky, R.: Simple complexity from imitation games. Games Econ. Behav. 68(2), 683\u2013688 (2010)","journal-title":"Games Econ. Behav."},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theoret. Comput. Sci. 81(2), 317\u2013324 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90200-l","DOI":"10.1016\/0304-3975(91)90200-l"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36(1), 48\u201349 (1950). https:\/\/doi.org\/10.1073\/pnas.36.1.48","DOI":"10.1073\/pnas.36.1.48"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C., Vlatakis-Gkaragkounis, E.V., Zampetakis, M.: The computational complexity of multi-player concave games and kakutani fixed points. In: Proceedings of the 24th ACM Conference on Economics and Computation, pp.\u00a01045. EC \u201923, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3580507.3597812","DOI":"10.1145\/3580507.3597812"},{"issue":"3","key":"9_CR49","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Rosen, J.B.: Existence and uniqueness of equilibrium points for concave N-Person Games. Econometrica 33(3), 520\u2013534 (1965), http:\/\/www.jstor.org\/stable\/1911749","DOI":"10.2307\/1911749"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Inapproximability of Nash equilibrium. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing. ACM, New York, NY, USA (Jun 2015)","DOI":"10.1145\/2746539.2746578"},{"key":"9_CR52","doi-asserted-by":"publisher","unstructured":"Rubinstein, A.: Settling the complexity of computing approximate two-player Nash equilibria. SIGecom Exch. 15(2), 45\u201349 (2017). https:\/\/doi.org\/10.1145\/3055589.3055596","DOI":"10.1145\/3055589.3055596"},{"key":"9_CR53","doi-asserted-by":"publisher","unstructured":"Samieefar, K.: A meta-heuristic approach for strategic fair division problems. In: Proceedings of the 2023 7th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, pp. 87\u201394. ISMSI \u201923, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3596947.3596969","DOI":"10.1145\/3596947.3596969"},{"issue":"2","key":"9_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2189778.2189779","volume":"4","author":"GR Schoenebeck","year":"2012","unstructured":"Schoenebeck, G.R., Vadhan, S.: The computational complexity of Nash equilibria in concisely represented games. ACM Trans. Comput. Theory 4(2), 1\u201350 (2012)","journal-title":"ACM Trans. Comput. Theory"},{"key":"9_CR55","doi-asserted-by":"publisher","unstructured":"Shafer, W., Sonnenschein, H.: Equilibrium in abstract economies without ordered preferences. J. Math. Econ. 2(3), 345\u2013348 (1975). https:\/\/doi.org\/10.1016\/0304-4068(75)90002-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304406875900026","DOI":"10.1016\/0304-4068(75)90002-6"},{"key":"9_CR56","doi-asserted-by":"publisher","unstructured":"Stengel, B.v.: Equilibrium Computation for Two-Player Games in Strategic and Extensive Form, pp. 53\u201378. Cambridge University Press (2007). https:\/\/doi.org\/10.1017\/CBO9780511800481.005","DOI":"10.1017\/CBO9780511800481.005"},{"key":"9_CR57","doi-asserted-by":"publisher","unstructured":"Tadenuma, K., Thomson, W.: Games of fair division. Games Econom. Behav. 9(2), 191\u2013204 (1995). https:\/\/doi.org\/10.1006\/game.1995.1015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825685710159","DOI":"10.1006\/game.1995.1015"},{"key":"9_CR58","doi-asserted-by":"publisher","unstructured":"Webb, W.A.: An algorithm for super envy-free cake division. J. Math. Anal. Appl. 239(1), 175\u2013179 (1999). https:\/\/doi.org\/10.1006\/jmaa.1999.6581, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022247X99965812","DOI":"10.1006\/jmaa.1999.6581"},{"key":"9_CR59","unstructured":"Wieczorek, A.: Constrained and indefinite games and their applications. Instytut Matematyczny Polskiej Akademi Nauk (1983). http:\/\/eudml.org\/doc\/268472"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82697-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T05:43:22Z","timestamp":1739771002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82697-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826962","9783031826979"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82697-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}