{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:21:32Z","timestamp":1778646092076,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T00:00:00Z","timestamp":1201219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10878-008-9138-0","type":"journal-article","created":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T20:18:21Z","timestamp":1201205901000},"page":"64-86","source":"Crossref","is-referenced-by-count":31,"title":["Finding nucleolus of flow game"],"prefix":"10.1007","volume":"18","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Xiaoxun","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,25]]},"reference":[{"key":"9138_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-0531(85)90102-4","volume":"36","author":"RJ Aumann","year":"1985","unstructured":"Aumann RJ, Maschler M (1985) Game theoretic analysis of a bankruptcy problem from the Talmud. J\u00a0Econ Theory 36:195\u2013396","journal-title":"J\u00a0Econ Theory"},{"key":"9138_CR2","unstructured":"Br\u00e2nzei R, Solymosi T, Tijs SH (2003) Strongly essential coalitions and the nucleolus of peer group games. CentER Discussion Paper 2003-19"},{"key":"9138_CR3","doi-asserted-by":"crossref","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:257\u2013266","journal-title":"Math Oper Res"},{"key":"9138_CR4","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24:751\u2013766","journal-title":"Math Oper Res"},{"key":"9138_CR5","doi-asserted-by":"crossref","unstructured":"Deng X, Fang Q, Sun X (2006) Finding nucleolus of flow game. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA 2006), pp 124\u2013131","DOI":"10.1145\/1109557.1109572"},{"key":"9138_CR6","doi-asserted-by":"crossref","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"},{"key":"9138_CR7","unstructured":"Faigle U, Kern W (1995) Partition games and the core of hierarchically convex cost games. Universiteit Twente, faculteit der toegepaste wiskunde, Memorandum, No. 1269"},{"key":"9138_CR8","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s001820050083","volume":"27","author":"U Faigle","year":"1998","unstructured":"Faigle U, Kern W, Kuipers J (1998) Computing the nucleolus of min-cost spanning tree games is $\\mathcal{NP}$ -hard. Int J Game Theory 27:443\u2013450","journal-title":"Int J Game Theory"},{"key":"9138_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s001820100065","volume":"30","author":"U Faigle","year":"2001","unstructured":"Faigle U, Kern W, Kuipers J (2001) On the computation of the nucleolus of a cooperative game. Int J Game Theory 30:79\u201398","journal-title":"Int J Game Theory"},{"key":"9138_CR10","doi-asserted-by":"crossref","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:39\u201345","journal-title":"Int J Game Theory"},{"key":"9138_CR11","volume-title":"Computers and intractability: a guide to the theory of $\\mathcal{NP}$ -completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of $\\mathcal{NP}$ -completeness. Freeman, San Francisco"},{"key":"9138_CR12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"MX Goemans","year":"2004","unstructured":"Goemans MX, Skutella M (2004) Cooperative facility location games. J Algorithms 50:194\u2013214","journal-title":"J Algorithms"},{"key":"9138_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01247104","volume":"25","author":"D Granot","year":"1996","unstructured":"Granot D, Maschler M, Owen G, Zhu WR (1996) The kernel\/nucleolus of a standard tree game. Int J Game Theory 25:219\u2013244","journal-title":"Int J Game Theory"},{"key":"9138_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s001820050078","volume":"27","author":"D Granot","year":"1998","unstructured":"Granot D, Granot F, Zhu WR (1998) Characterization sets for the nucleolus. Int J Game Theory 27:359\u2013374","journal-title":"Int J Game Theory"},{"key":"9138_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1993) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"key":"9138_CR16","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/BFb0004057","volume-title":"Analysis and optimizations of systems","author":"G Huberman","year":"1980","unstructured":"Huberman G (1980) The nucleolus and the essential coalitions. In: Analysis and optimizations of systems. Springer, Berlin, pp 416\u2013422"},{"key":"9138_CR17","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E Kalai","year":"1982","unstructured":"Kalai E, Zemel E (1982a) Totally balanced games and games of flow. Math Oper Res 7:476\u2013478","journal-title":"Math Oper Res"},{"key":"9138_CR18","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E Kalai","year":"1982","unstructured":"Kalai E, Zemel E (1982b) Generalized network problems yielding totally balanced games. Oper Res 30:498\u20131008","journal-title":"Oper Res"},{"key":"9138_CR19","doi-asserted-by":"crossref","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:294\u2013308","journal-title":"Math Oper Res"},{"key":"9138_CR20","unstructured":"Kopelowitz A (1967) Computation of the kernels of simple games and the nucleolus of n-person games. RM-31, Math Dept, The Hebre University of Jerusalem"},{"key":"9138_CR21","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/PL00011385","volume":"88","author":"J Kuipers","year":"2000","unstructured":"Kuipers J, Solymosi T, Aarts H (2000) Computing the nucleolus of some combinatorially structured games. Math Program 88:541\u2013563","journal-title":"Math Program"},{"issue":"1","key":"9138_CR22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0515036100004815","volume":"14","author":"J Lemaire","year":"1984","unstructured":"Lemaire J (1984) An application of game theory: cost allocation. ASTIN Bull 14(1):61\u201381","journal-title":"ASTIN Bull"},{"key":"9138_CR23","unstructured":"Malkevitch J (2005) Resolving bankruptcy claims. Feature column, monthly essays on mathematical topics, AMS, March 2005. http:\/\/www.ams.org\/featurecolumn\/index.html"},{"key":"9138_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N Megiddo","year":"1978","unstructured":"Megiddo N (1978) Computational complexity and the game theory approach to cost allocation for ta tree. Math Oper Res 3:189\u2013196","journal-title":"Math Oper Res"},{"key":"9138_CR25","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G Owen","year":"1975","unstructured":"Owen G (1975) On the core of linear production games. Math Program 9:358\u2013370","journal-title":"Math Program"},{"key":"9138_CR26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.geb.2004.08.008","volume":"54","author":"J Potters","year":"2006","unstructured":"Potters J, Reijinierse H, Biswas A (2006) The nucleolus of balanced simple flow networks. Games Econ Behav 54:205\u2013225","journal-title":"Games Econ Behav"},{"key":"9138_CR27","unstructured":"Raghavan TES, Solymosi T (1998) An algorithm to locate the nucleolus prices for a real estate game. GPI\u00a0XII"},{"key":"9138_CR28","doi-asserted-by":"crossref","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:1163\u20131170","journal-title":"SIAM J Appl Math"},{"key":"9138_CR29","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"key":"9138_CR30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1972","unstructured":"Shapley LS, Shubik M (1972) The assignment game. Int J Game Theory 1:111\u2013130","journal-title":"Int J Game Theory"},{"key":"9138_CR31","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi T, Raghavan TES (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23:119\u2013143","journal-title":"Int J Game Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9138-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9138-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9138-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9138-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,25]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9138"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9138-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,25]]}}}