On spectrum sharing games

DOI10.1145/1011767.1011783MaRDI QIDQ5501489zbMATH OpenOpenAlexFDO

Authors Magnús M. Halldórsson, Joseph Y. Halpern, Li Li, Vahab S. Mirrokni

Publication date 3 August 2015

Published in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1011767.1011783

zbMATH Keywords

game theoryapproximation algorithmgraph coloringNash equilibriumprice of anarchyunit disk graph

Mathematics Subject Classification ID

Noncooperative games (91A10) Coloring of graphs and hypergraphs (05C15) Other game-theoretic models (91A40) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Recommendations

• On spectrum sharing games
• Spectrum Bidding in Wireless Networks and Related
• Game theoretic approaches for spectrum redistribution
• Network sharing by two mobile operators: beyond competition, cooperation
• Algorithms and Computation

Cited in

(8)

• Network sharing by two mobile operators: beyond competition, cooperation
• Spectrum allocation for decentralized transmission strategies: properties of Nash equilibria
• The Maximum k-Colorable Subgraph Problem and Related Problems
• On spectrum sharing games
• Nash equilibrium and stability in network selection games
• Multi-games for LTE and WiFi coexistence over unlicensed channels
• Non-cooperative facility location and covering games
• Spectrum Bidding in Wireless Networks and Related

This page was built for publication: On spectrum sharing games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501489)