{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:38Z","timestamp":1740099218538,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030017125"},{"type":"electronic","value":"9783030017132"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01713-2_24","type":"book-chapter","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T14:22:06Z","timestamp":1542982926000},"page":"339-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Cooperative Connection Situations Where the Players Are Located at the Edges"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Moretti","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,14]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-642-10841-9_40","volume-title":"Internet and Network Economics","author":"H Aziz","year":"2009","unstructured":"Aziz, H., Lachish, O., Paterson, M., Savani, R.: Wiretapping a hidden network. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 438\u2013446. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_40"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejor.2010.10.035","volume":"211","author":"G Berga\u00f1tinos","year":"2011","unstructured":"Berga\u00f1tinos, G., Lorenzo, L., Lorenzo-Freire, S.: A generalization of obligation rules for minimum cost spanning tree problems. Eur. J. Oper. Res. 211, 122\u2013129 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR3","doi-asserted-by":"publisher","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"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11238-004-5635-5","volume":"56","author":"R Branzei","year":"2004","unstructured":"Branzei, R., Moretti, S., Norde, H., Tijs, S.: The P-value for cost sharing in minimum cost spanning tree situations. Theory Decis. 56, 47\u201361 (2004)","journal-title":"Theory Decis."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/net.3230030402","volume":"3","author":"A Claus","year":"1973","unstructured":"Claus, A., Kleitman, D.J.: Cost allocation for a spanning tree. Networks 3, 289\u2013304 (1973)","journal-title":"Networks"},{"key":"24_CR6","unstructured":"Feltkamp, V.: Cooperation in controlled network structures, PhD Dissertation, Tilburg University, The Netherlands (1995)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: On minimum cost spanning tree games. Math. Prog. 21, 1\u201318 (1981)","journal-title":"Math. Prog."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.geb.2014.05.010","volume":"87","author":"JL Hougaard","year":"2014","unstructured":"Hougaard, J.L., Moulin, H.: Sharing the cost of redundant items. Games Econ. Behav. 87, 339\u2013352 (2014)","journal-title":"Games Econ. Behav."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00186-008-0226-9","volume":"69","author":"S Moretti","year":"2009","unstructured":"Moretti, S., Tijs, S., Branzei, R., Norde, H.: Cost allocation protocols for supply contract design in network situations. Math. Meth. Oper. Res. 69(1), 181\u2013202 (2009)","journal-title":"Math. Meth. Oper. Res."},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.geb.2010.08.002","volume":"72","author":"H Moulin","year":"2011","unstructured":"Moulin, H., Laigret, F.: Equal-need sharing of a network under connectivity constraints. Games Econ. Behav. 72(1), 314\u2013320 (2011)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/moor.22.1.146","volume":"22","author":"H Nagamochi","year":"1997","unstructured":"Nagamochi, H., Zeng, D.Z., Kabutoya, N., Ibaraki, T.: Complexity of the minimum base game on matroids. Math. Oper. Res. 22(1), 146\u2013164 (1997)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/S0377-2217(02)00714-2","volume":"154","author":"H Norde","year":"2004","unstructured":"Norde, H., Moretti, S., Tijs, S.: Minimum cost spanning tree games and population monotonic allocation schemes. Eur. J. Oper. Res. 154(1), 84\u201397 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A Value for n-Person Games. In: Kuhn, H.W., Tucker, A.W. (ed.) Contributions to the Theory of Games II, Ann. Math. Studies 28, 307\u2013317, Princeton University Press (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01753429","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S.: Cores and convex games. Int. J. Game Theory 1, 1\u201326 (1971)","journal-title":"Int. J. Game Theory"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0899-8256(90)90006-G","volume":"2","author":"Y Sprumont","year":"1990","unstructured":"Sprumont, Y.: Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ. Behav. 2, 378\u2013394 (1990)","journal-title":"Games Econ. Behav."},{"key":"24_CR18","doi-asserted-by":"publisher","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.: Obligation rules for minimum cost spanning tree situations and their monotonicity properties. Eur. J. Oper. Res. 175, 121\u2013134 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01713-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T14:26:41Z","timestamp":1542983201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01713-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017125","9783030017132"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01713-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}