Sciweavers

13 search results - page 2 / 3
» An Improved Randomized Truthful Mechanism for Scheduling Unr...
Sort
View
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
13 years 8 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
STACS
2004
Springer
13 years 11 months ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
WINE
2009
Springer
178views Economy» more  WINE 2009»
14 years 25 days ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 8 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 7 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis