3 papers
cs.GT2009
A deterministic truthful PTAS for scheduling related machines
George Christodoulou, Annamaria Kovacs
Scheduling on related machines () is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and…
cs.GT2008
A characterization of 2-player mechanisms for scheduling
George Christodoulou, Elias Koutsoupias, Angelina Vidali
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 both…
cs.GT2008
On the performance of approximate equilibria in congestion games
George Christodoulou, Elias Koutsoupias, Paul Spirakis
We study the performance of approximate Nash equilibria for linear congestion games. We consider how much the price of anarchy worsens and how much the price of stability improves…