{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:43Z","timestamp":1740122443239,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","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":["61433014","61502449"],"award-info":[{"award-number":["61433014","61502449"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602440","11271341"],"award-info":[{"award-number":["61602440","11271341"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"973 Program of China","award":["2016YFB1000201"],"award-info":[{"award-number":["2016YFB1000201"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-018-0296-4","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T08:08:08Z","timestamp":1525334888000},"page":"211-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Path cooperative games"],"prefix":"10.1007","volume":"36","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5538-5572","authenticated-orcid":false,"given":"Xiaohan","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"296_CR1","unstructured":"Aziz H, Brandt F, Harrenstein P (2010) Monotone cooperative games and their threshold versions. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems, vol\u00a01, pp 1107\u20131114"},{"key":"296_CR2","unstructured":"Aziz H, S\u00f8rensen TB (2011) Path coalitional games. arXiv preprint \n                    arXiv:1103.3310"},{"key":"296_CR3","doi-asserted-by":"crossref","unstructured":"Bachrach Y (2011) The least-core of threshold network flow games. In: Mathematical foundations of computer science. Springer, pp 36\u201347","DOI":"10.1007\/978-3-642-22993-0_7"},{"key":"296_CR4","doi-asserted-by":"crossref","unstructured":"Ba\u00efou M, Barahona F (2017) On the nucleolus of shortest path games. In: International symposium on algorithmic game theory. Springer, pp 55\u201366","DOI":"10.1007\/978-3-319-66700-3_5"},{"issue":"2","key":"296_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng X, Papadimitriou CH (1994) On the complexity of cooperative solution concepts. Math Oper Res 19(2):257\u2013266","journal-title":"Math Oper Res"},{"issue":"1","key":"296_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s10878-008-9138-0","volume":"18","author":"X Deng","year":"2009","unstructured":"Deng X, Fang Q, Sun X (2009) Finding nucleolus of flow game. J Comb Optim 18(1):64\u201386","journal-title":"J Comb Optim"},{"key":"296_CR7","first-page":"393","volume":"8","author":"E Elkind","year":"2008","unstructured":"Elkind E, Chalkiadakis G, Jennings NR (2008) Coalition structures in weighted voting games. ECAI 8:393\u2013397","journal-title":"ECAI"},{"key":"296_CR8","unstructured":"Elkind E, Goldberg LA, Goldberg PW, Wooldridge M (2007) Computational complexity of weighted threshold games. In: Proceedings of the national conference on artificial intelligence, vol\u00a022, p 718"},{"key":"296_CR9","doi-asserted-by":"crossref","unstructured":"Elkind E, Pasechnik D (2009) Computing the nucleolus of weighted voting games. In: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, pp 327\u2013335","DOI":"10.1137\/1.9781611973068.37"},{"issue":"3","key":"296_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01263277","volume":"26","author":"U Faigle","year":"1997","unstructured":"Faigle U, Kern W, Fekete SP, Hochst\u00e4ttler W (1997) On the complexity of testing membership in the core of min-cost spanning tree games. Int J Game Theory 26(3):361\u2013366","journal-title":"Int J Game Theory"},{"issue":"3","key":"296_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s001820050083","volume":"27","author":"U Faigle","year":"1998","unstructured":"Faigle U, Kern W, Kuipers J (1998) Note computing the nucleolus of min-cost spanning tree games is np-hard. Int J Game Theory 27(3):443\u2013450","journal-title":"Int J Game Theory"},{"issue":"1","key":"296_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s001820200106","volume":"31","author":"Q Fang","year":"2002","unstructured":"Fang Q, Zhu S, Cai M, Deng X (2002) On computational complexity of membership test in flow games and linear production games. Int J Game Theory 31(1):39\u201345","journal-title":"Int J Game Theory"},{"key":"296_CR13","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.tcs.2015.11.015","volume":"609","author":"Q Fang","year":"2016","unstructured":"Fang Q, Li B, Sun X, Zhang J, Zhang J (2016) Computing the least-core and nucleolus for threshold cardinality matching games. Theor Comput Sci 609:500\u2013510","journal-title":"Theor Comput Sci"},{"key":"296_CR14","doi-asserted-by":"crossref","unstructured":"Fang Q, Li, B, Shan X, Sun X (2015) Computing the nucleolus of weighted voting games. In: Proceedings of 21st the international computing and combinatorics conference, pp 70\u201382","DOI":"10.1007\/978-3-319-21398-9_6"},{"key":"296_CR15","first-page":"216","volume":"11","author":"G Greco","year":"2011","unstructured":"Greco G, Malizia E, Palopoli L, Scarcello F (2011) On the complexity of the core over coalition structures. IJCAI Citeseer 11:216\u2013221","journal-title":"IJCAI Citeseer"},{"issue":"5","key":"296_CR16","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E Kalai","year":"1982","unstructured":"Kalai E, Zemel E (1982) Generalized network problems yielding totally balanced games. Oper Res 30(5):998\u20131008","journal-title":"Oper Res"},{"issue":"2","key":"296_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W Kern","year":"2003","unstructured":"Kern W, Paulusma D (2003) Matching games: the least-core and the nucleolus. Math Oper Res 28(2):294\u2013308","journal-title":"Math Oper Res"},{"key":"296_CR18","unstructured":"Kopelowitz A (1967) Computation of the kernels of simple games and the nucleolus of n-person games. Technical report, DTIC Document"},{"issue":"4","key":"296_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/moor.4.4.303","volume":"4","author":"M Maschler","year":"1979","unstructured":"Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus, and related solution concepts. Math Oper Res 4(4):303\u2013338","journal-title":"Math Oper Res"},{"key":"296_CR20","unstructured":"Osborne MJ, Rubinstein A (1994) A course in game theory, pp 26\u201327. MIT Press, Massachusetts, Cambridge"},{"issue":"1","key":"296_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.geb.2004.08.008","volume":"54","author":"J Potters","year":"2006","unstructured":"Potters J, Reijnierse H, Biswas A (2006) The nucleolus of balanced simple flow networks. Games Econ Behav 54(1):205\u2013225","journal-title":"Games Econ Behav"},{"issue":"2","key":"296_CR22","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/game.1996.0085","volume":"16","author":"H Reijnierse","year":"1996","unstructured":"Reijnierse H, Maschler M, Potters J, Tijs S (1996) Simple flow games. Games Econ Behav 16(2):238\u2013260","journal-title":"Games Econ Behav"},{"issue":"6","key":"296_CR23","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17(6):1163\u20131170","journal-title":"SIAM J Appl Math"},{"key":"296_CR24","doi-asserted-by":"crossref","unstructured":"Shapley LS, Shubik M (1966) Quasi-cores in a monetary economy with nonconvex preferences. Econometrica 34:805\u2013827","DOI":"10.2307\/1910101"},{"issue":"2","key":"296_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi T, Raghavan TE (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23(2):119\u2013143","journal-title":"Int J Game Theory"},{"issue":"2","key":"296_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A Washburn","year":"1995","unstructured":"Washburn A, Wood K (1995) Two-person zero-sum games for network interdiction. Oper Res 43(2):243\u2013251","journal-title":"Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0296-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0296-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0296-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T19:18:30Z","timestamp":1556824710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0296-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["296"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0296-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"3 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}