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

DOI10.1016/J.IPL.2015.10.006zbMATH Open1348.90327OpenAlexW2114660625MaRDI QIDQ903377FDOQ903377

Authors Fang Xie, Qingguo Bai, Zhe Xu, Yuzhong 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 evaluationprice of anarchycost sharingactivation costgame scheduling

Mathematics Subject Classification ID

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

Recommendations

• Inefficiency of equilibria for scheduling game with machine activation costs
• Scheduling games on uniform machines with activation cost
• The PoA of Scheduling Game with Machine Activation Costs
• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
• An allocation game on two uniform machines with activation cost

Cites work

• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• Better Online Algorithms for Scheduling with Machine Cost
• Conflicting congestion effects in resource allocation games
• Efficiency analysis of load balancing games with and without activation costs
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• Inefficiency of equilibria for the machine covering game on uniform machines
• New upper and lower bounds for online scheduling with machine cost
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Price of anarchy in parallel processing
• Worst-case equilibria

Cited in

(11)

• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
• Existence of Nash equilibria in scheduling game on limited machines with activation cost
• The PoA of Scheduling Game with Machine Activation Costs
• Tighter price of anarchy for selfish task allocation on selfish machines
• An allocation game on two uniform machines with activation cost
• Inefficiency of equilibria for scheduling game with machine activation costs
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• Cost-sharing scheduling games on restricted unrelated machines
• Efficiency analysis with respect to the unit cost objectives in scheduling games
• Scheduling games on uniform machines with activation cost

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903377)