1 July 2010, C&O Seminar, Tobias Harks (TU Berlin, Germany)

We provide an axiomatic framework for the the well studied lexicographical improvement property and derive new results on the existence of strong Nash equilibria for a very general class of congestion games with bottleneck objectives. This includes extensions of classical load-based models, routing games with splittable demands, scheduling games with malleable jobs, and more. Furthermore, we discuss the computational complexity of computing pure Nash and strong equilibria in these games.

For more information, see k.r.apt at cwi.nl