Nonpreemptive coordination mechanisms for identical machines
DOI10.1007/S00224-012-9429-9zbMATH Open1295.68049OpenAlexW2033773774MaRDI QIDQ372964FDOQ372964
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
Recommendations
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- Preemptive coordination mechanisms for unrelated machines
- An almost ideal coordination mechanism for unrelated machine scheduling
- An almost ideal coordination mechanism for unrelated machine scheduling
- 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
game theoryNash equilibriumprice of anarchypure strategycoordination mechanismsmixed strategyselfish scheduling
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)
Cites Work
- How much can taxes help selfish routing?
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Potential games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate equilibria and ball fusion
- Selfish load balancing
- Tight Bounds for Selfish and Greedy Load Balancing
- Algorithmic mechanism design
- Coordination mechanisms for selfish scheduling
- Title not available (Why is that?)
- Algorithms, games, and the internet
- Atomic resource sharing in noncooperative networks
- Stackelberg differential games in economic models
- Selfish traffic allocation for server farms
- Title not available (Why is that?)
- Stackelberg scheduling strategies
- The price of selfish routing
- Mathematical Foundations of Computer Science 2004
- Automata, Languages and Programming
- Approximation and Online Algorithms
- Computing Nash equilibria for scheduling on restricted parallel links
- Truthful algorithms for scheduling selfish tasks on parallel machines
Cited In (5)
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)
