{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:47:13Z","timestamp":1773092833557,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10479-005-2248-5","type":"journal-article","created":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T08:14:49Z","timestamp":1124093689000},"page":"101-115","source":"Crossref","is-referenced-by-count":15,"title":["Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems"],"prefix":"10.1007","volume":"137","author":[{"given":"Gustavo","family":"Berganti\u00f1os","sequence":"first","affiliation":[]},{"given":"Leticia","family":"Lorenzo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2248_CR1","unstructured":"Berganti\u00f1os, G. and L. Lorenzo. (2003). \u201cNon-CooperativeCost Spanning Tree Games with Budget Restrictions.\u201d Mimeo,University of Vigo."},{"key":"2248_CR2","first-page":"393","volume":"59","author":"G. Berganti\u00f1os","year":"2004","unstructured":"Berganti\u00f1os, G. and L. Lorenzo. (2004). \u201cA Non-Cooperative Approach to the Cost Spanning TreeProblem.\u201d Mathematical Methods of OperationsResearch 59, 393\u2013403.","journal-title":"Mathematical Methods of OperationsResearch"},{"key":"2248_CR3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/S0167-6377(02)00107-4","volume":"30","author":"G. Berganti\u00f1os","year":"2002","unstructured":"Berganti\u00f1os, G. and E. Sanchez. (2002). \u201cNTU PERT Games.\u201d Operations Research Letters 30, 130\u2013140.","journal-title":"Operations Research Letters"},{"key":"2248_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C.G. Bird","year":"1976","unstructured":"Bird, C.G. (1976). \u201cOn Cost Allocation for a Spanning Tree: A Game TheoreticApproach.\u201d Networks 6, 335\u2013350.","journal-title":"Networks"},{"issue":"2","key":"2248_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P. Borm","year":"2001","unstructured":"Borm, P., H. Hamers, and R. Hendrickx. (2001). \u201cOperations Research Games: ASurvey.\u201d Top 9(2), 139\u2013216.","journal-title":"Top"},{"key":"2248_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.3230030402","volume":"3","author":"A. Claus","year":"1973","unstructured":"Claus, A. and D.J. Kleitman. (1973). \u201cCost Allocations for a Spanning Tree.\u201d Networks 3, 289\u2013304.","journal-title":"Networks"},{"key":"2248_CR7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0377-2217(89)90427-X","volume":"40","author":"I. Curiel","year":"1989","unstructured":"Curiel, I., G. Pederzoli, and S. Tijs. (1989). \u201cSequencing Games.\u201d European Journal of Operational Research 40, 344\u2013351.","journal-title":"European Journal of Operational Research"},{"key":"2248_CR8","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1080\/00029890.1983.11971234","volume":"90","author":"P. Fishburn","year":"1983","unstructured":"Fishburn, P. and H. Pollack. (1983). \u201cFixed Route Cost Allocation.\u201d American Mathematical Monthly 90, 366\u2013378.","journal-title":"American Mathematical Monthly"},{"key":"2248_CR9","volume-title":"Game Practice: Contributions from Applied Game Theory","author":"V. Feltkamp","year":"2000","unstructured":"Feltkamp, V., S. Tijs, and S. Muto. (2000). \u201cBird's Tree AllocationRevisited.\u201d In F. Patrone, I. Garc\u00eda-Jurado and S. Tijs (eds.), Game Practice: Contributions from Applied Game Theory. Dordrecht, The Netherlands: Kluwer Academic Publishers."},{"key":"2248_CR10","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/s001860000061","volume":"52","author":"V. Fragnelli","year":"2000","unstructured":"Fragnelli, V., I. Garcia-Jurado, and L. Mendez-Naya. (2000). \u201cOn ShortestPath Games.\u201d Mathematical Methods of Operations Research 52,252\u2013264.","journal-title":"Mathematical Methods of Operations Research"},{"key":"2248_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"Granot, D. and G. Huberman. (1981). \u201cOn minimum Cost Spanning Tree Games.\u201d Mathematical Programming 21, 1\u201318.","journal-title":"Mathematical Programming"},{"key":"2248_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02592000","volume":"29","author":"D. Granot","year":"1984","unstructured":"Granot, D. and G. Huberman. (1984). \u201cOn the Core and Nucleolus of the MinimumCost Spanning Tree Games.\u201d Mathematical Programming 29, 323\u2013347.","journal-title":"Mathematical Programming"},{"key":"2248_CR13","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E. Kalai","year":"1982","unstructured":"Kalai, E. and E. Zemel. (1982). \u201cTotally Balanced Games and Games of Flow.\u201d Mathematics of Operations Research 7, 476\u2013478.","journal-title":"Mathematics of Operations Research"},{"key":"2248_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/game.2001.0883","volume":"38","author":"A. Kar","year":"2002","unstructured":"Kar, A. (2002). \u201cAxiomatization of the Shapley Value on Minimum CostSpanning Tree Games.\u201d Games and Economic Behavior 38, 265\u2013277.","journal-title":"Games and Economic Behavior"},{"key":"2248_CR15","first-page":"48","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B. (1956). \u201cOn the Shortest Spanning Subtree of a Graph and theTraveling Salesman Problem.\u201d Procceedings of the AmericanMathematical Society 7, 48\u201350.","journal-title":"Procceedings of the AmericanMathematical Society"},{"key":"2248_CR16","unstructured":"Meca, A., J. Timmer, I. Garcia-Jurado, and P. Borm. (1999). \u201cInventoryGames.\u201d CentER Discussion Paper 9953, Tilburg University, Tilburg, TheNetherlands."},{"key":"2248_CR17","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G. Owen","year":"1975","unstructured":"Owen, G. (1975). \u201cOn the Core of Linear Production Games.\u201d Mathematical programming 9, 358\u2013370.","journal-title":"Mathematical programming"},{"key":"2248_CR18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"Prim, R. (1957). \u201cShortest Connection Networks and Some Genralizations.\u201d Bell Systems Technical Journal 36, 1389\u20131401.","journal-title":"Bell Systems Technical Journal"},{"key":"2248_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L. Shapley","year":"1971","unstructured":"Shapley, L. and M. Shubik. (1971). \u201cThe Assignment Game I: The Core.\u201d International Journal of Game Theory 1, 111\u2013130.","journal-title":"International Journal of Game Theory"},{"key":"2248_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58242-4","volume-title":"Stability and Perfection of Nash Equilibria","author":"E. Damme Van","year":"1991","unstructured":"Van Damme, E. (1991). Stability and Perfection of Nash Equilibria. Berlin: Springer Verlag."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2248-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2248-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2248-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:33Z","timestamp":1559138373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2248-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["2248"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2248-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}