Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games

DOI10.1007/978-3-540-69355-0_17MaRDI QIDQ3511399zbMATH OpenOpenAlexFDO

Authors Konstantinos Kollias

Publication date 10 July 2008

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69355-0_17

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Nonpreemptive coordination mechanisms for identical machines
• A coordination mechanism for a scheduling game with parallel-batching machines
• Efficient coordination mechanisms for unrelated machine scheduling
• Efficient coordination mechanisms for unrelated machine scheduling
• Preemptive coordination mechanisms for unrelated machines

Cites work

• scientific article; zbMATH DE number 5764807 (Why is no real title available?)
• scientific article; zbMATH DE number 7005721 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• A course in game theory.
• Algorithmic Game Theory
• Algorithmic mechanism design
• Algorithms, games, and the internet
• Approximate equilibria and ball fusion
• How much can taxes help selfish routing?
• Mathematical Foundations of Computer Science 2004
• Non-cooperative games
• Stackelberg differential games in economic models
• Stackelberg scheduling strategies
• The price of selfish routing

Cited in

(10)

• A parallel machine schedule updating game with compensations and clients averse to uncertain loss
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Designing cost-sharing methods for Bayesian games
• Coordination mechanisms
• scientific article; zbMATH DE number 5307174 (Why is no real title available?)
• Nonpreemptive coordination mechanisms for identical machines
• Efficient coordination mechanisms for unrelated machine scheduling
• Preemptive coordination mechanisms for unrelated machines
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• Optimal Coordination Mechanisms for Multi-job Scheduling Games

This page was built for publication: Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games

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