Nonpreemptive coordination mechanisms for identical machines

DOI10.1007/S00224-012-9429-9MaRDI QIDQ372964zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• Preemptive coordination mechanisms for unrelated machines
• Efficient coordination mechanisms for unrelated machine scheduling
• Efficient coordination mechanisms for unrelated machine scheduling
• Optimal coordination mechanisms for unrelated machine scheduling
• Coordination mechanisms for parallel machine scheduling
• Coordinated static control of asynchronous sequential machines
• Nonpreemptive scheduling of arbitrary machines

Cites work

• scientific article; zbMATH DE number 5343724 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• A course in game theory.
• Algorithmic mechanism design
• Algorithms, games, and the internet
• Approximate equilibria and ball fusion
• Approximation and Online Algorithms
• Atomic resource sharing in noncooperative networks
• Automata, Languages and Programming
• Computing Nash equilibria for scheduling on restricted parallel links
• Coordination mechanisms for selfish scheduling
• How bad is selfish routing?
• How much can taxes help selfish routing?
• Mathematical Foundations of Computer Science 2004
• Potential games
• Selfish load balancing
• Selfish traffic allocation for server farms
• Stackelberg differential games in economic models
• Stackelberg scheduling strategies
• The price of selfish routing
• Tight Bounds for Selfish and Greedy Load Balancing
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Worst-case equilibria

Cited in

(7)

• Non-clairvoyant scheduling games
• Designing networks with good equilibria under uncertainty
• Optimal cost-sharing in general resource selection games
• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• Non-clairvoyant scheduling games
• Inefficiency of Nash equilibria with parallel processing policy
• Preemptive coordination mechanisms for unrelated machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372964)