Inefficiency analysis of the scheduling game on limited identical machines with activation costs

DOI10.1016/J.IPL.2015.10.006zbMath1348.90327OpenAlexW2114660625MaRDI QIDQ903377

Fang Xie, Qingguo Bai, Zhe Xu, Yu-Zhong Zhang

Publication date: 5 January 2016

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

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

zbMATH Keywords

performance evaluationcost sharingprice of anarchyactivation costgame scheduling

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Cost-sharing scheduling games on restricted unrelated machines ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ Tighter price of anarchy for selfish task allocation on selfish machines

Cites Work

• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• New upper and lower bounds for online scheduling with machine cost
• Inefficiency of equilibria for the machine covering game on uniform machines
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Price of anarchy in parallel processing
• Efficiency analysis of load balancing games with and without activation costs
• Conflicting Congestion Effects in Resource Allocation Games
• Better Online Algorithms for Scheduling with Machine Cost
• Unnamed Item
• Unnamed Item

This page was built for publication: Inefficiency analysis of the scheduling game on limited identical machines with activation costs