On Strong Equilibria and Improvement Dynamics in Network Creation Games
Tomasz Janus, Bart de Keijzer

TL;DR
This paper analyzes strong equilibria in network creation games, characterizing their structure for different edge costs, resolving conjectures about star equilibria, and examining the convergence of improvement dynamics.
Contribution
It provides a complete characterization of strong equilibria for all edge cost parameters and resolves a conjecture about star equilibria, also analyzing convergence properties of improvement dynamics.
Findings
Strong equilibria are characterized for all α in (0,2).
The conjecture that all star graphs are strong equilibria is confirmed.
Non-star trees can be strong equilibria for large α (≥ 2n).
Abstract
We study strong equilibria in network creation games. These form a classical and well-studied class of games where a set of players form a network by buying edges to their neighbors at a cost of a fixed parameter . The cost of a player is defined to be the cost of the bought edges plus the sum of distances to all the players in the resulting graph. We identify and characterize various structural properties of strong equilibria, which lead to a characterization of the set of strong equilibria for all in the range . For , Andelman et al. (2009) prove that a star graph in which every leaf buys one edge to the center node is a strong equilibrium, and conjecture that in fact any star is a strong equilibrium. We resolve this conjecture in the affirmative. Additionally, we show that when is large enough () there exist non-star trees that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
