Decentralized throughput scheduling

DOI10.1007/978-3-642-38233-8_12MaRDI QIDQ4924644zbMATH OpenOpenAlexFDO

Authors Jasper de Jong, Marc Uetz, Andreas Wombacher

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/decentralized-throughput-scheduling(a5a7fc7f-3a02-4e4a-8ac3-15f427ab045e).html

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Noncooperative games (91A10)

Recommendations

• Decentralization and Mechanism Design for Online Machine Scheduling
• Coordination mechanisms for selfish scheduling
• Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
• The price of anarchy for utilitarian scheduling games on related machines
• Mechanism design for decentralized online machine scheduling

Cited in

(12)

• Sequential scheduling on identical machines
• The quality of equilibria for set packing and throughput scheduling games
• The sequential price of anarchy for affine congestion games with few players
• Decentralized utilitarian mechanisms for scheduling games
• A job scheduling game based on a folk algorithm
• Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game
• The curse of sequentiality in routing games
• Decentralized Regulation of a Queue
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Decentralized adaptive scheduling using consensus variables
• Tight bounds for the price of anarchy and stability in sequential transportation games

This page was built for publication: Decentralized throughput scheduling

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