-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.
Kim Thang NguyenPublished in: SOFSEM (2009)
Keyphrases
- pure nash equilibrium
- game theoretic
- pure nash equilibria
- nash equilibrium
- scheduling problem
- game theory
- congestion games
- scheduling algorithm
- resource allocation
- computational complexity
- decision problems
- round robin
- solution concepts
- np hard
- worst case
- flexible manufacturing systems
- learning theory
- nash equilibria
- game development
- cost function
- cooperative