{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:00:55Z","timestamp":1743127255975,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_17","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"172-183","source":"Crossref","is-referenced-by-count":3,"title":["On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Melideo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Di Francescomarino, C., Flammini, M., Melideo, G.: Sharing the cost of multicast transmissions in wireless networks. In: Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2004)","DOI":"10.1145\/1007912.1007940"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Moscardelli, L.: The price of anarchy in all-optical networks. In: Proceedings of the 11th Colloquium on Structural Information and Communication Complexity, SIROCCO (2004)","DOI":"10.1007\/978-3-540-27796-5_2"},{"key":"17_CR3","unstructured":"Clementi, A.E.F., Huiban, H., Penna, P., Rossi, G., Vocca, P.: Some recent theoretical advances and open questions on energy consumption in static ad-hoc wireless networks. In: Proceedings of the 3rd International Workshop on Approximation and Randomization (ARACNE), pp. 23\u201338 (2002)"},{"key":"17_CR4","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about nash equilibria. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pp. 765\u2013771 (2003)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 30th Annual International Colloquium on Automata, Languages and Programming (ICALP)","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Proceedings of the 30th Annual International Colloquium on Automata, Languages and Programming (ICALP). LNCS, Springer, Heidelberg (2003)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure equilibria. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"17_CR8","volume-title":"Proceedings of the 4th ACM Conference on Electronic Commerce (EC)","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC), ACM, New York (2003)"},{"issue":"1-3","key":"17_CR9","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":"17_CR10","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, New York (2000)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D.A. Fotakis","year":"2002","unstructured":"Fotakis, D.A., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"17_CR12","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. W.H. Freeman and Co, New York (1979)"},{"key":"17_CR13","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, New York (2001)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 387\u2013396. Springer, Heidelberg (1999)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: 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"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-27796-5_23","volume-title":"Structural Information and Communication Complexity","author":"P. Penna","year":"2004","unstructured":"Penna, P., Ventre, C.: Sharing the cost of multicast transmissions in wireless networks. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 255\u2013266. Springer, Heidelberg (2004)"},{"key":"17_CR19","volume-title":"Wireless communications: principles and practice","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of ACM"},{"key":"17_CR22","first-page":"31","volume-title":"Contributions to the theory of games","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: The value of n-person games. In: Contributions to the theory of games, pp. 31\u201340. Princeton University Press, Princeton (1953)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013425 (2002)","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"17_CR24","first-page":"585","volume-title":"Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)","author":"J.E. Wieselthier","year":"2000","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 585\u2013594. IEEE Computer Society, Los Alamitos (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:16Z","timestamp":1740261136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}