Optimal Coordination Mechanisms for Unrelated Machine Scheduling
From MaRDI portal
Publication:3450455
DOI10.1287/opre.2015.1363zbMath1327.90065OpenAlexW1983361305MaRDI QIDQ3450455
No author found.
Publication date: 6 November 2015
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2015.1363
Noncooperative games (91A10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Scheduling games with rank-based utilities ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Colocating tasks in data centers using a side-effects performance model ⋮ Congestion games with priority-based scheduling ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost
Cites Work
- Non-clairvoyant scheduling games
- Approximation algorithms for scheduling unrelated parallel machines
- Stackelberg differential games in economic models
- Coordination mechanisms for selfish scheduling
- How much can taxes help selfish routing?
- Tradeoffs in worst-case equilibria
- Preemptive Coordination Mechanisms for Unrelated Machines
- A linear time approximation algorithm for multiprocessor scheduling
- Bounds for List Schedules on Uniform Processors
- Algorithms for Scheduling Tasks on Unrelated Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Stackelberg scheduling strategies
- Inner product spaces for MinSum coordination mechanisms
- Computing Nash equilibria for scheduling on restricted parallel links
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal Coordination Mechanisms for Unrelated Machine Scheduling
