Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games

DOI10.1007/978-3-540-69355-0_17zbMath1143.68343OpenAlexW1504525980MaRDI QIDQ3511399

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)

Related Items (3)

Coordination mechanisms ⋮ Designing cost-sharing methods for Bayesian games ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg differential games in economic models
• Approximate equilibria and ball fusion
• How much can taxes help selfish routing?
• Non-cooperative games
• Stackelberg scheduling strategies
• The price of selfish routing
• Algorithms, games, and the internet
• Mathematical Foundations of Computer Science 2004
• Algorithmic Game Theory
• Algorithmic mechanism design

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