{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:37Z","timestamp":1725544897186},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_27","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"247-256","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Membership for Core of LP Games and Other Games"],"prefix":"10.1007","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanfeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maocheng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"27_CR1","unstructured":"I.J. Curiel (1988), Cooperative Game Theory and Applications. Ph.D. dissertation, University of Nijmegen, the Netherlands."},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X. Deng","year":"1999","unstructured":"X. Deng, T. Ibaraki and H. Nagamochi (1999), Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research 24, pp. 751\u2013766.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X. Deng","year":"2000","unstructured":"X. Deng, T. Ibaraki, H. Nagamochi and W. Zang (2000),Totally balanced combinatorial optimization games, Mathematical Programming 87, pp.441\u2013452.","journal-title":"Mathematical Programming"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X. Deng","year":"1994","unstructured":"X. Deng and C.H. Papadimitriou (1994), On the complexity of cooperative solution concepts. Mathematics of Operations Research 19, pp. 257\u2013266.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263277","volume":"26","author":"U. Faigle","year":"1997","unstructured":"U. Faigle, W. Kern, S.P. Fekete and W. Hochst\u00e4ttler (1997), On the complexity of testing membership in the core of min-cost spanning tree games. International Journal of Game Theory 26, pp. 361\u2013366.","journal-title":"International Journal of Game Theory"},{"key":"27_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco."},{"key":"27_CR7","unstructured":"M.X. Goemans and M. Skutella (2000), Cooperative facility location games. SODA."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"D. Granot and G. Huberman (1981), Minimum cost spanning tree games. Mathematical Programming 21, pp. 1\u201318.","journal-title":"Mathematical Programming"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E. Kalai","year":"1982","unstructured":"E. Kalai and E. Zemel (1982), Totally balanced games and games of flow. Mathematics of Operations Research 7, pp. 476\u2013478.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E. Kalai","year":"1982","unstructured":"E. Kalai and E. Zemel (1982), Generalized network problems yielding totally balanced games. Operations Research 30, pp. 498\u20131008.","journal-title":"Operations Research"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"N. Megiddo (1978), Computational complexity and the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3, pp. 189\u2013196.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G. Owen","year":"1975","unstructured":"G. Owen (1975), On the core of linear production games. Mathematical Programming 9, pp. 358\u2013370.","journal-title":"Mathematical Programming"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1002\/nav.3800140404","volume":"14","author":"L.S. Shapley","year":"1967","unstructured":"L.S. Shapley (1967), On balanced sets and cores. Naval Research Logistics Quarterly 14, pp. 453\u2013460.","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:04:17Z","timestamp":1558263857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}