The max-distance network creation game on general host graphs
From MaRDI portal
Publication:2257298
DOI10.1016/j.tcs.2015.01.044zbMath1318.68125OpenAlexW2088729512MaRDI QIDQ2257298
Luciano Gualà, Davide Bilò, Guido Proietti, Stefano Leucci
Publication date: 24 February 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.044
Noncooperative games (91A10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Celebrity games ⋮ On the Tree Conjecture for the Network Creation Game ⋮ On tree equilibria in max-distance network creation games ⋮ On the tree conjecture for the network creation game ⋮ Distance-Uniform Graphs with Large Diameter
Cites Work
- Unnamed Item
- The price of anarchy in network creation games is (mostly) constant
- A strategic model of social and economic networks
- Basic Network Creation Games
- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games
- Tree Nash Equilibria in the Network Creation Game
- On a network creation game
- On Dynamics in Basic Network Creation Games
- The price of anarchy in network creation games
- Reducibility among Combinatorial Problems
- The Price of Anarchy in Cooperative Network Creation Games
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget