Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions

• Authors: Adrian Vetta
• Venue: FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
• Year: 2002

We consider the following class of problems. The value of an outcome to a society is measured via a submodular utility function (submodularity has a natural economic interpretation: decreasing marginal utility). Decisions, however are controlled by non-cooperative agents who seek to maximise their own private utility. We present, under some basic assumptions, guarantees on the social performance of Nash equilibria. For submodular utility functions, any Nash equilibrium gives an expected social utility within a factor 2 of optimal, subject to a function-dependent additive term. For non-decreasing, submodular utility functions, any Nash equilibrium gives an expected social utility within a factor 1 + \deltaof optimal, where 0 \leqslant \delta\leqslant 1 is a number based upon the discrete curvature of the function. A condition under which all sets of social and private utility functions induce pure strategy Nash equilibria is presented. The case in which agents, themselves, make use of approximation algorithms in decision making is discussed and performance guarantees given. Finally we present some specific problems that fall into our framework. These include the competitive versions of the facility location problem and k-median problem, a maximisation version of the traffic routing problem studied by Roughgarden and Tardos [9], and multiple-item auctions.