{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:02:39Z","timestamp":1760299359173},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_14","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:35:59Z","timestamp":1464129359000},"page":"164-177","source":"Crossref","is-referenced-by-count":1,"title":["Stabilizing Network Bargaining Games by Blocking Players"],"prefix":"10.1007","author":[{"given":"Sara","family":"Ahmadian","sequence":"first","affiliation":[]},{"given":"Hamideh","family":"Hosseinzadeh","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O( $$\\sqrt{ \\log n}$$ ) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of STOC 2005, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"issue":"9","key":"14_CR2","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. U.S.A. 43(9), 842\u2013844 (1957)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-34611-8_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Bomhoff, M., Golovach, P.A., Kern, W., Paulusma, D.: Solutions for the stable roommates problem with payments. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 69\u201380. Springer, Heidelberg (2012)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-319-07557-0_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Bock","year":"2014","unstructured":"Bock, A., Chandrasekaran, K., K\u00f6nemann, J., Peis, B., Sanit\u00e0, L.: Finding small stabilizers for unstable graphs. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 150\u2013161. Springer, Heidelberg (2014)"},{"key":"14_CR5","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","volume-title":"Computational aspects of cooperative game theory","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synthesis Lectures on Artificial Intelligence and Machine Learning, 1st edn. Morgan & Claypool, San Rafael (2011)","edition":"1"},{"key":"14_CR6","volume-title":"Combinatorial Optimization","author":"W Cook","year":"1998","unstructured":"Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"14_CR8","first-page":"698","volume":"25","author":"N Garg","year":"1993","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 698\u2013707 (1993)","journal-title":"SIAM J. Comput."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Efficient stabilization of cooperative matching games. In: Proceedings of AAMAS (2016, to appear)","DOI":"10.1016\/j.tcs.2017.03.020"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, \u00c9.: Balanced outcomes in social exchange networks: In: Proceedings of STOC 2008, pp. 295\u2013304 (2008)","DOI":"10.1145\/1374376.1376994"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Larson, K., Steiner, D.: Network bargaining: using approximate blocking sets to stabilize unstable instances. In: Theory of Computing Systems, pp. 655\u2013672 (2015)","DOI":"10.1007\/s00224-015-9650-4"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Korach, E., Nguyen, T., Peis, B.: Subgraph characterization of Red\/Blue-Split graph and k\u00f6nig egerv\u00e1ry graphs. In: Proceedings of SODA 2006, pp. 842\u2013850 (2006)","DOI":"10.1145\/1109557.1109650"},{"issue":"4","key":"14_CR13","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s00453-010-9412-2","volume":"61","author":"S Mishra","year":"2011","unstructured":"Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.: The complexity of K\u00f6nig subgraph problems and above-guarantee vertex cover. Algorithmica 61(4), 857\u2013881 (2011)","journal-title":"Algorithmica"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J.: The bargaining problem. Econometrica 18, 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"14_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"14_CR16","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, New York (2003)"},{"issue":"1","key":"14_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S., Shubik, M.: The assignment game: the core. Int. J. Game Theory 1(1), 111\u2013130 (1971)","journal-title":"Int. J. Game Theory"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","volume":"27","author":"F Sterboul","year":"1979","unstructured":"Sterboul, F.: A characterization of the graphs in which the transversal number equals the matching number. J. Comb. Theory Ser. B 27, 228\u2013229 (1979)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:46:36Z","timestamp":1567971996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}