On the poa conjecture: Trees versus biconnected components
In the classical model of network creation games introduced by Fabrikant et al.[On a network
creation game, in Proceedings of the Twenty-Second Annual Symposium on Principles of …
creation game, in Proceedings of the Twenty-Second Annual Symposium on Principles of …
On the price of anarchy for high-price links
C Àlvarez, A Messegué - International Conference on Web and Internet …, 2019 - Springer
We study Nash equilibria and the price of anarchy in the classic model of Network Creation
Games introduced by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker in 2003. This …
Games introduced by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker in 2003. This …
Network creation games: Structure vs anarchy
C Àlvarez, A Messegué - arXiv preprint arXiv:1706.09132, 2017 - arxiv.org
We study Nash equilibria and the price of anarchy in the classical model of Network
Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at …
Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at …
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 …
Hajiaghai and Leighton. In this game, an undirected and unweighted graph G is said to be a …
Network creation games: structure vs anarchy
A Messegué Buisan - 2020 - upcommons.upc.edu
In an attempt to understand how Internet-like network and social networks behave, different
models have been proposed and studied throughout history to capture their most essential …
models have been proposed and studied throughout history to capture their most essential …
The Diameter of Sum Basic Equilibria Games 1
A MESSEGUE BUISAN, A Abiad, C Alvarez - Aida and Alvarez, Carme … - papers.ssrn.com
A graph G of order n is said to be a sum basic equilibrium if and only if for every edge uv
from G and any node v′ from G, when performing the swap of the edge uv for the edge …
from G and any node v′ from G, when performing the swap of the edge uv for the edge …
On Bipartite Sum Basic Equilibria
C Àlvarez, A Messegué - Extended Abstracts EuroComb 2021: European …, 2021 - Springer
A connected and undirected graph G of size n ≥ 1 n≥ 1 is said to be a sum basic
equilibrium iff for every edge uv from G and any node v'v′ from G, when performing the …
equilibrium iff for every edge uv from G and any node v'v′ from G, when performing the …
New Insights into the Structure of Equilibria for the Network Creation Game
C Àlvarez, A Messegué - arXiv preprint arXiv:2012.14254, 2020 - arxiv.org
We study the sum classic network creation game introduced by Fabrikant et al. in which $ n
$ players conform a network buying links at individual price $\alpha $. When studying this …
$ players conform a network buying links at individual price $\alpha $. When studying this …
Network creation games: structure vs anarchy
M Álvarez Faura, A Messegué Buisan - 2017 - upcommons.upc.edu
We study Nash equilibria and the price of anarchy in the classical model of Network
Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at …
Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at …
[PDF][PDF] Results in Ramsey Theory and Probabilistic Combinatorics
M Lavrov - 2017 - kilthub.cmu.edu
We begin by considering several questions related to the Hales–Jewett Theorem, a central
result in the study of Ramsey theory. We use bounds due to Shelah [46] to attack a …
result in the study of Ramsey theory. We use bounds due to Shelah [46] to attack a …