On the price of anarchy of two-stage machine scheduling games
From MaRDI portal
Publication:2051911
DOI10.1007/s10878-019-00474-2zbMath1481.90192OpenAlexW2983111355WikidataQ126842980 ScholiaQ126842980MaRDI QIDQ2051911
Deshi Ye, Lin Chen, Guo-Chuan Zhang
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00474-2
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)
Related Items
Coordination mechanisms for scheduling games with machine modification ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Maximizing the minimum load: the cost of selfishness
- The price of anarchy on uniformly related machines revisited
- Non-clairvoyant scheduling games
- Inefficiency of equilibria for the machine covering game on uniform machines
- Coordination mechanisms for selfish scheduling
- Bounding the inefficiency of equilibria in nonatomic congestion games
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- The Price of Anarchy for Minsum Related Machine Scheduling
- On a network creation game
- A linear time approximation algorithm for multiprocessor scheduling
- Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines
- How bad is selfish routing?
- Scheduling Independent Tasks on Uniform Processors
- Inefficiency of Nash Equilibria
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- The price of anarchy in large games
- Inner product spaces for MinSum coordination mechanisms
- Algorithmic Game Theory
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
