Scheduling games on uniform machines with activation cost

DOI10.1016/J.TCS.2015.02.023MaRDI QIDQ2344765zbMATH OpenOpenAlexFDO

Authors Fang Xie, Zhe Xu, Qingguo Bai, Yuzhong Zhang

Publication date 18 May 2015

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

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

zbMATH Keywords

Nash equilibriumprice of anarchyprice of stabilityuniform machine schedulingcost sharing games

Mathematics Subject Classification ID

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

Recommendations

• An allocation game on two uniform machines with activation cost
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• The PoA of Scheduling Game with Machine Activation Costs
• Inefficiency of equilibria for scheduling game with machine activation costs
• Existence of Nash equilibria in scheduling game on limited machines with activation cost

Cites work

• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• Algorithms, games, and the internet
• 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
• New upper and lower bounds for online scheduling with machine cost
• ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Online scheduling with general machine cost functions
• Online scheduling with machine cost and rejection
• Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Preemptive online algorithms for scheduling with machine cost
• Scheduling with machine cost and rejection
• Semi-online scheduling with machine cost.
• The generalization of scheduling with machine cost
• Worst-case equilibria

Cited in

(16)

• 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
• Cost-sharing games in real-time scheduling systems
• The PoA of Scheduling Game with Machine Activation Costs
• Pareto-optimal algorithms for scheduling games on parallel-batching machines with activation cost
• Cost-sharing scheduling games on restricted unrelated machines
• The power of one evil secret agent
• An allocation game on two uniform machines with activation cost
• Inefficiency of equilibria for scheduling game with machine activation costs
• Cost-sharing scheduling games on restricted unrelated machines
• The power of one secret agent
• Efficiency analysis with respect to the unit cost objectives in scheduling games
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• Resource allocation games with multiple resource classes
• Cost-sharing games in real-time scheduling systems

This page was built for publication: Scheduling games on uniform machines with activation cost

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