CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider a variation of the resource allocation problem. In the traditional problem, there is a global planner who would like to assign a set of players to a set of resources s...
SOFSEM
2009
Springer
14 years 2 months 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...