An almost ideal coordination mechanism for unrelated machine scheduling

DOI10.1007/s00224-018-9857-2zbMath1411.90108arXiv1605.04674OpenAlexW2790616850WikidataQ130167135 ScholiaQ130167135MaRDI QIDQ1733383

Angelo Fanelli, Ioannis Caragiannis

Publication date: 21 March 2019

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

Full work available at URL: https://arxiv.org/abs/1605.04674

zbMATH Keywords

machine schedulingschedulingunrelated machinesprice of anarchypotential gamesprice of stabilitycoordination mechanismcoordination mechanisms

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

Congestion games with priority-based scheduling ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Coordination mechanisms
• Coordination mechanisms for selfish scheduling
• Efficient coordination mechanisms for unrelated machine scheduling
• Decentralized utilitarian mechanisms for scheduling games
• Preemptive Coordination Mechanisms for Unrelated Machines
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Coordination mechanisms from (almost) all scheduling policies
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
• Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling

This page was built for publication: An almost ideal coordination mechanism for unrelated machine scheduling