NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games.
Kim Thang NguyenPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- network design
- pure nash equilibrium
- np hardness
- game theoretic
- pure nash equilibria
- np hard
- scheduling problem
- approximation algorithms
- nash equilibrium
- game theory
- decision problems
- communication networks
- mixed integer
- network architecture
- congestion games
- resource allocation
- lower bound
- nash equilibria
- cooperative
- special case
- computational complexity
- multi agent
- learning algorithm
- neural network