Decentralized Throughput Scheduling

DOI10.1007/978-3-642-38233-8_12zbMath1384.90052OpenAlexW2152721755MaRDI QIDQ4924644

Andreas Wombacher, Marc Uetz, Jasper de Jong

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

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

Related Items (6)

The Curse of Sequentiality in Routing Games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Sequential scheduling on identical machines ⋮ The sequential price of anarchy for affine congestion games with few players

This page was built for publication: Decentralized Throughput Scheduling