Scheduling selfish jobs on multidimensional parallel machines

DOI10.1016/j.tcs.2017.06.018zbMath1373.90055OpenAlexW2727916703MaRDI QIDQ2404079

Leah Epstein, Elena Kleiman

Publication date: 12 September 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.018

zbMATH Keywords

load balancingidentical machinesprice of anarchyselfish agentsvector scheduling

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Multistage interval scheduling games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selfish bin packing
• The price of selfish routing
• Strong price of anarchy
• Coordination mechanisms for selfish scheduling
• Resource constrained scheduling as generalized bin packing
• Strong equilibrium in congestion games
• Approximate equilibria and ball fusion
• Strong equilibria in games with the lexicographical improvement property
• Tradeoffs in worst-case equilibria
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
• The Price of Stability for Network Design with Fair Cost Allocation
• Selfish Vector Packing
• Pareto Optimality
• Convergence time to Nash equilibrium in load balancing
• Strong and Pareto Price of Anarchy in Congestion Games
• Inefficiency of Nash Equilibria
• Multidimensional Bin Packing Algorithms
• On Multidimensional Packing Problems
• Strong Price of Anarchy for Machine Load Balancing

This page was built for publication: Scheduling selfish jobs on multidimensional parallel machines