{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:06Z","timestamp":1725558966433},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_33","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"389-401","source":"Crossref","is-referenced-by-count":6,"title":["Core Stability of Minimum Coloring Games"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bietenhader","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/game.1998.0686","volume":"28","author":"A.K. Biswas","year":"1999","unstructured":"Biswas, A.K., Parthasarathy, T., Potters, J.A.M., Voorneveld, M.: Large cores and exactness. Games and Economic Behavior\u00a028, 1\u201312 (1999)","journal-title":"Games and Economic Behavior"},{"key":"33_CR2","unstructured":"Chudnovsky, M., Seymour, P.: Recognizing Berge graphs (Submitted)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D.G. Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Applied Mathematics\u00a09, 27\u201339 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"33_CR4","unstructured":"Cornu\u00e9jols, G., Liu, X., Vus\u0306kovi\u0107, K.: A polynomial algorithm for recognizing perfect graphs. In: Proc. 44th FOCS, pp. 20\u201327 (2003)"},{"key":"33_CR5","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":"33_CR6","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":"33_CR7","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":"33_CR8","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. Math. Oper. Res.\u00a019, 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M. Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett.\u00a01, 134\u2013138 (1982)","journal-title":"Oper. Res. Lett."},{"key":"33_CR10","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":"33_CR11","volume-title":"Some theorems on n-person games. Ph.D. Thesis","author":"D.B. Gillies","year":"1953","unstructured":"Gillies, D.B.: Some theorems on n-person games. Ph.D. Thesis. Princeton University, Princeton (1953)"},{"key":"33_CR12","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":"33_CR13","unstructured":"Kikuta, K., Shapley, L.S.: Core stability in n-person games. (1986) (Manuscript)"},{"key":"33_CR14","first-page":"191","volume-title":"Domination in Graphs (Advanced Topics)","author":"D. Kratsch","year":"1998","unstructured":"Kratsch, D.: Algorithms. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs (Advanced Topics), pp. 191\u2013231. Marcel Dekker Inc., New York (1998)"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM J. Discrete Math.\u00a06, 400\u2013417 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR16","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":"33_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s001860300284","volume":"58","author":"Y. Okamoto","year":"2003","unstructured":"Okamoto, Y.: Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res.\u00a058, 131\u2013139 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-24587-2_70","volume-title":"Algorithms and Computation","author":"Y. Okamoto","year":"2003","unstructured":"Okamoto, Y.: Fair cost allocations under conflicts \u2014 A game-theoretic point of view \u2014. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 686\u2013695. Springer, Heidelberg (2003)"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/0022-247X(72)90045-5","volume":"40","author":"D. Schmeidler","year":"1972","unstructured":"Schmeidler, D.: Cores of exact games I. J. Math. Anal. Appl.\u00a040, 214\u2013225 (1972)","journal-title":"J. Math. Anal. Appl."},{"key":"33_CR20","doi-asserted-by":"publisher","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\u00a01, 11\u201326 (1971); Errata is in the same volume, pp. 199 (1972)","journal-title":"Internat. J. Game Theory"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01755727","volume":"11","author":"W.W. Sharkey","year":"1982","unstructured":"Sharkey, W.W.: Cooperative games with large cores. Internat. J. Game Theory\u00a011, 175\u2013182 (1982)","journal-title":"Internat. J. Game Theory"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s001820100072","volume":"30","author":"T. Solymosi","year":"2001","unstructured":"Solymosi, T., Raghavan, T.E.S.: Assignment games with stable cores. Internat. J. Game Theory\u00a030, 177\u2013185 (2001)","journal-title":"Internat. J. Game Theory"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s001820050106","volume":"28","author":"J.R.G. Gellekom van","year":"1999","unstructured":"van Gellekom, J.R.G., Potters, J.A.M., Reijnierse, J.H.: Prosperity properties of TU-games. Internat. J. Game Theory\u00a028, 211\u2013227 (1999)","journal-title":"Internat. J. Game Theory"},{"key":"33_CR24","volume-title":"Theory of Games and Economic Behaviour","author":"J. Neumann von","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1944)"},{"key":"33_CR25","unstructured":"Zverovich, I.E.: Independent domination on 2P\n 3-free perfect graphs. DIMACS Technical Report 2003-22 (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:03Z","timestamp":1620012603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}