Tomas Valla (Czech Technical University,Prague)
We design a new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs. This is in contrast to all previously studied covering games, where the price of anarchy grows linearly with the size of the game. Both the game design and the price of anarchy results are based on structural properties of the linear programming relaxations. For linear costs we also exhibit simple best-response dynamics that converge to Nash equilibria in linear time.