Please use this identifier to cite or link to this item:
|dc.title||The price of stability in selfish scheduling games|
|dc.identifier.citation||Agussurja, L.,Lau, H.C. (2009). The price of stability in selfish scheduling games. Web Intelligence and Agent Systems 7 (4) : 321-332. ScholarBank@NUS Repository. <a href="https://doi.org/10.3233/WIA-2009-0171" target="_blank">https://doi.org/10.3233/WIA-2009-0171</a>|
|dc.description.abstract||Game theory has gained popularity as an approach to analysing and understanding distributed systems with self-interested 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 characteristics 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; second, any ε-approximation algorithm for finding the optimum can be transformed into an ε-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, and leave the analytical bound of this gap for future work. © 2009 - IOS Press and the authors. All rights reserved.|
|dc.subject||Price of stability|
|dc.contributor.department||THE LOGISTICS INSTITUTE - ASIA PACIFIC|
|dc.description.sourcetitle||Web Intelligence and Agent Systems|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Feb 1, 2023
checked on Feb 2, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.