{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:07:28Z","timestamp":1773965248669,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819628445","type":"print"},{"value":"9789819628452","type":"electronic"}],"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-981-96-2845-2_23","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:28Z","timestamp":1740067228000},"page":"361-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Unified Model of\u00a0Congestion Games with\u00a0Priorities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7662-7374","authenticated-orcid":false,"given":"Kenjiro","family":"Takazawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/15427951.2008.10129171","volume":"5","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., Goldberg, P.W., Mirrokni, V.S., R\u00f6glin, H., V\u00f6cking, B.: A unified approach to congestion games and two-sided markets. Internet Math. 5(4), 439\u2013457 (2008). https:\/\/doi.org\/10.1080\/15427951.2008.10129171","journal-title":"Internet Math."},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1\u201325:22 (2008). https:\/\/doi.org\/10.1145\/1455248.1455249","DOI":"10.1145\/1455248.1455249"},{"issue":"17","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17), 1552\u20131563 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.035","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl. Math. 101(1\u20133), 1\u201312 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00203-6","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/J.TCS.2007.02.050","volume":"379","author":"V Bansal","year":"2007","unstructured":"Bansal, V., Agrawal, A., Malhotra, V.S.: Polynomial time algorithm for an optimal stable assignment with multiple partners. Theor. Comput. Sci. 379(3), 317\u2013328 (2007). https:\/\/doi.org\/10.1016\/J.TCS.2007.02.050","journal-title":"Theor. Comput. Sci."},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114094","volume":"974","author":"V Bil\u00f2","year":"2023","unstructured":"Bil\u00f2, V., Vinci, C.: Congestion games with priority-based scheduling. Theor. Comput. Sci. 974, 114094 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.114094","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Vinci, C.: Coping with Selfishness in Congestion Games\u2014Analysis and Design via LP Duality. Monographs in Theoretical Computer Science. An EATCS Series, Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30261-9","DOI":"10.1007\/978-3-031-30261-9"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s10878-018-0269-7","volume":"37","author":"M Drees","year":"2019","unstructured":"Drees, M., Feldotto, M., Riechers, S., Skopalik, A.: Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2), 620\u2013638 (2019). https:\/\/doi.org\/10.1007\/s10878-018-0269-7","journal-title":"J. Comb. Optim."},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/IJOC.1110.0449","volume":"24","author":"P Eirinakis","year":"2012","unstructured":"Eirinakis, P., Magos, D., Mourtos, I., Miliotis, P.: Finding all stable pairs and solutions to the many-to-many stable matching problem. INFORMS J. Comput. 24(2), 245\u2013259 (2012). https:\/\/doi.org\/10.1287\/IJOC.1110.0449","journal-title":"INFORMS J. Comput."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-57586-5_19","volume-title":"Algorithms and Complexity","author":"M Feldotto","year":"2017","unstructured":"Feldotto, M., Leder, L., Skopalik, A.: Congestion games with complementarities. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 222\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_19"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s10878-017-0189-y","volume":"36","author":"M Feldotto","year":"2018","unstructured":"Feldotto, M., Leder, L., Skopalik, A.: Congestion games with mixed objectives. J. Comb. Optim. 36(4), 1145\u20131167 (2018). https:\/\/doi.org\/10.1007\/s10878-017-0189-y","journal-title":"J. Comb. Optim."},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0165-4896(03)00074-X","volume":"46","author":"T Fleiner","year":"2003","unstructured":"Fleiner, T.: On the stable $$b$$-matching polytope. Math. Soc. Sci. 46(2), 149\u2013158 (2003). https:\/\/doi.org\/10.1016\/S0165-4896(03)00074-X","journal-title":"Math. Soc. Sci."},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.orl.2015.04.002","volume":"43","author":"S Fujishige","year":"2015","unstructured":"Fujishige, S., Goemans, M.X., Harks, T., Peis, B., Zenklusen, R.: Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3), 329\u2013333 (2015). https:\/\/doi.org\/10.1016\/j.orl.2015.04.002","journal-title":"Oper. Res. Lett."},{"key":"23_CR14","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.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Goko, H., Makino, K., Miyazaki, S., Yokoi, Y.: Maximally satisfying lower quotas in the hospitals\/residents problem with ties. In: Berenbrink, P., Monmege, B. (eds.) 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022. LIPIcs, vol.\u00a0219, pp. 31:1\u201331:20 (2022). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2022.31","DOI":"10.4230\/LIPICS.STACS.2022.31"},{"key":"23_CR16","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem\u2014Structure and Algorithms. Foundations of Computing Series, MIT Press, Cambridge (1989)"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Hamada, K., Miyazaki, S., Yanagisawa, H.: Strategy-proof approximation algorithms for the stable marriage problem with ties and incomplete lists. In: Lu, P., Zhang, G. (eds.) 30th International Symposium on Algorithms and Computation, ISAAC 2019. LIPIcs, vol.\u00a0149, pp. 9:1\u20139:14 (2019). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2019.9","DOI":"10.4230\/LIPICS.ISAAC.2019.9"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1137\/16M1107450","volume":"28","author":"T Harks","year":"2018","unstructured":"Harks, T., Klimm, M., Peis, B.: Sensitivity analysis for convex separable optimization over integral polymatroids. SIAM J. Optim. 28(3), 2222\u20132245 (2018). https:\/\/doi.org\/10.1137\/16M1107450","journal-title":"SIAM J. Optim."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-24971-1_10","volume-title":"Gems of Combinatorial Optimization and Graph Algorithms","author":"T Harks","year":"2015","unstructured":"Harks, T., Peis, B.: Resource buying games. In: Schulz, A.S., Skutella, M., Stiller, S., Wagner, D. (eds.) Gems of Combinatorial Optimization and Graph Algorithms, pp. 103\u2013111. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24971-1_10"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s10878-017-0166-5","volume":"36","author":"T Harks","year":"2018","unstructured":"Harks, T., Timmermans, V.: Uniqueness of equilibria in atomic splittable polymatroid congestion games. J. Comb. Optim. 36(3), 812\u2013830 (2018). https:\/\/doi.org\/10.1007\/s10878-017-0166-5","journal-title":"J. Comb. Optim."},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"Huang, C.-C., Iwama, K., Miyazaki, S., Yanagisawa, H.: A tight approximation bound for the stable marriage problem with restricted ties. In: Garg, N., Jansen, K., Rao, A., Rolim, J.D.P. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2015. LIPIcs, vol.\u00a040, pp. 361\u2013380 (2015). https:\/\/doi.org\/10.4230\/LIPICS.APPROX-RANDOM.2015.361","DOI":"10.4230\/LIPICS.APPROX-RANDOM.2015.361"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Huang, C.-C., Kavitha, T.: Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154(1\u20132), 353\u2013380 (2015). https:\/\/doi.org\/10.1007\/S10107-015-0923-0","DOI":"10.1007\/S10107-015-0923-0"},{"key":"23_CR23","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Veloso, M.M., Kambhampati, S. (eds.) 20th Annual AAAI Conference on Artificial Intelligence, AAAI 2005, pp. 489\u2013494 (2005). http:\/\/www.aaai.org\/Library\/AAAI\/2005\/aaai05-077.php"},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994). https:\/\/doi.org\/10.1016\/0166-218X(92)00179-P","journal-title":"Discrete Appl. Math."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48433-3_1","volume-title":"Algorithmic Game Theory","author":"N Kamiyama","year":"2015","unstructured":"Kamiyama, N.: Stable matchings with ties, master preference lists, and matroid constraints. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 3\u201314. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48433-3_1"},{"key":"23_CR26","unstructured":"Kamiyama, N.: Many-to-many stable matchings with ties, master preference lists, and matroid constraints. In: Elkind, E., Veloso, M., Agmon, N., Taylor, M.E. (eds.) 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2019, pp. 583\u2013591. IFAAMAS (2019). http:\/\/dl.acm.org\/citation.cfm?id=3331743"},{"key":"23_CR27","doi-asserted-by":"publisher","unstructured":"Kavitha, T.: Stable matchings with one-sided ties and approximate popularity. In: Dawar, A., Guruswami, V. (eds.) 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022. LIPIcs, vol.\u00a0250, pp. 22:1\u201322:17 (2022). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2022.22","DOI":"10.4230\/LIPICS.FSTTCS.2022.22"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/S10878-024-01218-7","volume":"48","author":"F Kiyosue","year":"2024","unstructured":"Kiyosue, F., Takazawa, K.: A common generalization of budget games and congestion games. J. Comb. Optim. 48, 24 (2024). https:\/\/doi.org\/10.1007\/S10878-024-01218-7","journal-title":"J. Comb. Optim."},{"key":"23_CR29","doi-asserted-by":"publisher","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. Series on Theoretical Computer Science, vol.\u00a02. World Scientific (2013). https:\/\/doi.org\/10.1142\/8591","DOI":"10.1142\/8591"},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/S00453-009-9326-Z","volume":"58","author":"D Marx","year":"2010","unstructured":"Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170\u2013187 (2010). https:\/\/doi.org\/10.1007\/S00453-009-9326-Z","journal-title":"Algorithmica"},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13, 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996). https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econ. Behav."},{"key":"23_CR33","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"23_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973). https:\/\/doi.org\/10.1007\/BF01737559","journal-title":"Int. J. Game Theory"},{"key":"23_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316779309","volume-title":"Twenty Lectures on Algorithmic Game Theory","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden, T.: Twenty Lectures on Algorithmic Game Theory. Cambridge University Press, Cambridge (2016)"},{"issue":"4","key":"23_CR36","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/S001820050126","volume":"28","author":"M Sotomayor","year":"1999","unstructured":"Sotomayor, M.: The lattice structure of the set of stable outcomes of the multiple partners assignment game. Int. J. Game Theory 28(4), 567\u2013583 (1999). https:\/\/doi.org\/10.1007\/S001820050126","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"23_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0165-4896(98)00048-1","volume":"38","author":"M Sotomayor","year":"1999","unstructured":"Sotomayor, M.: Three remarks on the many-to-many stable matching problem. Math. Soc. Sci. 38(1), 55\u201370 (1999)","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"23_CR38","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/s10878-019-00435-9","volume":"38","author":"K Takazawa","year":"2019","unstructured":"Takazawa, K.: Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. J. Comb. Optim. 38(4), 1043\u20131065 (2019). https:\/\/doi.org\/10.1007\/s10878-019-00435-9","journal-title":"J. Comb. Optim."},{"key":"23_CR39","doi-asserted-by":"publisher","unstructured":"Takazawa, K.: Pure Nash equilibria in weighted congestion games with complementarities and beyond. In: Dastani, M., Sichman, J.S., Alechina, N., Dignum, V. (eds.) Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024, pp. 2495\u20132497. ACM (2024). https:\/\/doi.org\/10.5555\/3635637.3663205","DOI":"10.5555\/3635637.3663205"},{"key":"23_CR40","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.dam.2024.10.017","volume":"361","author":"K Takazawa","year":"2025","unstructured":"Takazawa, K.: Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond. Discrete Appl. Math. 361, 226\u2013235 (2025). https:\/\/doi.org\/10.1016\/j.dam.2024.10.017","journal-title":"Discrete Appl. Math."},{"key":"23_CR41","doi-asserted-by":"publisher","unstructured":"Yokoi, Y.: An approximation algorithm for maximum stable matching with ties and constraints. In: Ahn, H., Sadakane, K. (eds.) 32nd International Symposium on Algorithms and Computation, ISAAC 2021. LIPIcs, vol.\u00a0212, pp. 71:1\u201371:16 (2021). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2021.71","DOI":"10.4230\/LIPICS.ISAAC.2021.71"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:33Z","timestamp":1740067233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_23"}},"subtitle":["Two-Sided Markets with Ties, Finite and Non-affine Delay Functions, and Pure Nash Equilibria"],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}