On spectrum sharing games

DOI10.1007/s00446-010-0098-0zbMath1267.91007OpenAlexW1971109583MaRDI QIDQ2377140

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

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0098-0

zbMATH Keywords

game theoryapproximation algorithmNash equilibriumgraph coloringprice of anarchyunit disk graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Coloring of graphs and hypergraphs (05C15) Game theory (91Axx)

Related Items (2)

Price of anarchy for graph coloring games with concave payoff ⋮ Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Local Search for Weighted k-Set Packing
• On a network creation game
• How bad is selfish routing?
• 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
• Selfish traffic allocation for server farms
• The complexity of pure Nash equilibria
• A Game Theoretic Approach for Efficient Graph Coloring
• Simple heuristics for unit disk graphs
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Graph-Theoretic Concepts in Computer Science
• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)

This page was built for publication: On spectrum sharing games