5 October 2012, Computational Social Choice Seminar, Mees de Vries and Ruben Brokkelkamp

Abstract

We consider generalized congestion games, a class of games in which players share a set of strategies and the payoff functions depend only on the chosen strategy and the number of players playing the same strategy, in such a way that fewer such players results in greater payoff. In these games we consider improvement paths. As shown by Milchtaich, such paths may be infinite. We consider paths in which the players deviate in a specific order, and prove that ordered best response improvement paths are finite, while ordered better response improvement paths may still be infinite.

For more information, see http://www.illc.uva.nl/~ulle/seminar/ or contact Ulle Endriss (ulle.endriss at uva.nl).