A central goal in algorithmic game theory is to analyze the performance of decentralized
multiagent systems, like communication and information networks. In the absence of a …

We consider broadcast network design games in undirected networks in which every player
is a node wishing to receive communication from a distinguished source node s and the cost …

The price of anarchy (PoA) in congestion games has attracted a lot of research over the past
decade. This has resulted in a thorough understanding of this concept. In contrast, the price …

We give exponential lower bounds on the Price of Stability (PoS) of weighted congestion
games with polynomial cost functions. In particular, for any positive integer d we construct …

We consider network cost-sharing games with nonanonymous cost functions, where the cost
of each edge is a submodular function of its users, and this cost is shared using the Shapley …

One of the most appealing aspects of correlated equilibria and coarse correlated equilibria
is that natural dynamics quickly arrive at approximations of such equilibria, even in games …

We consider the problem of designing network cost-sharing protocols with good equilibria
under uncertainty. The underlying game is a multicast game in a rooted undirected graph …

In multicast network design games, a set of agents choose paths from their source locations
to a common sink with the goal of minimizing their individual costs, where the cost of an …

In this paper we study the network design game when the underlying network is a ring. In a
network design game we have a set of players, each of them aims at connecting nodes in a …

In this article we show that the price of stability of Shapley network design games on
undirected graphs with k players is at most k 3 (k+ 1)/2− k 2 1+ k 3 (k+ 1)/2− k 2 H k=(1− Θ …