On the Performances of Nash Equilibria in Isolation Games

: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, and also evolve due to selfish behavior of the users and owners. In light of these competing forces, it is surprising how efficient these networks are. It is an exciting challenge to understand the operation and success of these networks in game theoretic terms: what principles of interaction lead selfish participants to form such efficient networks? We will focus on congestion games, and study the degradation of quality of solution caused by the selfish behavior of users. We model users as learning algorithms, and show that natural learning behavior can avoid bad outcomes predicted by the price of anarchy in atomic congestion games such as the load balancing game. We use tools from the theory of dynamical systems and algebraic geometry to show when players use a class of natural learning algorithms the distri...

• Type: Conference
• Year: 2009
• Where: COCOON
• Authors: Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
• Keywords: COCOON 2009, Combinatorics, Congestion Games, Selfish Behavior, Stable Equilibria