Multistage interval scheduling games

DOI10.1007/s10951-018-0568-yzbMath1427.90144OpenAlexW2804692481WikidataQ129807429 ScholiaQ129807429MaRDI QIDQ2283299

Clemens Thielen, Arne Herzel, Michael Hopf

Publication date: 30 December 2019

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0568-y

zbMATH Keywords

Nash equilibriaprice of anarchyprice of stabilityscheduling gamesmultistage scheduling

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The price of anarchy on uniformly related machines revisited
• Non-clairvoyant scheduling games
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Scheduling jobs with fixed start and end times
• On-line scheduling of jobs with fixed start and end times
• Competitive algorithms for multistage online scheduling
• Note on scheduling intervals on-line
• Potential games
• On the \(k\)-coloring of intervals
• Scheduling selfish jobs on multidimensional parallel machines
• A class of games possessing pure-strategy Nash equilibria
• Interval scheduling on identical machines
• Non-cooperative games
• Tight bounds for worst-case equilibria
• Interval scheduling: A survey
• A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
• Bounding the Power of Preemption in Randomized Scheduling
• STACS 2004
• Algorithmic Game Theory
• Automata, Languages and Programming
• Algorithms – ESA 2005
• STACS 2005