{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:54:04Z","timestamp":1725472444870},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291329"},{"type":"electronic","value":"9783540320869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561354_3","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T12:12:28Z","timestamp":1128514348000},"page":"4-17","source":"Crossref","is-referenced-by-count":4,"title":["Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Pilu","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Lazzoni","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C.: An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks. In: Proc. of the 33rd International Colloquium on Automata, Languages and Programming, ICALP (2005) (to appear)","DOI":"10.1007\/11523468_92"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1145\/780542.780617","volume-title":"STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T.: Near-optimal Network Design with Selfish Agents. In: STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 511\u2013520. ACM Press, New York (2003)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: FOCS, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M., Melideo, G., Moscardelli, L.: On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. In: Proc. of the 15th International Symposium on Algorithms and Computation (ISAAC), pp. 172\u2013183 (2004)","DOI":"10.1007\/978-3-540-30551-4_17"},{"key":"3_CR5","unstructured":"C\u01celinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162\u20131171 (2001)"},{"key":"3_CR6","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome \u201cTor Vergata\u201d, Math Department (2001), Available at http:\/\/www.mat.uniroma2.it\/~penna\/papers\/stacs01-TR.ps.gz (Extended version of [7])"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Di Ianni, M., Lazzoni, A., Penna, P., Rossi, G., Vocca, P.: Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. Technical Report, University of Rome \u201cTor Vergata\u201d, Math Department (2005), Available at http:\/\/www.mat.uniroma2.it\/~rossig\/adhocnow2005extended.pdf","DOI":"10.1007\/11561354_3"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Eidenbenz, S., Kumar, V.S.A., Zust, S.: Equilibria in Topology Control Games for Ad-Hoc Networks. In: Proceedings of the DIALM (2003)","DOI":"10.1145\/941079.941081"},{"key":"3_CR10","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: 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 (2000)"},{"key":"3_CR11","unstructured":"Jardosh, A., Belding-Royer, E.M., Almeroth, K.C., Suri, S.: Real world Environment Models for Mobile Ad hoc Networks. IEEE Journal on Special Areas in Communications (to appear)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/978-3-540-24693-0_71","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"R. Klasing","year":"2004","unstructured":"Klasing, R., Navarra, A., Papadopoulos, A., P\u00e9r\u00e9nnes, S.: Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 866\u2013877. Springer, Heidelberg (2004)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential Game. Games and Economic Behaviour\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behaviour"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C.L. Monma","year":"1992","unstructured":"Monma, C.L., Suri, S.: Transitions in Geometric Minimum Spanning Trees. Discrete & Computational Geometry\u00a08, 265\u2013293 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR15","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":"3_CR16","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Hoboken (1995)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1023756.1023769","volume-title":"Proc. of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks (PE-WASUN)","author":"P. Penna","year":"2004","unstructured":"Penna, P., Ventre, C.: Energy-Efficient Broadcasting in Ad-Hoc Networks: Combining MSTs with Shortest-Path Trees. In: Proc. of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks (PE-WASUN), pp. 61\u201368. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561354_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T02:35:29Z","timestamp":1586486129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561354_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291329","9783540320869"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11561354_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}