{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:41Z","timestamp":1725512141349},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540706656"},{"type":"electronic","value":"9783540706663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70666-3_20","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:16:03Z","timestamp":1182816963000},"page":"189-199","source":"Crossref","is-referenced-by-count":5,"title":["Core Stability of Flow Games"],"prefix":"10.1007","author":[{"given":"Xiaoxun","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-30559-0_33","volume-title":"Proceedings of 30th International Workshop on Graph-Theoretic Concept in Computer Science","author":"T. Bietenhader","year":"2004","unstructured":"Bietenhader, T., Okamoto, Y.: Core Stability of Minimum Coloring Games. In: WG 2004. LNCS, vol.\u00a03353, pp. 389\u2013401. Springer, Berlin Heidelberg New York (2004)"},{"key":"20_CR2","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 Econom. Behav.\u00a028, 1\u201312 (1999)","journal-title":"Games Econom. Behav."},{"key":"20_CR3","first-page":"119","volume":"10","author":"O.N. Bondareva","year":"1963","unstructured":"Bondareva, O.N.: Some Applications of Linear Programming Methods to the Theory of Cooperative Games(in Russian). Problemy Kibernetiki\u00a010, 119\u2013139 (1963)","journal-title":"Problemy Kibernetiki"},{"key":"20_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.: Algorithmic Aspects of the Core of Combinatorial Optimization Games. Math. Oper. Res.\u00a024, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"20_CR5","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, C.H.: On the Complexity of Cooperative Solution Concepts. Math. Oper. Res.\u00a019, 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"key":"20_CR6","first-page":"247","volume-title":"COCOON 2001","author":"Q. Fang","year":"2001","unstructured":"Fang, Q., Zhu, S., Cai, M., Deng, X.: Membership for Core of LP Games and Other Games. In: Wang, J. (ed.) COCOON 2001, vol.\u00a02108, pp. 247\u2013256. Springer, Berlin Heidelberg New York (2001)"},{"key":"20_CR7","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, New Jersey (1962)"},{"key":"20_CR8","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":"20_CR9","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E. Kalai","year":"1982","unstructured":"Kalai, E., Zemel, E.: Totally Balanced Games and Games of Flow. Math. Oper. Res.\u00a07, 476\u2013478 (1982)","journal-title":"Math. Oper. Res."},{"key":"20_CR10","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.: Generalized Network Problems Yielding Totally Balanced Games. Operations Research\u00a030, 498\u20131008 (1982)","journal-title":"Operations Research"},{"key":"20_CR11","unstructured":"Kikuta, K., Shapley, L.S.: Core Stability in n-Person Games. Manuscript (1986)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1090\/S0002-9904-1968-11901-9","volume":"74","author":"W.F. Lucas","year":"1968","unstructured":"Lucas, W.F.: A Game with no Solution. Bull. Amer. Math. Soc.\u00a074, 237\u2013239 (1968)","journal-title":"Bull. Amer. Math. Soc."},{"key":"20_CR13","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 Univeristy Press, Princeton (1944)"},{"key":"20_CR14","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin Heidelberg New York (2003)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1002\/nav.3800140404","volume":"14","author":"L.S. Shapley","year":"1967","unstructured":"Shapley, L.S.: On Balanced Sets and Cores. Naval Research Logistics Quarterly\u00a014, 453\u2013460 (1967)","journal-title":"Naval Research Logistics Quarterly"},{"key":"20_CR16","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":"20_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry, Combinatorics and Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70666-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:09:25Z","timestamp":1605762565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70666-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540706656","9783540706663"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70666-3_20","relation":{},"subject":[]}}