$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
From MaRDI portal
Publication:3599089
DOI10.1007/978-3-540-95891-8_38zbMath1206.68139OpenAlexW184318459MaRDI QIDQ3599089
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_38
Games involving graphs (91A43) Other game-theoretic models (91A40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Potential games
- A class of games possessing pure-strategy Nash equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- Nash Equilibria in Voronoi Games on Graphs
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- Near-optimal network design with selfish agents
- Algorithmic Game Theory
This page was built for publication: $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games