An Improved Bound for the Tree Conjecture in Network Creation Games

by   Jack Dippel, et al.

We study Nash equilibria in the network creation game of Fabrikant et al.[10]. In this game a vertex can buy an edge to another vertex for a cost of α, and the objective of each vertex is to minimize the sum of the costs of the edges it purchases plus the sum of the distances to every other vertex in the resultant network. A long-standing conjecture states that if α≥ n then every Nash equilibrium in the game is a spanning tree. We prove the conjecture holds for any α>3n-3.


page 1

page 2

page 3

page 4


On Tree Equilibria in Max-Distance Network Creation Games

We study the Nash equilibrium and the price of anarchy in the max-distan...

On Strong Equilibria and Improvement Dynamics in Network Creation Games

We study strong equilibria in network creation games. These form a class...

On the Constant Price of Anarchy Conjecture

We study Nash equilibria and the price of anarchy in the classic model o...

Metric dimension on sparse graphs and its applications to zero forcing sets

The metric dimension dim(G) of a graph G is the minimum cardinality of a...

Resolution to Sutner's Conjecture

Consider a game played on a simple graph G = (V,E) where each vertex con...

New Insights into the Structure of Equilibria for the Network Creation Game

We study the sum classic network creation game introduced by Fabrikant e...

An Upper Bound on the GKS Game via Max Bipartite Matching

The sensitivity conjecture is a longstanding conjecture concerning the r...

Please sign up or login with your details

Forgot password? Click here to reset