{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T05:39:49Z","timestamp":1772689189287,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01584227","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:29:50Z","timestamp":1114676990000},"page":"1-18","source":"Crossref","is-referenced-by-count":199,"title":["Minimum cost spanning tree games"],"prefix":"10.1007","volume":"21","author":[{"given":"Daniel","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gur","family":"Huberman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C.G. Bird","year":"1976","unstructured":"C.G. Bird, \u201cOn cost allocation for a spanning tree: A game theory approach\u201d,Networks 6 (1976) 335\u2013350.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.3230030402","volume":"3","author":"A. Claus","year":"1973","unstructured":"A. Claus and D.J. Kleitman, \u201cCost-allocation for a spanning tree\u201d,Networks 3 (1973) 289\u2013304.","journal-title":"Networks"},{"key":"CR3","unstructured":"A. Claus and D. Granot, \u201cGame theory application to cost allocation for a spanning tree\u201d, Working Paper No. 402, Faculty of Commerce and Business Administration, University of British Columbia (June 1976)."},{"key":"CR4","unstructured":"D. Granot and G. Huberman, \u201cMinimum cost spanning tree games\u201d, Working Paper No. 403, Faculty of Commerce, U.B.C. (June 1976; revised Sept. 1976\/August 1977)."},{"key":"CR5","unstructured":"D. Granot and G. Huberman, \u201cPermutationally convex games and minimum spanning tree games\u201d, Discussion Paper 77-10-3, Simon Fraser University (June 1977)."},{"key":"CR6","unstructured":"A. Kopelowitz, \u201cComputation of the kernels of simple games and the nucleolus ofn-person games\u201d, Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem (September 1967)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01766216","volume":"3","author":"S.C. Littlechild","year":"1974","unstructured":"S.C. Littlechild, \u201cA simple expression for the nucleolus in a special case\u201d,International Journal of Game Theory 3 (1974) 21\u201329.","journal-title":"International Journal of Game Theory"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"N. Megiddo, \u201cComputational complexity and the game theory approach to cost allocation for a tree\u201d,Mathematics of Operations Research 3 (1978) 189\u2013196.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230080104","volume":"8","author":"N. Megiddo","year":"1978","unstructured":"N. Megiddo, \u201cCost allocation for Steiner trees\u201d,Networks 8 (1978) 1\u20136.","journal-title":"Networks"},{"key":"CR10","first-page":"307","volume":"28","author":"L.S. Shapley","year":"1953","unstructured":"L.S. Shapley, \u201cA value forn-person games\u201d,Annals of Mathematics Study 28 (1953) 307\u2013317.","journal-title":"Annals of Mathematics Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584227.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584227\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:28Z","timestamp":1556897368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01584227"],"URL":"https:\/\/doi.org\/10.1007\/bf01584227","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}