Fairness and optimality in congestion games

We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general problem is hard to approximate to any factor, we give simple algorithms for natural simplifications. We also consider these problems in the symmetric network congestion game model [11, 4], and show hardness results and approximate solutions. Categories and Subject Descriptors F.2.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms Theory Keywords Fairness, Congestion games, Nash equilibrium

• Type: Conference
• Year: 2005
• Where: SIGECOM
• Authors: Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan
• Keywords: Congestion Game Model, SIGECOM 2005, Symmetric Network Congestion, Terms Theory Keywords