{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:24Z","timestamp":1725497244146},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_35","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"390-401","source":"Crossref","is-referenced-by-count":1,"title":["The Price of Nash Equilibria in Multicast Transmissions Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/FOCS.2004.68","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"E. Anshelevich","year":"2004","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304. IEEE Computer Society, Los Alamitos (2004)"},{"key":"35_CR2","first-page":"511","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC)","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 511\u2013520. ACM Press, New York (2003)"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A. Archer","year":"2004","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047(1), 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Di Francescomarino, C., Flammini, M., Melideo, G., Moscardelli, L., Navarra, A.: Sharing the cost of multicast transmissions in wireless networks. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2006.09.004"},{"key":"35_CR5","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Melideo, G., Moscardelli, L.: Multicast transmissions in non-cooperative networks with a limited number of selfish moves (submitted)"},{"key":"35_CR6","unstructured":"Bil\u00f2, V., Flammini, M., Melideo, G., Moscardelli, L.: On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. Wireless Networks (to appear)"},{"issue":"1-3","key":"35_CR7","first-page":"215","volume":"304","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Journal of Public Economics\u00a0304(1-3), 215\u2013236 (2003)","journal-title":"Journal of Public Economics"},{"key":"35_CR8","first-page":"218","volume-title":"Proceedings of 32nd ACM Symposium on Theory of Computing (STOC)","author":"J. Feigenbaum","year":"2000","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. In: Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), pp. 218\u2013227. ACM Press, New York (2000)"},{"key":"35_CR9","first-page":"364","volume-title":"Proceedings of 33rd ACM Symposium on Theory of Computing (STOC)","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pp. 364\u2013372. ACM Press, New York (2001)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"3","key":"35_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory\u00a018(3), 511\u2013533 (2001)","journal-title":"Economic Theory"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"35_CR14","volume-title":"A course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, p. 97. Springer, Heidelberg (2005)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/11429647_19","volume-title":"Structural Information and Communication Complexity","author":"P. Penna","year":"2005","unstructured":"Penna, P., Ventre, C.: Free-riders in steiner tree cost-sharing games. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 231\u2013245. Springer, Heidelberg (2005)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: The value of n-person games. Contributions to the theory of games, pp. 31\u201340. Princeton University Press (1953)","DOI":"10.1017\/CBO9780511528446.003"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:12Z","timestamp":1619521272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_35","relation":{},"subject":[]}}