117
click to vote
SOFSEM
2009
Springer
16 years 4 days ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...