scispace - formally typeset
Search or ask a question

Showing papers by "Guido Schäfer published in 2012"


Book ChapterDOI
10 Sep 2012
TL;DR: This work considers a variant of congestion games where every player i expresses for each resource e and player j a positive externality, i.e., a value for being on e together with player j, and derives a 2-approximation algorithm by rounding an optimal solution of a natural LP formulation of the problem.
Abstract: We consider a variant of congestion games where every player i expresses for each resource e and player j a positive externality, i.e., a value for being on e together with player j. Rather than adopting a game-theoretic perspective, we take an optimization point of view and consider the problem of optimizing the social welfare. We show that this problem is NP-hard even for very special cases, notably also for the case where the players' utility functions for each resource are affine (contrasting with the tractable case of linear functions [3]). We derive a 2-approximation algorithm by rounding an optimal solution of a natural LP formulation of the problem. Our rounding procedure is sophisticated because it needs to take care of the dependencies between the players resulting from the pairwise externalities. We also show that this is essentially best possible by showing that the integrality gap of the LP is close to 2. Small adaptations of our rounding approach enable us to derive approximation algorithms for several generalizations of the problem. Most notably, we obtain an (r+1)-approximation when every player may express for each resource externalities on player sets of size r. Further, we derive a 2-approximation when the strategy sets of the players are restricted and a $\frac32$-approximation when these sets are of size 2.

8 citations


Book ChapterDOI
22 Oct 2012
TL;DR: The analysis of the selfishness level of several well-known strategic games reveals that it often provides more refined insights into the game than other measures of inefficiency, such as the price of stability or theprice of anarchy.
Abstract: We introduce a new measure of the discrepancy in strategic games between the social welfare in a Nash equilibrium and in a social optimum, that we call selfishness level. It is the smallest fraction of the social welfare that needs to be offered to each player to achieve that a social optimum is realized in a pure Nash equilibrium. The selfishness level is unrelated to the price of stability and the price of anarchy and in contrast to these notions is invariant under positive linear transformations of the payoff functions. Also, it naturally applies to other solution concepts and other forms of games. We study the selfishness level of several well-known strategic games. This allows us to quantify the implicit tension within a game between players' individual interests and the impact of their decisions on the society as a whole. Our analysis reveals that the selfishness level often provides more refined insights into the game than other measures of inefficiency, such as the price of stability or the price of anarchy.

4 citations