The Price of Anarchy in Network Creation Games Is (Mostly) Constant

Matús Mihalák, Jan Christoph Schlegel

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is a>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is a times the number of built edges. In the sumgame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the maxgame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of a, and give new insights into the structure of equilibria for various values of a. The two main results of the paper show that for a>273·n all equilibria in sumgame are trees and thus the price of anarchy is constant, and that for a>129 all equilibria in maxgame are trees and the price of anarchy is constant. For sumgame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of a?—in an affirmative way, up to a tiny range of a.
Original languageEnglish
Pages (from-to)53-72
Number of pages20
JournalTheory of Computing Systems
Volume53
Issue number1
DOIs
Publication statusPublished - 2013

Cite this

@article{1df23061252247858ee6391c96a5f4f0,
title = "The Price of Anarchy in Network Creation Games Is (Mostly) Constant",
abstract = "We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is a>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is a times the number of built edges. In the sumgame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the maxgame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of a, and give new insights into the structure of equilibria for various values of a. The two main results of the paper show that for a>273·n all equilibria in sumgame are trees and thus the price of anarchy is constant, and that for a>129 all equilibria in maxgame are trees and the price of anarchy is constant. For sumgame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of a?—in an affirmative way, up to a tiny range of a.",
author = "Mat{\'u}s Mihal{\'a}k and Schlegel, {Jan Christoph}",
year = "2013",
doi = "10.1007/s00224-013-9459-y",
language = "English",
volume = "53",
pages = "53--72",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer Verlag",
number = "1",

}

The Price of Anarchy in Network Creation Games Is (Mostly) Constant. / Mihalák, Matús; Schlegel, Jan Christoph.

In: Theory of Computing Systems, Vol. 53, No. 1, 2013, p. 53-72.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - The Price of Anarchy in Network Creation Games Is (Mostly) Constant

AU - Mihalák, Matús

AU - Schlegel, Jan Christoph

PY - 2013

Y1 - 2013

N2 - We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is a>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is a times the number of built edges. In the sumgame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the maxgame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of a, and give new insights into the structure of equilibria for various values of a. The two main results of the paper show that for a>273·n all equilibria in sumgame are trees and thus the price of anarchy is constant, and that for a>129 all equilibria in maxgame are trees and the price of anarchy is constant. For sumgame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of a?—in an affirmative way, up to a tiny range of a.

AB - We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is a>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is a times the number of built edges. In the sumgame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the maxgame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of a, and give new insights into the structure of equilibria for various values of a. The two main results of the paper show that for a>273·n all equilibria in sumgame are trees and thus the price of anarchy is constant, and that for a>129 all equilibria in maxgame are trees and the price of anarchy is constant. For sumgame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of a?—in an affirmative way, up to a tiny range of a.

U2 - 10.1007/s00224-013-9459-y

DO - 10.1007/s00224-013-9459-y

M3 - Article

VL - 53

SP - 53

EP - 72

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 1

ER -