{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:07Z","timestamp":1740122467361,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671400"],"award-info":[{"award-number":["11671400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10878-019-00431-z","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T13:03:09Z","timestamp":1561035789000},"page":"987-1004","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum cost stability in exchange networks"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8540-4586","authenticated-orcid":false,"given":"Yuqing","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruidong","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"key":"431_CR1","series-title":"Lecture notes in computer scienc","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-15775-2_14","volume-title":"Algorithms C ESA 2010e","author":"E Anshelevich","year":"2010","unstructured":"Anshelevich E, Hoefer M (2010) Contribution games in social networks. In: de Berg M, Meyer U (eds) Algorithms C ESA 2010e, vol 6346. Lecture notes in computer scienc. Springer, Berlin, pp 158\u2013169"},{"issue":"1\u20132","key":"431_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-011-9520-7","volume":"63","author":"E Anshelevich","year":"2012","unstructured":"Anshelevich E, Hoefer M (2012) Contribution games in networks. Algorithmica 63(1\u20132):51\u201390","journal-title":"Algorithmica"},{"key":"431_CR3","first-page":"49","volume-title":"Lecture Notes in Computer Science","author":"Elliot Anshelevich","year":"2013","unstructured":"Anshelevich E, Bhardwaj O, Hoefer M, (2013) Friendship and stable matching. In: Bodlaender HL, Italiano GF (eds) Algorithms-ESA 2013. Lecture notes in computer science, vol 8125. Springer, Berlin, Heidelberg, pp 49\u201360"},{"issue":"4","key":"431_CR4","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/0209063","volume":"9","author":"B Aspvall","year":"1980","unstructured":"Aspvall B, Shiloach Y (1980) A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM J Comput 9(4):827\u2013845","journal-title":"SIAM J Comput"},{"key":"431_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jet.2014.02.007","volume":"156","author":"M Bayati","year":"2015","unstructured":"Bayati M, Borgs C, Chayes J, Kanoria Y, Montanari A (2015) Bargaining dynamics in exchange networks. J Econ Theory 156:417\u2013454","journal-title":"J Econ Theory"},{"issue":"6","key":"431_CR6","doi-asserted-by":"publisher","first-page":"3493","DOI":"10.1109\/TNET.2016.2530308","volume":"24","author":"G Blocq","year":"2016","unstructured":"Blocq G, Orda A (2016) How good is bargained routing? IEEE\/ACM Trans Netw 24(6):3493\u20133507","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"431_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 (2015) Finding small stabilizers for unstable graphs. Math Program 154(1):173\u2013196","journal-title":"Math Program"},{"key":"431_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-17572-5_11","volume-title":"Internet and network economics","author":"L Celis","year":"2010","unstructured":"Celis L, Devanur N, Peres Y (2010) Local dynamics in bargaining networks via random-turn games. In: Saberi A (ed) Internet and network economics, vol 6484. Lecture notes in computer science. Springer, Berlin, pp 133\u2013144"},{"key":"431_CR9","doi-asserted-by":"crossref","unstructured":"Coviello L, Franceschetti M (2012) Distributed team formation in multi-agent systems: stability and approximation. In: 2012 IEEE 51st annual conference on decision and control (CDC), pp 2755\u20132760","DOI":"10.1109\/CDC.2012.6426198"},{"key":"431_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449\u2013467","journal-title":"Can J Math"},{"issue":"1","key":"431_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil Z (1986) Efficient algorithms for finding maximum matching in graphs. ACM Comput Surv 18(1):23\u201338. \n                    https:\/\/doi.org\/10.1145\/6462.6502","journal-title":"ACM Comput Surv"},{"key":"431_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.tcs.2013.11.033","volume":"554","author":"K Georgioua","year":"2014","unstructured":"Georgioua K, Karakostasb G, Konemanna J, Stamirowskac Z (2014) Social exchange networks with distant bargaining. Theor Comput Sci 554:263\u2013274","journal-title":"Theor Comput Sci"},{"key":"431_CR13","unstructured":"Ghosh A, Kale S, Lang K, Moseley B (2013) Bargaining for revenue shares on tree trading networks. In: Proceedings of the twenty-third international joint conference on artificial intelligence. IJCAI \u201913, AAAI Press, pp 129\u2013135"},{"key":"431_CR14","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 (2017) Efficient stabilization of cooperative matching games. Theor Comput Sci 677:69\u201382","journal-title":"Theor Comput Sci"},{"key":"431_CR15","unstructured":"Kanoria Y, Bayati M, Borgs C, Chayes JT, Montanari A (2009) A natural dynamics for bargaining on exchange networks. \n                    arXiV:abs\/0911.1767"},{"key":"431_CR16","doi-asserted-by":"crossref","unstructured":"Kanoria Y, Bayati M, Borgs C, Chayes J, Montanari A (2011) Fast convergence of natural bargaining dynamics in exchange networks. In: Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms. SODA \u201911, SIAM, pp 1518\u20131537","DOI":"10.1137\/1.9781611973082.118"},{"key":"431_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg J, Tardos E (2008) Balanced outcomes in social exchange networks. In: The 40th ACM symposium on theory of computing (STOC 2008). ACM","DOI":"10.1145\/1374376.1376994"},{"issue":"1","key":"431_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data: ACM TKDD 1(1):2","journal-title":"ACM Trans Knowl Discov Data: ACM TKDD"},{"key":"431_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World Wide Web. WWW \u201910, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"431_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.08.006","volume":"556","author":"H Ma","year":"2014","unstructured":"Ma H, Lu Z, Li D, Zhu Y, Fan L, Wu W (2014) Mining hidden links in social networks to achieve equilibrium. Theor Comput Sci 556:13\u201324","journal-title":"Theor Comput Sci"},{"key":"431_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.4135\/9781848608351.n20","volume-title":"Handbook of social theory","author":"LD Molm","year":"2001","unstructured":"Molm LD (2001) Theories of social exchange and exchange networks. In: Ritzer G, Smart B (eds) Handbook of social theory. SAGE Publications Ltd., New York, pp 260\u2013272"},{"key":"431_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash J (1950) The bargaining problem. Econometrica 18:155\u2013162","journal-title":"Econometrica"},{"key":"431_CR23","volume-title":"An introduction to game theory","author":"MJ Osborne","year":"2003","unstructured":"Osborne MJ (2003) An introduction to game theory. Oxford University Press, Oxford"},{"key":"431_CR24","volume-title":"Combinatorial optimization polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization polyhedra and efficiency. Springer, Berlin"},{"key":"431_CR25","volume-title":"Network exchange theory","author":"D Willer","year":"1999","unstructured":"Willer D (1999) Network exchange theory. Praeger, Santa Barbara"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00431-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00431-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00431-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T23:14:46Z","timestamp":1592522086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00431-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,20]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["431"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00431-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,6,20]]},"assertion":[{"value":"20 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}