**Reference**:- Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, and Morteza Zadimoghaddam, “The Price of Anarchy in Cooperative Network Creation Games”, in
*Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)*, Freiburg, Germany, February 26–28, 2009, pages 301–312. **Abstract**:-
We analyze the structure of equilibria and the price of anarchy in the family
of network creation games considered extensively in the past few years, which
attempt to unify the network design and network routing problems by modeling
both creation and usage costs. In general, the games are played on a host
graph, where each node is a selfish independent agent (player) and each edge
has a fixed link creation cost α. Together the agents create a
network (a subgraph of the host graph) while selfishly minimizing the link
creation costs plus the sum of the distances to all other players (usage
cost). In this paper, we pursue two important facets of the network
creation game.
First, we study extensively a natural version of the game, called the cooperative model, where nodes can collaborate and share the cost of creating any edge in the host graph. We prove the first nontrivial bounds in this model, establishing that the price of anarchy is polylogarithmic in

*n*for all values of α in complete host graphs. This bound is the first result of this type for any version of the network creation game; most previous general upper bounds are polynomial in*n*. Interestingly, we also show that equilibrium graphs have polylogarithmic diameter for the most natural range of α (at most*n*polylg*n*).Second, we study the impact of the natural assumption that the host graph is a general graph, not necessarily complete. This model is a simple example of nonuniform creation costs among the edges (effectively allowing weights of α and ∞). We prove the first assemblage of upper and lower bounds for this context, establishing nontrivial tight bounds for many ranges of α, for both the unilateral and cooperative versions of network creation. In particular, we establish polynomial lower bounds for both versions and many ranges of α, even for this simple nonuniform cost model, which sharply contrasts the conjectured constant bounds for these games in complete (uniform) graphs.

**Copyright**:- Copyright held by the authors. Licensed under the Creative Commons Attribution-No Derivative Works 3.0 license.
**Availability**:- The paper is available in PostScript (1697k), gzipped PostScript (241k), and PDF (305k).
- See information on file formats.
- [Google Scholar search]
**Related papers**:- CooperativeNetworkCreation_SIGecom (The Price of Anarchy in Cooperative Network Creation Games)
- BasicNetworkCreation_SIDMA (Basic Network Creation Games)
- NetworkCreation_TALG (The Price of Anarchy in Network Creation Games)

See also other papers by Erik Demaine.

Last updated September 13, 2019 by Erik Demaine.