Inefficiency of equilibria for scheduling game with machine activation costs

DOI10.1016/J.TCS.2015.05.035MaRDI QIDQ897948zbMATH OpenOpenAlexFDO

Authors Ling Lin, Xiaochen Xian, Yujie Yan, Xing He, Zhiyi Tan

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.05.035

zbMATH Keywords

Nash equilibriumprice of anarchyprice of stabilityscheduling game

Mathematics Subject Classification ID

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

Recommendations

• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• The PoA of Scheduling Game with Machine Activation Costs
• Scheduling games on uniform machines with activation cost
• 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 2038735 (Why is no real title available?)
• Conflicting congestion effects in resource allocation games
• Efficiency analysis of load balancing games with and without activation costs
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Strong equilibrium in cost sharing connection games
• The Price of Stability for Network Design with Fair Cost Allocation
• The price of anarchy on uniformly related machines revisited
• The structure and complexity of Nash equilibria for a selfish routing game
• Tight bounds for worst-case equilibria
• Utilitarian resource assignment
• Worst-case equilibria

Cited in

(15)

• Inefficiency of equilibria for the machine covering game on uniform machines
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• An allocation game on two uniform machines with activation cost
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss
• Cost-sharing scheduling games on restricted unrelated machines
• Efficiency analysis with respect to the unit cost objectives in scheduling games
• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• Coordination mechanisms for scheduling games with machine modification
• Scheduling games on uniform machines with activation cost
• The PoA of Scheduling Game with Machine Activation Costs
• Coordination mechanisms for scheduling games with proportional deterioration
• Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis

This page was built for publication: Inefficiency of equilibria for scheduling game with machine activation costs

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