In this paper we consider the influence of link restrictions on the price of anarchy for several social cost functions in the following model of selfish routing. Each of n players in a network game seeks to send a message with a certain length by choosing one of m parallel links. Each player is restricted to transmit over a certain subset of links and desires to minimize his own transmission-ti...

In a discrete preference game, each agent is equipped with an internal belief and declares her preference from a discrete set of alternatives. The payoff of an agent depends on whether the declared preference agrees with the belief of the agent and on the coordination with the preferences declared by the neighbors of the agent in the underlying social network. These games have been used to mode...

Network creation games have been studied in many different settings recently. These games are motivated by social networks in which selfish agents want to construct a connection graph among themselves. Each node wants to minimize its average or maximum distance to the others, without paying much to construct the network. Many generalizations have been considered, including non-uniform interests...

This paper argues that the independent record scene that developed out of punk rock in the late 1970s and early 1980s embodied anarchist principles, even though few of those involved would have called themselves anarchists. Advocates of independent records resisted the control of the mainstream music industry and in some cases actively sought to subvert it. They allied punk’s ‘access aesthetic’...

We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i’s perceived cost is a convex combination of 1 − αi times his direct cost and αi times the social cost. Tuning the parameters αi allows smooth interpolation between purely selfish and purely altruistic behavior. Within this framework...

We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i’s perceived cost is a convex combination of 1−βi times his direct cost and βi times the social cost. Tuning the parameters βi allows smooth interpolation between purely selfish and purely altruistic behavior. Within this framework, ...

A major point of dispute among libertarian theorists and thinkers today as always revolves around the age-old question of whether man can live in total anarchy or whether the minimal state is absolutely necessary for the maximization of freedom. Lost in this dispute is the question of whether man is capable of getting out of anarchy at all. Can we really abolish anarchy and set up a Government ...

We introduce a new class of games, called social contribution games (SCGs), where each player’s individual cost is equal to the cost he induces on society because of his presence. Our results reveal that SCGs constitute useful abstractions of altruistic games when it comes to the analysis of the robust price of anarchy. We first show that SCGs are altruism-independently smooth, i.e., the robust...

We introduce (super) polynomial bottleneck games, where the utility costs of the players are (super) polynomial functions of the congestion of the resources that they use, and the social cost is determined by the worst congestion of any resource. In particular, the delay function for any resource r is of the form CMr r , where Cr is the congestion measured as the number of players that use r, a...

We study bottleneck routing games where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player utility costs determined by the worst congested edge in their paths. However, the Nash equilibria of such games are inefficient since the price of anarchy can be very high and proportional to the size of the network. In order...