Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines

DOI10.1016/j.ipl.2015.06.005zbMath1332.91035OpenAlexW561452522MaRDI QIDQ2353644

Yong Wu, Min Ji, Cheng, T. C. Edwin

Publication date: 15 July 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.06.005

zbMATH Keywords

schedulingNash equilibriumhierarchyprice of anarchyprice of stability

Mathematics Subject Classification ID

Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Maximizing the minimum load: the cost of selfishness
• The price of anarchy on uniformly related machines revisited
• Worst-case equilibria
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Inefficiency of equilibria for the machine covering game on uniform machines
• Strong price of anarchy
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Coordination mechanism for selfish scheduling under a grade of service provision
• Inefficiency of Nash equilibria with parallel processing policy
• On-Line Load Balancing in a Hierarchical Server Topology
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Convergence time to Nash equilibrium in load balancing
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Strong Price of Anarchy for Machine Load Balancing

This page was built for publication: Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines