Distributed algorithmic mechanism design for scheduling on unrelated machines

DOI10.1016/j.jpdc.2010.11.004zbMath1219.68067MaRDI QIDQ635328

Thomas E. Carroll, Daniel Grosu

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.11.004

zbMATH Keywords

algorithmic mechanism design; distributed computation; scheduling on unrelated machines; truthful mechanism

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68M14: Distributed systems

Related Items

Distributed algorithmic mechanism design for scheduling on unrelated machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed algorithmic mechanism design for scheduling on unrelated machines
• Truthful algorithms for scheduling selfish tasks on parallel machines
• A lower bound for scheduling mechanisms
• How to share a secret
• Truthful Approximation Schemes for Single-Parameter Agents
• Incentives in Teams
• A BGP-based mechanism for lowest-cost routing
• STACS 2004
• Algorithmic Game Theory
• Algorithms – ESA 2005
• Specification faithfulness in networks with rational nodes
• STACS 2005
• Algorithmic mechanism design
• Sharing the cost of multicast transmissions