Nonpreemptive coordination mechanisms for identical machines

DOI10.1007/s00224-012-9429-9zbMath1295.68049OpenAlexW2033773774MaRDI QIDQ372964

Konstantinos Kollias

Publication date: 21 October 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9429-9

zbMATH Keywords

game theoryNash equilibriumprice of anarchypure strategycoordination mechanismsmixed strategyselfish scheduling

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Optimal Cost-Sharing in General Resource Selection Games ⋮ Scheduling games with machine-dependent priority lists ⋮ Designing Networks with Good Equilibria under Uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg differential games in economic models
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Coordination mechanisms for selfish scheduling
• Approximate equilibria and ball fusion
• Potential games
• How much can taxes help selfish routing?
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• Selfish traffic allocation for server farms
• Tight Bounds for Selfish and Greedy Load Balancing
• Stackelberg scheduling strategies
• The price of selfish routing
• Algorithms, games, and the internet
• Mathematical Foundations of Computer Science 2004
• Automata, Languages and Programming
• Approximation and Online Algorithms
• Computing Nash equilibria for scheduling on restricted parallel links
• Algorithmic mechanism design
• Atomic resource sharing in noncooperative networks

This page was built for publication: Nonpreemptive coordination mechanisms for identical machines