{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T08:22:02Z","timestamp":1768810922688,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T00:00:00Z","timestamp":1471478400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok (HU)","doi-asserted-by":"publisher","award":["K101224"],"award-info":[{"award-number":["K101224"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok (HU)","doi-asserted-by":"publisher","award":["K108383"],"award-info":[{"award-number":["K108383"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia (HU)","doi-asserted-by":"publisher","award":["LD-004\/2010"],"award-info":[{"award-number":["LD-004\/2010"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Pallas Athene Domus Scientiae","award":["SZ\/0037\/2016"],"award-info":[{"award-number":["SZ\/0037\/2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10107-016-1062-y","type":"journal-article","created":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T11:21:08Z","timestamp":1471519268000},"page":"243-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the core and nucleolus of directed acyclic graph games"],"prefix":"10.1007","volume":"163","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0068-8920","authenticated-orcid":false,"given":"Bal\u00e1zs","family":"Sziklai","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[]},{"given":"Tam\u00e1s","family":"Solymosi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"key":"1062_CR1","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.jet.2006.11.001","volume":"137","author":"G Berganti\u00f1os","year":"2007","unstructured":"Berganti\u00f1os, G., Vidal-Puga, J.J.: A fair rule in minimum cost spanning tree problems. J. Econ. Theory 137, 326\u2013352 (2007)","journal-title":"J. Econ. Theory"},{"key":"1062_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C Bird","year":"1976","unstructured":"Bird, C.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335\u2013350 (1976)","journal-title":"Networks"},{"issue":"2","key":"1062_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s001860300324","volume":"59","author":"E Bj\u00f8rndal","year":"2004","unstructured":"Bj\u00f8rndal, E., Koster, M., Tijs, S.: Weighted allocation rules for standard fixed tree games. Math. Methods Oper. Res. 59(2), 249\u2013270 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"1062_CR4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.geb.2009.11.001","volume":"69","author":"A Bogomolnaia","year":"2010","unstructured":"Bogomolnaia, A., Moulin, H.: Sharing a minimal cost spanning tree: beyond the folk solution. Games Econ. Behav. 69, 238\u2013248 (2010)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"1062_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10878-008-9138-0","volume":"18","author":"X Deng","year":"2009","unstructured":"Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow game. J. Comb. Optim. 18(1), 64\u201386 (2009)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"1062_CR6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263277","volume":"26","author":"U Faigle","year":"1997","unstructured":"Faigle, U., Kern, W., Hochst\u00e4ttler, W., Fekete, S.: On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory 26(3), 361\u2013366 (1997)","journal-title":"Int. J. Game Theory"},{"key":"1062_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s001820050083","volume":"27","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Kuipers, J.: Computing the nucleolus of min-cost spanning tree games is np-hard. Int. J. Game Theory 27, 443\u2013450 (1998)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"1062_CR8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1287\/moor.17.4.765","volume":"17","author":"D Granot","year":"1992","unstructured":"Granot, D., Granot, F.: Computational complexity of a cost allocation approach to a fixed cost spanning forest problem. Math. Oper. Res. 17(4), 765\u2013780 (1992)","journal-title":"Math. Oper. Res."},{"key":"1062_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: Minimum cost spanning tree games. Math. Program. 21, 1\u201318 (1981)","journal-title":"Math. Program."},{"issue":"3","key":"1062_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02592000","volume":"29","author":"D Granot","year":"1984","unstructured":"Granot, D., Huberman, G.: On the core and nucleolus of minimum cost spanning tree games. Math. Program. 29(3), 323\u2013347 (1984)","journal-title":"Math. Program."},{"key":"1062_CR11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s001820050085","volume":"27","author":"D Granot","year":"1998","unstructured":"Granot, D., Maschler, M.: Spanning network games. Int. J. Game Theory 27, 467\u2013500 (1998)","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"1062_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s001820050078","volume":"27","author":"D Granot","year":"1998","unstructured":"Granot, D., Granot, F., Zhu, W.R.: Characterization sets for the nucleolus. Int. J. Game Theory 27(3), 359\u2013374 (1998)","journal-title":"Int. J. Game Theory"},{"key":"1062_CR13","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/BFb0004057","volume-title":"Analysis and Optimization of Systems, Lecture Notes in Control and Information Sciences","author":"G Huberman","year":"1980","unstructured":"Huberman, G.: The nucleolus and essential coalitions. In: Bensoussan, A., Lions, J.L. (eds.) Analysis and Optimization of Systems, Lecture Notes in Control and Information Sciences, vol. 28, pp. 416\u2013422. Elsevier B.V., Amsterdam (1980)"},{"key":"1062_CR14","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, Annals of Discrete Mathematics, vol.\u00a053. Elsevier, North-Holland (1992)"},{"key":"1062_CR15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01263278","volume":"26","author":"J Kuipers","year":"1997","unstructured":"Kuipers, J.: Minimum cost forest games. Int. J. Game Theory 26, 367\u2013377 (1997)","journal-title":"Int. J. Game Theory"},{"key":"1062_CR16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.4.4.303","volume":"4","author":"M Maschler","year":"1979","unstructured":"Maschler, M., Peleg, B., Shapley, L.: Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. 4, 303\u2013338 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1062_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00182-009-0176-3","volume":"39","author":"M Maschler","year":"2010","unstructured":"Maschler, M., Potters, J., Reijnierse, H.: The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties. Int. J. Game Theory 39(1\u20132), 89\u2013104 (2010)","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"1062_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. 3(3), 189\u2013196 (1978)","journal-title":"Math. Oper. Res."},{"key":"1062_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0165-4896(99)00004-9","volume":"38","author":"JAM Potters","year":"1999","unstructured":"Potters, J.A.M., Sudh\u00f6lter, P.: Airport problems and consistent allocation rules. Math. Soc. Sci. 38, 83\u2013102 (1999)","journal-title":"Math. Soc. Sci."},{"key":"1062_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/game.1997.0629","volume":"24","author":"H Reijnierse","year":"1998","unstructured":"Reijnierse, H., Potters, J.A.M.: The $${\\cal B}$$ B -nucleolus of tu-games. Games Econ. Behav. 24, 77\u201396 (1998)","journal-title":"Games Econ. Behav."},{"key":"1062_CR21","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0165-1765(87)90144-3","volume":"23","author":"EC Rosenthal","year":"1987","unstructured":"Rosenthal, E.C.: The minimum cost spanning forest game. Econ. Lett. 23, 355\u2013357 (1987)","journal-title":"Econ. Lett."},{"key":"1062_CR22","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17, 1163\u20131170 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"1062_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.20436","volume":"59","author":"D Skorin-Kapov","year":"2012","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J.: A note on steiner tree games. Networks 59(2), 215\u2013225 (2012)","journal-title":"Networks"},{"key":"1062_CR24","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.orl.2016.05.014","volume":"44","author":"T Solymosi","year":"2016","unstructured":"Solymosi, T., Sziklai, B.: Characterization sets for the nucleolus in balanced games. Oper. Res. Lett. 44, 520\u2013524 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1062_CR25","unstructured":"Sziklai, B.: On the computation of the nucleolus of cooperative transferable utility games. Ph.d. thesis, E\u00f6t\u00f6s Lor\u00e1nd University, Budapest (2015)"},{"key":"1062_CR26","unstructured":"Sziklai B, Fleiner T, Solymosi T (2014) On the core of directed acyclic graph games. IEHAS Discussion Papers MT-DP 2014\/18"},{"key":"1062_CR27","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.geb.2011.09.002","volume":"75","author":"C Trudeau","year":"2012","unstructured":"Trudeau, C.: A new stable and more responsive cost sharing solution for minimum cost spanning tree problems. Games Econ. Behav. 75, 402\u2013412 (2012)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"1062_CR28","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01240156","volume":"21","author":"A Nouweland van den","year":"1993","unstructured":"van den Nouweland, A., Tijs, S., Maschler, M.: Monotonic games are spanning network games. Int. J. Game Theory 21(4), 419\u2013427 (1993)","journal-title":"Int. J. Game Theory"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1062-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1062-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1062-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1062-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T13:45:51Z","timestamp":1568295951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1062-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,18]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1062"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1062-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,18]]}}}