Giorgos Christodoulou

Learn More
We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou’s network. We improve upon the value 4/3 by means of Coordination Mechanisms. We increase the latency functions of(More)
Acknowledgements First and foremost, I would like to thank my advisor, Noam Nisan, for his guidance, for introducing me to many of the topics discussed in this thesis, for his openness to new ideas, for being ever-willing to explore new and uncharted territories, for his care and devotion, and, in general, for being the best advisor I could hope for. I(More)
  • 1