{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:57Z","timestamp":1725561357680},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_70","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"686-695","source":"Crossref","is-referenced-by-count":4,"title":["Fair Cost Allocations under Conflicts \u2014 A Game-Theoretic Point of View \u2014"],"prefix":"10.1007","author":[{"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"70_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4871-0","volume-title":"Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems","author":"I.J. Curiel","year":"1997","unstructured":"Curiel, I.J.: Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"70_CR2","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X. Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res.\u00a024, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"70_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X. Deng","year":"2000","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H., Zang, W.: Totally balanced combinatorial optimization games. Math. Program\u00a087, 441\u2013452 (2000)","journal-title":"Math. Program"},{"key":"70_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7787-8","volume-title":"Cooperative Games, Solutions and Applications","author":"T. Driessen","year":"1988","unstructured":"Driessen, T.: Cooperative Games, Solutions and Applications. Kluwer Academic Publishers, Dordrecht (1988)"},{"key":"70_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01258278","volume":"21","author":"U. Faigle","year":"1992","unstructured":"Faigle, U., Kern, W.: The Shapley value for cooperative games under precedence constraints. Internat. J. Game Theory\u00a021, 249\u2013266 (1992)","journal-title":"Internat. J. Game Theory"},{"key":"70_CR6","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.: Computing the nucleolus of min-cost spanning tree games is NP-hard. Internat. J. Game Theory\u00a027, 443\u2013450 (1998)","journal-title":"Internat. J. Game Theory"},{"key":"70_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s001820100065","volume":"30","author":"U. Faigle","year":"2001","unstructured":"Faigle, U., Kern, W., Kuipers, J.: On the computation of the nucleolus of a cooperative game. Internat. J. Game Theory\u00a030, 79\u201398 (2001)","journal-title":"Internat. J. Game Theory"},{"key":"70_CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"70_CR9","unstructured":"Gillies, D.B.: Some theorems on n-person games. Ph.D. Thesis, Princeton University (1953)"},{"key":"70_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"70_CR11","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.: Geometric algorithms and combinatorial optimization, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"key":"70_CR12","unstructured":"Kopelowitz, A.: Computation of the kernels of simple games and the nucleolus of n-person games. RM 31, Research Program in Game Theory and Mathematical Economics, The Hebrew University of Jerusalem (1967)"},{"key":"70_CR13","unstructured":"Kuipers, J.: A polynomial time algorithm for computing the nucleolus of convex games. Report M 96-12, Maastricht University (1996)"},{"key":"70_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math.\u00a02, 253\u2013267 (1972)","journal-title":"Discrete Math."},{"key":"70_CR15","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, L.S.: Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res.\u00a04, 303\u2013338 (1979)","journal-title":"Math. Oper. Res."},{"key":"70_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0453-4514(00)88752-9","volume":"43","author":"T. Matsui","year":"2000","unstructured":"Matsui, T., Matsui, Y.: A survey of algorithms for calculating power indices of weighted majority games. J. Oper. Res. Soc. Japan\u00a043, 71\u201386 (2000)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"70_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res.\u00a03, 189\u2013196 (1978)","journal-title":"Math. Oper. Res."},{"key":"70_CR18","first-page":"114","volume":"48","author":"H. Mohri","year":"2003","unstructured":"Mohri, H., Okamoto, Y.: Discrete optimization and cooperative games (2). Comm. Oper. Res. Soc. Japan\u00a048, 114\u2013120 (2003) (in Japanese)","journal-title":"Comm. Oper. Res. Soc. Japan"},{"key":"70_CR19","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput.\u00a012, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"70_CR20","doi-asserted-by":"crossref","unstructured":"Okamoto, Y.: Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res.\u00a058 (2003) (to appear)","DOI":"10.1007\/s001860300284"},{"key":"70_CR21","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 J. Appl. Math.\u00a017, 1163\u20131170 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"70_CR22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"Shapley, L.S.: Cores of convex games. Internat. J. Game Theory 1, 11\u201326 (1971); Errata is in the same volume, 1972, pp. 199","journal-title":"Internat. J. Game Theory"},{"key":"70_CR23","first-page":"307","volume-title":"Contributions to the Theory of Games II","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: A value for n-person games. In: Kuhn, H., Tucker, A.W. (eds.) Contributions to the Theory of Games II, pp. 307\u2013317. Princeton University Press, Princeton (1953)"},{"key":"70_CR24","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. Internat. J. Game Theory\u00a023, 119\u2013143 (1994)","journal-title":"Internat. J. Game Theory"},{"key":"70_CR25","first-page":"123","volume-title":"Game Theory and Mathematical Economics","author":"S.H. Tijs","year":"1981","unstructured":"Tijs, S.H.: Bounds for the core and the \u03c4 -value. In: Moeshlin, O., Pallaschke, P. (eds.) Game Theory and Mathematical Economics, pp. 123\u2013132. North Holland, Amsterdam (1981)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:14:38Z","timestamp":1552821278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}