{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:29:30Z","timestamp":1757780970241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432538"},{"type":"electronic","value":"9783031432545"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_18","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"311-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computational Complexity of\u00a0k-Stable Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-6292","authenticated-orcid":false,"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3811-4332","authenticated-orcid":false,"given":"Gergely","family":"Cs\u00e1ji","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4991-2599","authenticated-orcid":false,"given":"\u00c1gnes","family":"Cseh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"DJ Abraham","year":"2004","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 3\u201315. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_3"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37, 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.geb.2013.08.006","volume":"82","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Pareto optimality in coalition formation. Games Econ. Behav. 82, 562\u2013581 (2013)","journal-title":"Games Econ. Behav."},{"key":"18_CR4","unstructured":"Aziz, H., Chen, J., Gaspers, S., Sun, Z.: Stability and Pareto optimality in refugee allocation matchings. In: AAMAS\u201918, pp. 964\u2013972 (2018)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Cs\u00e1ji, G., Cseh, A.: Computational complexity of $$k$$-stable matchings. arXiv preprint arXiv:2307.03794 (2023)","DOI":"10.1007\/978-3-031-43254-5_18"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jeth.1998.2469","volume":"84","author":"M Balinski","year":"1999","unstructured":"Balinski, M., S\u00f6nmez, T.: A tale of two mechanisms: student placement. J. Econ. Theory 84(1), 73\u201394 (1999)","journal-title":"J. Econ. Theory"},{"key":"18_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103768","volume":"312","author":"A Balliu","year":"2022","unstructured":"Balliu, A., Flammini, M., Melideo, G., Olivetti, D.: On Pareto optimality in social distance games. Artif. Intell. 312, 103768 (2022)","journal-title":"Artif. Intell."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-662-47666-6_40","volume-title":"Automata, Languages, and Programming","author":"S Bhattacharya","year":"2015","unstructured":"Bhattacharya, S., Hoefer, M., Huang, C.-C., Kavitha, T., Wagner, L.: Maintaining near-popular matchings. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 504\u2013515. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_40"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Gudmundsson, J.: Complexity of finding Pareto-efficient allocations of highest welfare. Eur. J. Oper. Res. (2020)","DOI":"10.1016\/j.ejor.2020.03.018"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","volume-title":"Algorithms and Complexity","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13073-1_10"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica 72(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Braun, S., Dwenger, N., K\u00fcbler, D.: Telling the truth may not pay off: an empirical study of centralized university admissions in Germany. B.E. J. Econ. Anal. Policy 10, article 22 (2010)","DOI":"10.2202\/1935-1682.2294"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Bullinger, M.: Pareto-optimality in cardinal hedonic games. In: AAMAS\u201920, pp. 213\u2013221 (2020)","DOI":"10.24963\/ijcai.2021\/10"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.disopt.2014.09.002","volume":"14","author":"K Cechl\u00e1rov\u00e1","year":"2014","unstructured":"Cechl\u00e1rov\u00e1, K., Eirinakis, P., Fleiner, T., Magos, D., Mourtos, I., Potpinkov\u00e1, E.: Pareto optimality in many-to-many matching problems. Discret. Optim. 14, 160\u2013169 (2014)","journal-title":"Discret. Optim."},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s00224-016-9677-1","volume":"59","author":"K Cechl\u00e1rov\u00e1","year":"2016","unstructured":"Cechl\u00e1rov\u00e1, K., et al.: Pareto optimal matchings in many-to-many markets with ties. Theory Comput. Syst. 59(4), 700\u2013721 (2016)","journal-title":"Theory Comput. Syst."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1257\/000282802762024728","volume":"92","author":"Y Chen","year":"2002","unstructured":"Chen, Y., S\u00f6nmez, T.: Improving efficiency of on-campus housing: an experimental study. Am. Econ. Rev. 92, 1669\u20131686 (2002)","journal-title":"Am. Econ. Rev."},{"key":"18_CR17","unstructured":"Condorcet, M.: Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. L\u2019Imprimerie Royale (1785)"},{"key":"18_CR18","unstructured":"Cseh, \u00c1.: Popular matchings. Trends Comput. Soc. Choice 105(3) (2017)"},{"issue":"5","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/s00453-020-00791-7","volume":"83","author":"\u00c1 Cseh","year":"2021","unstructured":"Cseh, \u00c1., Kavitha, T.: Popular matchings in complete graphs. Algorithmica 83(5), 1493\u20131523 (2021)","journal-title":"Algorithmica"},{"issue":"4","key":"18_CR20","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1137\/16M1076162","volume":"31","author":"\u00c1 Cseh","year":"2017","unstructured":"Cseh, \u00c1., Huang, C.-C., Kavitha, T.: Popular matchings with two-sided preferences and one-sided ties. SIAM J. Discret. Math. 31(4), 2348\u20132377 (2017)","journal-title":"SIAM J. Discret. Math."},{"issue":"05","key":"18_CR21","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1142\/S0129054113500226","volume":"24","author":"A Darmann","year":"2013","unstructured":"Darmann, A.: Popular spanning trees. Int. J. Found. Comput. Sci. 24(05), 655\u2013677 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.mathsocsci.2018.01.005","volume":"93","author":"A Darmann","year":"2018","unstructured":"Darmann, A.: A social choice approach to ordinal group activity selection. Math. Soc. Sci. 93, 57\u201366 (2018)","journal-title":"Math. Soc. Sci."},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s001860200207","volume":"55","author":"M Ehrgott","year":"2002","unstructured":"Ehrgott, M., Nickel, S.: On the number of criteria needed to decide Pareto optimality. Math. Methods Oper. Res. 55(3), 329\u2013345 (2002). https:\/\/doi.org\/10.1007\/s001860200207","journal-title":"Math. Methods Oper. Res."},{"key":"18_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103357","volume":"288","author":"E Elkind","year":"2020","unstructured":"Elkind, E., Fanelli, A., Flammini, M.: Price of Pareto optimality in hedonic games. Artif. Intell. 288, 103357 (2020)","journal-title":"Artif. Intell."},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Kavitha, T., Powers, V., Zhang, X.: Popular matchings and limits to tractability. In: Proceedings of SODA \u201919: the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2790\u20132809. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.173"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00199-005-0033-y","volume":"29","author":"M Florenzano","year":"2006","unstructured":"Florenzano, M., Gourdel, P., Jofr\u00e9, A.: Supporting weakly Pareto optimal allocations in infinite dimensional nonconvex economies. Econ. Theor. 29, 549\u2013564 (2006)","journal-title":"Econ. Theor."},{"issue":"2","key":"18_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"H Gabow","year":"1976","unstructured":"Gabow, H.: An efficient implementations of Edmonds\u2019 algorithm for maximum matching on graphs. J. ACM 23(2), 221\u2013234 (1976)","journal-title":"J. ACM"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-540-74466-5_88","volume-title":"Euro-Par 2007 Parallel Processing","author":"A-T Gai","year":"2007","unstructured":"Gai, A.-T., Lebedev, D., Mathieu, F., de Montgolfier, F., Reynier, J., Viennot, L.: Acyclic preference systems in P2P networks. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 825\u2013834. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74466-5_88"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"key":"18_CR31","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Gupta, S., Misra, P., Saurabh, S., Zehavi, M.: Popular matching in roommates setting is NP-hard. ACM Trans. Comput. Theory 13(2) (2021). ISSN 1942-3454","DOI":"10.1145\/3442354"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: A $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ic.2012.10.012","volume":"222","author":"C-C Huang","year":"2013","unstructured":"Huang, C.-C., Kavitha, T.: Popular matchings in the stable marriage problem. Inf. Comput. 222, 180\u2013194 (2013)","journal-title":"Inf. Comput."},{"issue":"1","key":"18_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/110852838","volume":"27","author":"C-C Huang","year":"2013","unstructured":"Huang, C.-C., Kavitha, T.: Near-popular matchings in the roommates problem. SIAM J. Discret. Math. 27(1), 43\u201362 (2013)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"18_CR36","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1287\/moor.2020.1063","volume":"46","author":"C-C Huang","year":"2021","unstructured":"Huang, C.-C., Kavitha, T.: Popularity, mixed matchings, and self-duality. Math. Oper. Res. 46(2), 405\u2013427 (2021)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"18_CR37","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/s00453-010-9434-9","volume":"61","author":"C-C Huang","year":"2011","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. Algorithmica 61(3), 738\u2013757 (2011)","journal-title":"Algorithmica"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithms 6, 577\u2013595 (1985)","DOI":"10.1016\/0196-6774(85)90033-1"},{"key":"18_CR39","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/120902562","volume":"43","author":"T Kavitha","year":"2014","unstructured":"Kavitha, T.: A size-popularity tradeoff in the stable marriage problem. SIAM J. Comput. 43, 52\u201371 (2014)","journal-title":"SIAM J. Comput."},{"key":"18_CR40","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1016\/j.tcs.2010.03.028","volume":"412","author":"T Kavitha","year":"2011","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. Theoret. Comput. Sci. 412, 2679\u20132690 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"18_CR41","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10107-021-01659-6","volume":"192","author":"T Kavitha","year":"2022","unstructured":"Kavitha, T., Kir\u00e1ly, T., Matuschke, J., Schlotter, I., Schmidt-Kraepelin, U.: Popular branchings and their dual certificates. Math. Program. 192(1), 567\u2013595 (2022)","journal-title":"Math. Program."},{"key":"18_CR42","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Kir\u00e1ly, T., Matuschke, J., Schlotter, I., Schmidt-Kraepelin, U.: The popular assignment problem: when cardinality is more important than popularity. In: SODA \u201922: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 103\u2013123. SIAM (2022b","DOI":"10.1137\/1.9781611977073.6"},{"key":"18_CR43","unstructured":"Kraiczy, S., Cseh, \u00c1., Manlove, D.: On weakly and strongly popular rankings. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS \u201921, Richland, SC, pp. 1563\u20131565. International Foundation for Autonomous Agents and Multiagent Systems (2021). ISBN 9781450383073"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., Algorithmics of Matching Under Preferences. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"18_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-78773-0_51","volume-title":"LATIN 2008: Theoretical Informatics","author":"RM McCutchen","year":"2008","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 593\u2013604. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_51"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An $$O(\\sqrt{|V|} \\cdot |E|)$$ algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS \u201980: The 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 17\u201327. IEEE Computer Society (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"18_CR47","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00182-007-0083-4","volume":"36","author":"N Perach","year":"2008","unstructured":"Perach, N., Polak, J., Rothblum, U.G.: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion. Internat. J. Game Theory 36, 519\u2013535 (2008)","journal-title":"Internat. J. Game Theory"},{"key":"18_CR48","first-page":"1","volume":"30","author":"D Peters","year":"2016","unstructured":"Peters, D.: Complexity of hedonic games with dichotomous preferences. Proceedings AAAI Conf. Artif. Intell. 30, 1 (2016)","journal-title":"Proceedings AAAI Conf. Artif. Intell."},{"key":"18_CR49","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0165-1765(82)90003-9","volume":"9","author":"AE Roth","year":"1982","unstructured":"Roth, A.E.: Incentive compatibility in a market with indivisible goods. Econ. Lett. 9, 127\u2013132 (1982)","journal-title":"Econ. Lett."},{"key":"18_CR50","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Econometric Society Monographs, vol. 18. Cambridge University Press, Cambridge (1990)","DOI":"10.1017\/CCOL052139015X"},{"issue":"3","key":"18_CR51","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s00224-020-09978-5","volume":"65","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Unpopularity factor in the marriage and roommates problems. Theory Comput. Syst. 65(3), 579\u2013592 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"18_CR52","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0196-6774(91)90028-W","volume":"12","author":"JJ Tan","year":"1991","unstructured":"Tan, J.J.: A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms 12(1), 154\u2013178 (1991)","journal-title":"J. Algorithms"},{"key":"18_CR53","unstructured":"Thakur, A.: Combining social choice and matching theory to understand institutional stability. In: The 25th Annual ISNIE \/ SIOE Conference. Society for Institutional and Organizational Economics (2021)"},{"key":"18_CR54","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.dam.2012.07.006","volume":"165","author":"A van Zuylen","year":"2014","unstructured":"van Zuylen, A., Schalekamp, F., Williamson, D.: Popular ranking. Discret. Appl. Math. 165, 312\u2013316 (2014)","journal-title":"Discret. Appl. Math."},{"key":"18_CR55","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF00933970","volume":"40","author":"AR Warburton","year":"1983","unstructured":"Warburton, A.R.: Quasiconcave vector maximization: connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives. J. Optim. Theory Appl. 40, 537\u2013557 (1983)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43254-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T22:40:51Z","timestamp":1703112051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","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":"sagt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}