{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092137},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_33","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"477-491","source":"Crossref","is-referenced-by-count":0,"title":["Braess\u2019s Paradox in Wireless Networks: The Danger of Improved Technology"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merav","family":"Parter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/MWC.2005.1421925","volume":"12","author":"J.G. Andrews","year":"2005","unstructured":"Andrews, J.G.: Interference cancellation for cellular systems: a contemporary overview. IEEE Wireless Communications\u00a012, 19\u201329 (2005)","journal-title":"IEEE Wireless Communications"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: Proc. 28th Conf. of IEEE Computer and Communications Societies, INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"\u00c1sgeirsson, E.I., Mitra, P.: On a game theoretic approach to capacity maximization in wireless networks. In: INFOCOM (2011)","DOI":"10.1109\/INFCOM.2011.5935146"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2003","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput.\u00a032(1), 48\u201377 (2003)","journal-title":"SIAM J. Comput."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Avin, C., Cohen, A., Haddad, Y., Kantor, E., Lotker, Z., Parter, M., Peleg, D.: Sinr diagram with interference cancellation. In: SODA, pp. 502\u2013515 (2012)","DOI":"10.1137\/1.9781611973099.43"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR diagrams: Towards algorithmically usable sinr models of wireless networks. In: Proc. 28th Symp. on Principles of Distributed Computing, PODC (2009)","DOI":"10.1145\/1582716.1582750"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-04128-0_34","volume-title":"Algorithms - ESA 2009","author":"C. Avin","year":"2009","unstructured":"Avin, C., Lotker, Z., Pignolet, Y.-A.: On the power of uniform power: Capacity of wireless networks with bounded resources. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 373\u2013384. Springer, Heidelberg (2009)"},{"key":"33_CR8","first-page":"373","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008","author":"A. Blum","year":"2008","unstructured":"Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 373\u2013382. ACM, New York (2008)"},{"issue":"1","key":"33_CR9","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00fcber ein paradoxon aus der verkehrsplanung. Unternehmensforschung\u00a012(1), 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TIT.1987.1057340","volume":"33","author":"M.H.M. Costa","year":"1987","unstructured":"Costa, M.H.M., El Gamal, A.A.: The capacity region of the discrete memoryless interference channel with strong interference. IEEE Trans. Inf. Theor.\u00a033(5), 710\u2013711 (1987)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1132516.1132527","volume-title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a nash equilibrium. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 71\u201378. ACM, New York (2006)"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Dinitz, M.: Distributed algorithms for approximating wireless network capacity. In: INFOCOM, pp. 1397\u20131405 (2010)","DOI":"10.1109\/INFCOM.2010.5461905"},{"issue":"12","key":"33_CR13","doi-asserted-by":"publisher","first-page":"5534","DOI":"10.1109\/TIT.2008.2006447","volume":"54","author":"R.H. Etkin","year":"2008","unstructured":"Etkin, R.H., Tse, D.N.C., Wang, H.: Gaussian interference channel capacity to within one bit. IEEE Trans. Inf. Theor.\u00a054(12), 5534\u20135562 (2008)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. 8th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Wattenhofer, R., Halld\u00f3rsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: INFOCOM, pp. 1872\u20131880 (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Information Theory\u00a046(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Information Theory"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: SODA, pp. 516\u2013526 (2012)","DOI":"10.1137\/1.9781611973099.44"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02927-1_44","volume-title":"Automata, Languages and Programming","author":"M.M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Kantor, E., Lotker, Z., Parter, M., Peleg, D.: The topology of wireless communication. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 383\u2013392. ACM (2011)","DOI":"10.1145\/1993636.1993688"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the sinr model. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.120"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., V\u00f6cking, B.: Distributed contention resolution in wireless networks. Distributed Computing (2010)","DOI":"10.1007\/978-3-642-15763-9_16"},{"key":"33_CR22","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 99","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":"2","key":"33_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput.\u00a0108(2), 212\u2013261 (1994)","journal-title":"Inf. Comput."},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proc. 25th Conf. of IEEE Computer and Communications Societies, INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"issue":"1","key":"33_CR25","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(1), 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:30:58Z","timestamp":1558103458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}