The Price of Stability in Selfish Scheduling Games
Conference Proceeding Article
Game theory has gained popularity as an approach to analysing and understanding distributed systems with selfinterested agents. Central to game theory is the concept of Nash equilibrium as a stable state (solution) of the system, which comes with a price - the loss in efficiency. The quantification of the efficiency loss is one of the main research concerns. In this paper, we study the quality and computational characteristic of the best Nash equilibrium in two selfish scheduling models: the congestion model and the sequencing model. In particular, we present the following results: (1) In the congestion model: first, the best Nash equilibrium is socially optimum and consequently, computing the best Nash is NP-hard. And second, any\in-approximation algorithm for finding the optimum can be transformed into an \in-approximation algorithm for the best Nash. (2) In sequencing model for identical machines, we show that the best Nash is no better than the worst Nash and it is easy to compute. For related machines, we show that there is a gap between the worst and the best Nash equilibrium. We left the bounding of this gap for future work.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT)
AGUSSURJA, Lucas and LAU, Hoong Chuin.
The Price of Stability in Selfish Scheduling Games. (2007). IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT). 391-394. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/261