{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:06:43Z","timestamp":1760299603585,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000155","name":"Social Sciences and Humanities Research Council of Canada","doi-asserted-by":"publisher","award":["435-2014-0140"],"award-info":[{"award-number":["435-2014-0140"]}],"id":[{"id":"10.13039\/501100000155","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00355-017-1061-9","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T07:43:02Z","timestamp":1496216582000},"page":"287-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimum incoming cost rules for arborescences"],"prefix":"10.1007","volume":"49","author":[{"given":"Eric","family":"Bahel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4195-4153","authenticated-orcid":false,"given":"Christian","family":"Trudeau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"3","key":"1061_CR1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s00182-015-0469-7","volume":"45","author":"E Bahel","year":"2016","unstructured":"Bahel E (2016) On the core and bargaining set of a veto game. Int J Game Theory 45(3):543\u2013566","journal-title":"Int J Game Theory"},{"issue":"2","key":"1061_CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.econlet.2014.08.033","volume":"125","author":"E Bahel","year":"2014","unstructured":"Bahel E, Trudeau C (2014) Stable lexicographic rules for shortest path games. Econ Lett 125(2):266\u2013269","journal-title":"Econ Lett"},{"issue":"2","key":"1061_CR3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.geb.2010.01.003","volume":"69","author":"G Berganti\u00f1os","year":"2010","unstructured":"Berganti\u00f1os G, Kar A (2010) On obligation rules for minimum cost spanning tree problems. Games Econ Behav 69(2):224\u2013237","journal-title":"Games Econ Behav"},{"issue":"1","key":"1061_CR4","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 (2007) A fair rule in minimum cost spanning tree problems. J Econ Theory 137(1):326\u2013352","journal-title":"J Econ Theory"},{"key":"1061_CR5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jmateco.2008.03.003","volume":"45","author":"G Berganti\u00f1os","year":"2009","unstructured":"Berganti\u00f1os G, Vidal-Puga J (2009) Additivity in minimum cost spanning tree problems. J Math Econ 45:38\u201342","journal-title":"J Math Econ"},{"key":"1061_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C Bird","year":"1976","unstructured":"Bird C (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6:335\u2013350","journal-title":"Networks"},{"key":"1061_CR7","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 (2010) Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Games Econ Behav 69:238\u2013248","journal-title":"Games Econ Behav"},{"key":"1061_CR8","first-page":"1396","volume":"14","author":"Y Chu","year":"1965","unstructured":"Chu Y, Liu T (1965) On the shortest arborescence of a directed graph. Sci Sin 14:1396\u20131400","journal-title":"Sci Sin"},{"issue":"1","key":"1061_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.geb.2011.05.007","volume":"74","author":"B Dutta","year":"2012","unstructured":"Dutta B, Mishra D (2012) Minimum cost arborescences. Games Econ Behav 74(1):120\u2013143","journal-title":"Games Econ Behav"},{"key":"1061_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds J (1967) Optimum branchings. J Res Natl Bur Stand 71:233\u2013240","journal-title":"J Res Natl Bur Stand"},{"key":"1061_CR11","volume-title":"On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Technical report 106, CentER DP 1994 nr.106","author":"V Feltkamp","year":"1994","unstructured":"Feltkamp V, Tijs S, Muto S (1994) On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Technical report 106, CentER DP 1994 nr.106. Tilburg University, The Netherlands"},{"issue":"1","key":"1061_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ejor.2005.04.036","volume":"175","author":"S Tijs","year":"2006","unstructured":"Tijs S, Branzei R, Moretti S, Norde H (2006) Obligation rules for minimum cost spanning tree situations and their monotonicity properties. Eur J Oper Res 175(1):121\u2013134","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1061_CR13","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 (2012) A new stable and more responsible cost sharing solution for mcst problems. Games Econ Behav 75(1):402\u2013412","journal-title":"Games Econ Behav"},{"issue":"2","key":"1061_CR14","doi-asserted-by":"crossref","first-page":"1340003","DOI":"10.1142\/S0219198913400033","volume":"15","author":"C Trudeau","year":"2013","unstructured":"Trudeau C (2013) Characterizations of the Kar and folk solutions for minimum cost spanning tree problems. Int Game Theory Rev 15(2):1340003","journal-title":"Int Game Theory Rev"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00355-017-1061-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-017-1061-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-017-1061-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T03:33:28Z","timestamp":1502768008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00355-017-1061-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["1061"],"URL":"https:\/\/doi.org\/10.1007\/s00355-017-1061-9","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"type":"print","value":"0176-1714"},{"type":"electronic","value":"1432-217X"}],"subject":[],"published":{"date-parts":[[2017,5,31]]}}}