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 …

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 …

We study the price of stability in undirected network design games with fair cost sharing. Our
work provides multiple new pieces of evidence that the true price of stability, at least for …

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 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 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− Θ …

In the network design game with n players, every player chooses a path in an edge-
weighted graph to connect her pair of terminals, sharing costs of the edges on her path with …

In this paper 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^21+k^3(k+1)/2-k^2H_k =\bigl(1 …

In this dissertation, we study algorithmic problems motivated by the optimization of networks
under uncertainty. We summarize our contributions:• We propose and give algorithms for the …

In the network design game with n players, every player chooses a path in an edge-
weighted graph to connect her pair of terminals, sharing costs of the edges on her path with …