On spectrum sharing games

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 107-114

  Halldórsson, Magnús M ^a   Li, Li ^b   Halpern, Joseph Y ^c   Mirrokni, Vahab S ^d  

^a UNIVERSITY OF ICELAND   (Iceland)

^b LUCENT TECHNOLOGIES   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; Games theroy; Graph coloring; Nash equilibrium; Price of anarchy; Unit disk graph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; GRAPH THEORY; LOCAL AREA NETWORKS; OPTIMIZATION; SPECTRUM ANALYSIS; USER INTERFACES; WIRELESS TELECOMMUNICATION SYSTEMS;

GRAPH COLORING; MEDIA ACCESS CONTROL (MAC) PROTOCOL; PRICE OF ANARCHY; UNIT DISK GRAPH (UDG);

GAME THEORY;

EID: 10444254599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011783     Document Type: Conference Paper

References (22)

1. O. Aftab. Economic mechanisms for efficient wireless coexistence. MIT Technical Report MIT-LCS-TR-876, 2002.
2. E. M. Arkin and R. Hassin. On local search for weighted k-set packing. Mathematics of Operations Research, 23:640-648, 1998.
3. Y. Bejerano and R. Bhatia. MiFi: A framework for fairness and QoS assurance in current IEEE 802.11 networks with multiple access points. In Proc. INFOCOM, 2004.
4. A. Czumaj, P. Krysta, and B. Vocking. Selfish traffic allocation for server farms. In Proc. 34th ACM Symp. on Theory of Computing (STOC), pages 287-296, 2002.
5. E. Even-dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibria. In Proc. 30th International Colloq. on Automata, Languages, and Programming (ICALP), pages 502-513, 2003.
6. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In Proc. 22nd Annual Symp. Principles of Distributed Computing (PODC), pages 347-351, 2003.
7. A. Fabrikant, C. Papadimitriou, and K. Talwar. On the complexity of pure equilibria. In Proc. 37th Annuals Symp. on Theory of Computing (STOC), 2004.
8. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NF - Completeness. Freeman, San Francisco, CA, 1979.
9. M. Goemans, L. Li, V. S. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad hoc networks. In Proc. MOBIHOC, 2004.
10. M. M. Halldórsson. Approximating discrete collections via local improvements. In Proc. Sixth ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 160-169, Jan. 1995.
11. 1-ε. Acta Mathematica, 182:105-142, 1999.
12. D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1997.
13. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal of Discrete Mathematics, 2(1):68-72, Feb. 1989.
14. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In Proc. 16th Annual Conf. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Volume 1563, pages 404-413. Springer-Verlag, Berlin, 1999.
15. M. V. Marathe, H. Breu, H. B. Hunt III, and S. S. R. a nd D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
16. Meshnetworks, Inc. Medford Mobilizes Wireless Workforce. http://www.meshnetworks.com/pdf/cs.medford-or.pdf.
17. V. S. Mirrokni and A. Vetta. Convergence issues in competitive games. In Random-Approx, to appear, 2004.
18. T. Nieberg, J. L. Hurink, and W. Kern. A new PTAS for maximum independent sets in unit disk graphs. Department of Applied Mathmematics, University of Twente, Technical Memorandum No. 1688, 2003.
19. T. Roughgarden and E. Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
20. D. P. Satapathy and J. M. Peha. A novel co-existence algorithm for unlicensed fixed power devices. In Proc. IEEE Wireless Communication and Networking Conference (WCNC), volume 3, pages 1403-1409, 2000.
21. Verizon. Verizon WiFi Networks. http://www.verizon.net/wifi/.
22. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proc. 43rd Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.