{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:18:06Z","timestamp":1750173486202,"version":"3.38.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"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":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02169-x","type":"journal-article","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T12:28:36Z","timestamp":1732883316000},"page":"313-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stabilization of capacitated matching games"],"prefix":"10.1007","volume":"210","author":[{"given":"Matthew","family":"Gerstbrein","sequence":"first","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4695-0576","authenticated-orcid":false,"given":"Lucy","family":"Verberk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"issue":"1","key":"2169_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S., Shubik, M.: The assignment game i: The core. International Journal of Game Theory 1(1), 111\u2013130 (1971)","journal-title":"International Journal of Game Theory"},{"key":"2169_CR2","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, E.: Balanced outcomes in social exchange networks. In: Proceedings of the 40th STOC, pp. 295\u2013304 (2008)","DOI":"10.1145\/1374376.1376994"},{"key":"2169_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: The bargaining problem. Econometrica 18, 155\u2013162 (1950)","journal-title":"Econometrica"},{"issue":"3","key":"2169_CR4","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"2169_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-13562-0_12","volume-title":"Theory and Applications of Models of Computation","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D.: On solution concepts for matching games. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) Theory and Applications of Models of Computation, pp. 117\u2013127. Springer, Berlin (2010)"},{"key":"2169_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-33996-7_19","volume-title":"Algorithmic Game Theory","author":"J K\u00f6nemann","year":"2012","unstructured":"K\u00f6nemann, J., Larson, K., Steiner, D.: Network bargaining: using approximate blocking sets to stabilize unstable instances. In: Serna, M. (ed.) Algorithmic Game Theory, pp. 216\u2013226. Springer, Berlin (2012)"},{"key":"2169_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-014-0854-1","volume":"154","author":"A Bock","year":"2015","unstructured":"Bock, A., Chandrasekaran, K., K\u00f6nemann, J., Peis, B., Sanit\u00e0, L.: Finding small stabilizers for unstable graphs. Math. Program. 154, 173\u2013196 (2015)","journal-title":"Math. Program."},{"key":"2169_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.disopt.2018.08.003","volume":"31","author":"K Chandrasekaran","year":"2019","unstructured":"Chandrasekaran, K., Gottschalk, C., K\u00f6nemann, J., Peis, B., Schmand, D., Wierz, A.: Additive stabilizers for unstable graphs. Discrete Optim. 31, 56\u201378 (2019)","journal-title":"Discrete Optim."},{"key":"2169_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-017-1177-9","volume":"172","author":"S Ahmadian","year":"2018","unstructured":"Ahmadian, S., Hosseinzadeh, H., Sanit\u00e0, L.: Stabilizing network bargaining games by blocking players. Math. Program. 172, 249\u2013275 (2018)","journal-title":"Math. Program."},{"key":"2169_CR10","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, K.: In: Fukunaga, T., Kawarabayashi, K.-i. (eds.) Graph Stabilization: A Survey, pp. 21\u201341. Springer, Singapore (2017)","DOI":"10.1007\/978-981-10-6147-9_2"},{"key":"2169_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2017.03.020","volume":"677","author":"T Ito","year":"2017","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677, 69\u201382 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2169_CR12","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1287\/moor.2019.1034","volume":"45","author":"ZK Koh","year":"2020","unstructured":"Koh, Z.K., Sanit\u00e0, L.: Stabilizing weighted graphs. Math. Oper. Res. 45(4), 1318\u20131341 (2020)","journal-title":"Math. Oper. Res."},{"key":"2169_CR13","unstructured":"Gottschalk, C.: Personal communication (2018)"},{"key":"2169_CR14","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games. arXiv (2010)","DOI":"10.1007\/978-3-642-14165-2_7"},{"key":"2169_CR15","doi-asserted-by":"crossref","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Network Bargaining with General Capacities. arXiv preprint arXiv:1306.4302 (2013)","DOI":"10.1007\/978-3-642-40450-4_37"},{"key":"2169_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some apx-completeness results for cubic graphs. Theor. Comput. Sci. 237, 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2169_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: Approximating the minimum maximal independence number. Inf. Process. Lett. 46(4), 169\u2013172 (1993)","journal-title":"Inf. Process. Lett."},{"key":"2169_CR18","unstructured":"Farczadi, L.: Matchings and games on networks. PhD thesis, University of Waterloo (2015)"},{"key":"2169_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-53174-7_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Bir\u00f3","year":"2016","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D., Wojuteczky, P.: The stable fixtures problem with payments. In: Mayr, E.W. (ed.) Graph-Theoretic Concepts in Computer Science, pp. 49\u201363. Springer, Berlin (2016)"},{"key":"2169_CR20","unstructured":"Benedek, M., Bir\u00f3, P., Kern, W., P\u00e1lv\u00f6lgyi, D., Paulusma, D.: Partitioned Matching Games for International Kidney Exchange (2023)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02169-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02169-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02169-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:05:08Z","timestamp":1740758708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02169-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2169"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02169-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"7 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}