Distributed algorithmic mechanism design for scheduling on unrelated machines
DOI10.1016/J.JPDC.2010.11.004zbMATH Open1219.68067OpenAlexW2091336995MaRDI QIDQ635328FDOQ635328
Authors: T. E. Carroll, D. 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
Recommendations
algorithmic mechanism designdistributed computationscheduling on unrelated machinestruthful mechanism
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Algorithmic Game Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to share a secret
- A course in game theory.
- Incentives in Teams
- Algorithmic mechanism design
- STACS 2004
- Title not available (Why is that?)
- STACS 2005
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Setting lower bounds on truthfulness (extended abstract)
- Truthful approximation schemes for single-parameter agents
- Sharing the cost of multicast transmissions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A BGP-based mechanism for lowest-cost routing
- Specification faithfulness in networks with rational nodes
- Title not available (Why is that?)
- A lower bound for scheduling mechanisms
- Algorithms – ESA 2005
- Title not available (Why is that?)
- Distributed algorithmic mechanism design for scheduling on unrelated machines
Cited In (3)
This page was built for publication: Distributed algorithmic mechanism design for scheduling on unrelated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635328)
