Selfish creation of social networks

D Bilò, T Friedrich, P Lenzner, S Lowski… - Proceedings of the …, 2021 - ojs.aaai.org
Understanding real-world networks is a core research endeavor within the last two decades.
Network Creation Games are a promising approach for this from a game-theoretic …

Flow-based network creation games

H Echzell, T Friedrich, P Lenzner… - arxiv preprint arxiv …, 2020 - arxiv.org
Network Creation Games (NCGs) model the creation of decentralized communication
networks like the Internet. In such games strategic agents corresponding to network nodes …

The Impact of Cooperation in Bilateral Network Creation

T Friedrich, H Gawendowicz, P Lenzner… - Proceedings of the 2023 …, 2023 - dl.acm.org
Many real-world networks, like the Internet or social networks, are not the result of central
design but instead the outcome of the interaction of local agents that selfishly optimize their …

Social distancing network creation

T Friedrich, H Gawendowicz, P Lenzner… - Algorithmica, 2023 - Springer
During a pandemic people have to find a trade-off between meeting others and staying
safely at home. While meeting others is pleasant, it also increases the risk of infection. We …

An improved bound for the tree conjecture in network creation games

J Dippel, A Vetta - International Symposium on Algorithmic Game Theory, 2022 - Springer
We study Nash equilibria in the network creation game of Fabrikant et al.. In this game a
vertex can buy an edge to another vertex for a cost of α, and the objective of each vertex is to …

Efficiency and stability in euclidean network design

W Friedemann, T Friedrich, H Gawendowicz… - Proceedings of the 33rd …, 2021 - dl.acm.org
Network Design problems typically ask for a minimum cost sub-network from a given host
network. This classical point-of-view assumes a central authority enforcing the optimum …

The diameter of sum basic equilibria games

A Abiad, C Àlvarez, A Messegué - Theoretical Computer Science, 2024 - Elsevier
We study the sum basic network creation game introduced in 2010 by Alon, Demaine,
Hajiaghai and Leighton. In this game, an undirected and unweighted graph G is said to be a …

On tree equilibria in max-distance network creation games

Q Wang - International Symposium on Algorithmic Game Theory, 2022 - Springer
We study the Nash equilibrium and the price of anarchy in the max-distance network
creation game. The network creation game, first introduced and studied by Fabrikant et al., is …

Fair tree connection games with topology-dependent edge cost

D Bilò, T Friedrich, P Lenzner, A Melnichenko… - arxiv preprint arxiv …, 2020 - arxiv.org
How do rational agents self-organize when trying to connect to a common target? We study
this question with a simple tree formation game which is related to the well-known fair single …

Network creation games with traceroute-based strategies

D Bilò, L Gualà, S Leucci, G Proietti - Algorithms, 2021 - mdpi.com
Network creation games have been extensively used as mathematical models to capture the
key aspects of the decentralized process that leads to the formation of interconnected …