Multistage interval scheduling games
From MaRDI portal
Publication:2283299
Recommendations
Cites work
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- A class of games possessing pure-strategy Nash equilibria
- Algorithmic Game Theory
- Algorithms – ESA 2005
- Automata, Languages and Programming
- Bounding the Power of Preemption in Randomized Scheduling
- Competitive algorithms for multistage online scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling on identical machines
- Interval scheduling: A survey
- Non-clairvoyant scheduling games
- Non-cooperative games
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- On-line scheduling of jobs with fixed start and end times
- Potential games
- STACS 2004
- STACS 2005
- Scheduling algorithms
- Scheduling jobs with fixed start and end times
- Scheduling selfish jobs on multidimensional parallel machines
- Strong price of anarchy
- The price of anarchy on uniformly related machines revisited
- Tight bounds for worst-case equilibria
- Worst-case equilibria
Cited in
(4)
This page was built for publication: Multistage interval scheduling games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283299)