{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:47:23Z","timestamp":1742932043777,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"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-32726-1_12","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stabilization of\u00a0Capacitated Matching Games"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Gerstbrein","sequence":"first","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]},{"given":"Lucy","family":"Verberk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"12_CR1","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."},{"doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games (2010)","key":"12_CR2","DOI":"10.1007\/978-3-642-14165-2_7"},{"key":"12_CR3","first-page":"117","volume-title":"Theory Appl. Models Comput.","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 Appl. Models Comput., pp. 117\u2013127. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"key":"12_CR4","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":"12_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-981-10-6147-9_2","volume-title":"Combinatorial Optimization and Graph Algorithms","author":"K Chandrasekaran","year":"2017","unstructured":"Chandrasekaran, K.: Graph stabilization: a survey. In: Fukunaga, T., Kawarabayashi, K. (eds.) Combinatorial Optimization and Graph Algorithms, pp. 21\u201341. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-6147-9_2"},{"key":"12_CR6","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. Discret. Optim. 31, 56\u201378 (2019)","journal-title":"Discret. Optim."},{"issue":"3","key":"12_CR7","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."},{"unstructured":"Farczadi, L.: Matchings and games on networks, Ph. D. thesis, University of Waterloo (2015)","key":"12_CR8"},{"doi-asserted-by":"crossref","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Network bargaining with general capacities. arXiv preprint arXiv:1306.4302 (2013)","key":"12_CR9","DOI":"10.1007\/978-3-642-40450-4_37"},{"doi-asserted-by":"crossref","unstructured":"Gerstbrein, M., Sanit\u00e0, L., Verberk, L.: Stabilization of capacitated matching games. arXiv preprint (2022)","key":"12_CR10","DOI":"10.1007\/978-3-031-32726-1_12"},{"unstructured":"Gottschalk, C.: Personal communication (2018)","key":"12_CR11"},{"issue":"4","key":"12_CR12","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":"12_CR13","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. Theoret. Comput. Sci. 677, 69\u201382 (2017)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Balanced outcomes in social exchange networks. In: Proceedings of the 40th STOC, pp. 295\u2013304 (2008)","key":"12_CR14","DOI":"10.1145\/1374376.1376994"},{"issue":"4","key":"12_CR15","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":"12_CR16","series-title":"Lecture Notes in Computer Science","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.) SAGT 2012. LNCS, pp. 216\u2013226. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33996-7_19"},{"key":"12_CR17","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":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L Shapley","year":"1971","unstructured":"Shapley, L., Shubik, M.: The assignment game i: The core. Internat. J. Game Theory 1(1), 111\u2013130 (1971)","journal-title":"Internat. J. Game Theory"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T14:02:14Z","timestamp":1702476134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_12","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":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"33","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":"28% - 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":"2","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)"}}]}}