{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:24Z","timestamp":1725559164263},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260523"},{"type":"electronic","value":"9783540320739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11429647_19","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:18:25Z","timestamp":1279045105000},"page":"231-245","source":"Crossref","is-referenced-by-count":8,"title":["Free-Riders in Steiner Tree Cost-Sharing Games"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-19_CR1.1","doi-asserted-by":"crossref","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment in ad-hoc wireless networks. Preliminary results in WCNC 2003 and TCS 2003 (2003);","DOI":"10.1007\/978-3-540-39658-1_13"},{"key":"#cr-split#-19_CR1.2","unstructured":"Submitted journal version available at http:\/\/www.cs.iit.edu\/calinesc\/"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bil\u00f3, V., Di Francescomarino, C., Flammini, M., Melideo, G.: Sharing the cost of multicast transmissions in wireless networks. In: Proceedings of SPAA, pp. 180\u2013187 (2004)","DOI":"10.1145\/1007912.1007940"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1022630.1022644","volume-title":"Proc. of the joint workshop on Foundations of mobile computing (DIALM-POMC)","author":"M. Flammini","year":"2004","unstructured":"Flammini, M., Navarra, A., Klasing, R., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proc. of the joint workshop on Foundations of mobile computing (DIALM-POMC), pp. 85\u201391. ACM Press, New York (2004)"},{"key":"19_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"19_CR6","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost-sharing schemes. In: Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA) (January 2005)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"19_CR8","unstructured":"Kent, K., Skorin-Kapov, D.: Population monotonic cost allocation on MST\u2019s. In: Operational Research Proceedings KOI, vol. 43\u201348 (1996)"},{"key":"19_CR9","volume-title":"Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA)","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA). ACM Press, New York (2005) (to appear)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/988772.988814","volume-title":"Proc. of 5th ACM Conference on Electronic Commerce (EC)","author":"S. Leonardi","year":"2004","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost-sharing methods for connected facility location games. Technical Report MPI-I-2003-1-017, Max-Plankt-Institut f\u00fcr Informatik, September 2003. In: Proc. of 5th ACM Conference on Electronic Commerce (EC), pp. 242\u2013243. ACM Press, New York (2004)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230080104","volume":"8","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Cost allocation for Steiner trees. Networks\u00a08, 1\u20136 (1978)","journal-title":"Networks"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: characterization by coalition strategy-proofness. Social Choice and Welfare\u00a016, 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency (1997), http:\/\/www.aciri.org\/shenker\/cost.ps","DOI":"10.2139\/ssrn.42940"},{"key":"19_CR14","unstructured":"P\u00e0l, M., Tardos, \u00c9.: Strategy proof mechanisms via primal-dual algorithms. In: Proc. of the 44th FOCS (2003)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-31833-0_10","volume-title":"Approximation and Online Algorithms","author":"P. Penna","year":"2005","unstructured":"Penna, P., Ventre, C.: More Powerful and Simpler Cost-Sharing Methods. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 97\u2013110. Springer, Heidelberg (2005)"},{"key":"19_CR16","unstructured":"Robins, A., Zelikovsky: Improved approximation Steiner tree in graphs. In: Proc. of the 11th Annual ACM Symposium on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"key":"19_CR17","unstructured":"van Zwam, S.: A lower bound on the cost recovery of the Steiner tree game with cross-monotonic cost shares. Technical Report 18-04, Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (2004)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Young, H.P.: Cost Allocation. In: Aumann, R.J., Hart, S. (eds.). Handbook of Game Theory, vol.\u00a02, ch. 34, pp. 1193\u20131235. Elsevier Science, Amsterdam (1994)","DOI":"10.1016\/S1574-0005(05)80066-9"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11429647_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T10:14:09Z","timestamp":1635675249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11429647_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260523","9783540320739"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11429647_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}