{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:13:11Z","timestamp":1759666391627,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_6","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"70-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Least-Core and Nucleolus of Path Cooperative Games"],"prefix":"10.1007","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohan","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"6_CR1","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Monotone cooperative games and their threshold versions. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 1107\u20131114 (2010)"},{"key":"6_CR2","unstructured":"Aziz, H., S\u00f8rensen, T.B.: Path coalitional games (2011). arXiv preprint arXiv:1103.3310"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-22993-0_7","volume-title":"Mathematical Foundations of Computer Science 2011","author":"Y Bachrach","year":"2011","unstructured":"Bachrach, Y.: The least-core of threshold network flow games. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 36\u201347. Springer, Heidelberg (2011)"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00355ED1V01Y201107AIM016","volume":"5","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 5(6), 1\u2013168 (2011)","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"issue":"1","key":"6_CR5","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.: Finding nucleolus of flow game. Journal of combinatorial optimization 18(1), 64\u201386 (2009)","journal-title":"Journal of combinatorial optimization"},{"issue":"2","key":"6_CR6","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, C.H.: On the complexity of cooperative solution concepts. Mathematics of Operations Research 19(2), 257\u2013266 (1994)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR7","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: Computational complexity of weighted threshold games. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, p. 718 (2007)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Elkind, E., Pasechnik, D.: Computing the nucleolus of weighted voting games. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 327\u2013335 (2009)","DOI":"10.1137\/1.9781611973068.37"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01263277","volume":"26","author":"U Faigle","year":"1997","unstructured":"Faigle, U., Kern, W., Fekete, S.P., Hochst\u00e4ttler, W.: On the complexity of testing membership in the core of min-cost spanning tree games. International Journal of Game Theory 26(3), 361\u2013366 (1997)","journal-title":"International Journal of Game Theory"},{"issue":"3","key":"6_CR10","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.: Note computing the nucleolus of min-cost spanning tree games is np-hard. International Journal of Game Theory 27(3), 443\u2013450 (1998)","journal-title":"International Journal of Game Theory"},{"issue":"1","key":"6_CR11","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.: On computational complexity of membership test in flow games and linear production games. International Journal of Game Theory 31(1), 39\u201345 (2002)","journal-title":"International Journal of Game Theory"},{"key":"6_CR12","unstructured":"Greco, G., Malizia, E., Palopoli, L., Scarcello, F.: On the complexity of the core over coalition structures. In: IJCAI, vol. 11, pp. 216\u2013221. Citeseer (2011)"},{"issue":"5","key":"6_CR13","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.: Generalized network problems yielding totally balanced games. Operations Research 30(5), 998\u20131008 (1982)","journal-title":"Operations Research"},{"issue":"2","key":"6_CR14","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.: Matching games: the least-core and the nucleolus. Mathematics of Operations Research 28(2), 294\u2013308 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR15","unstructured":"Kopelowitz, A.: Computation of the kernels of simple games and the nucleolus of n-person games. Technical report, DTIC Document (1967)"},{"key":"6_CR16","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. Cambridge, Massachusetts (1994)"},{"issue":"1","key":"6_CR17","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.: The nucleolus of balanced simple flow networks. Games and Economic Behavior 54(1), 205\u2013225 (2006)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"6_CR18","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.: Simple flow games. Games and Economic Behavior 16(2), 238\u2013260 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM Journal on applied mathematics 17(6), 1163\u20131170 (1969)","journal-title":"SIAM Journal on applied mathematics"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.E.S.: An algorithm for finding the nucleolus of assignment games. International Journal of Game Theory 23(2), 119\u2013143 (1994)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"6_CR21","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.: Two-person zero-sum games for network interdiction. Operations Research 43(2), 243\u2013251 (1995)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:32:12Z","timestamp":1674228732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}