Interval scheduling games

DOI10.1007/978-3-032-12915-4_8MaRDI QIDQ7325734zbMATH OpenFDO

Authors Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir

Publication date 8 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12915-4_8

Mathematics Subject Classification ID

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

Cites work

• A model for minimizing active processor time
• Approximation techniques for utilitarian mechanism design
• Batching identical jobs
• Broadcast scheduling, algorithms and complexity
• Congestion games with priority-based scheduling
• Cost-sharing games in real-time scheduling systems
• Decentralized utilitarian mechanisms for scheduling games
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Interval scheduling on identical machines
• Interval scheduling: A survey
• Multistage interval scheduling games
• Non-clairvoyant scheduling games
• Note on scheduling intervals on-line
• On the \(k\)-coloring of intervals
• Reducibility among combinatorial problems
• Scheduling games with machine-dependent priority lists
• Scheduling jobs with fixed start and end times
• Selfish bin packing
• Tight bounds for worst-case equilibria
• Truthful approximation mechanisms for restricted combinatorial auctions
• Worst-case equilibria

This page was built for publication: Interval scheduling games

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