Distributed algorithmic mechanism design for scheduling on unrelated machines
From MaRDI portal
Publication:635328
Recommendations
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1962741 (Why is no real title available?)
- scientific article; zbMATH DE number 2156280 (Why is no real title available?)
- scientific article; zbMATH DE number 2088333 (Why is no real title available?)
- scientific article; zbMATH DE number 2119764 (Why is no real title available?)
- scientific article; zbMATH DE number 6297764 (Why is no real title available?)
- A BGP-based mechanism for lowest-cost routing
- A course in game theory.
- A lower bound for scheduling mechanisms
- Algorithmic Game Theory
- Algorithmic mechanism design
- Algorithms – ESA 2005
- Distributed algorithmic mechanism design for scheduling on unrelated machines
- How to share a secret
- Incentives in Teams
- STACS 2004
- STACS 2005
- Setting lower bounds on truthfulness (extended abstract)
- Sharing the cost of multicast transmissions
- Specification faithfulness in networks with rational nodes
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Truthful approximation schemes for single-parameter agents
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)