Scheduling games on uniform machines with activation cost

DOI10.1016/J.TCS.2015.02.023zbMATH Open1311.91009OpenAlexW2020564175MaRDI QIDQ2344765FDOQ2344765

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

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

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)

Cites Work

• Worst-case equilibria
• Scheduling with machine cost and rejection
• Better Online Algorithms for Scheduling with Machine Cost
• Title not available (Why is that?)
• Efficiency analysis of load balancing games with and without activation costs
• Conflicting congestion effects in resource allocation games
• Algorithms, games, and the internet
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Online scheduling with general machine cost functions
• Preemptive online algorithms for scheduling with machine cost
• Online scheduling with machine cost and rejection
• The generalization of scheduling with machine cost
• New upper and lower bounds for online scheduling with machine cost
• Semi-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
• Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost

Cited In (17)

• Improved price of anarchy for machine scheduling games with coordination mechanisms
• An allocation game on two uniform machines with activation cost
• Pareto-optimal algorithms for scheduling games on parallel-batching machines with activation cost
• Resource allocation games with multiple resource classes
• 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
• Inefficiency of equilibria for scheduling game with machine activation costs
• Existence of Nash equilibria in scheduling game on limited machines with activation cost
• Cost-sharing games in real-time scheduling systems
• Cost-sharing scheduling games on restricted unrelated machines
• Cost-sharing games in real-time scheduling systems
• Scheduling games with machine-dependent priority lists
• The PoA of Scheduling Game with Machine Activation Costs
• The power of one evil secret agent
• The power of one secret agent

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)