Selfish network creation with non-uniform edge cost
From MaRDI portal
Publication:681862
DOI10.1007/978-3-319-66700-3_13zbMath1403.91062arXiv1706.10200OpenAlexW2963550995MaRDI QIDQ681862
Anna Melnichenko, Ankit Chauhan, Louise Molitor, Pascal Lenzner
Publication date: 13 February 2018
Full work available at URL: https://arxiv.org/abs/1706.10200
social networksnetwork creation gamescomplexity of computing, constant price of anarchynon-uniform edge cost
Social networks; opinion dynamics (91D30) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
On the Tree Conjecture for the Network Creation Game ⋮ Best-response dynamics, playing sequences, and convergence to equilibrium in random games ⋮ An improved bound for the tree conjecture in network creation games ⋮ On tree equilibria in max-distance network creation games ⋮ Geometric Network Creation Games ⋮ The Impact of Cooperation in Bilateral Network Creation ⋮ On the tree conjecture for the network creation game ⋮ Geometric spanner games
This page was built for publication: Selfish network creation with non-uniform edge cost
