On spectrum sharing games

DOI10.1145/1011767.1011783zbMath1322.91014OpenAlexW2158061833MaRDI QIDQ5501489

Joseph Y. Halpern, Magnús M. Halldórsson, Li (Erran) 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 algorithmNash equilibriumgraph coloringprice of anarchyunit disk graph

Mathematics Subject Classification ID

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

Related Items (2)

The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Non-cooperative facility location and covering games

This page was built for publication: On spectrum sharing games