Non-clairvoyant Scheduling Games
From MaRDI portal
Publication:3648849
DOI10.1007/978-3-642-04645-2_13zbMath1242.91035OpenAlexW3144488080MaRDI QIDQ3648849
Thang Nguyen Kim, Christoph Dürr
Publication date: 1 December 2009
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04645-2_13
Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Other game-theoretic models (91A40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Partition Equilibrium Always Exists in Resource Selection Games ⋮ Scheduling games with machine-dependent priority lists ⋮ Competitive routing over time ⋮ A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines ⋮ Decentralized utilitarian mechanisms for scheduling games
This page was built for publication: Non-clairvoyant Scheduling Games
