Browsing by Author "Messegué Buisan, Arnau"
Now showing items 1-11 of 11
-
Celebrity games
(2016-10-04)
Article
Open AccessWe introduce Celebrity games, a new model of network creation games. In this model players have weights (W being the sum of all the player's weights) and there is a critical distance ß as well as a link cost a. The cost ... -
Distance-uniform graphs with large diameter
(2019-06-01)
Article
Open AccessAn ϵ-distance-uniform graph is one with a critical distance d such that from every vertex, all but at most an ϵ-fraction of the remaining vertices are at distance exactly d. Motivated by the theory of network creation ... -
Jocs de formació de xarxes: introducció a la recerca
(Universitat Politècnica de Catalunya, 2013-06-18)
Master thesis (pre-Bologna period)
Restricted access - confidentiality agreement -
Network creation games: structure vs anarchy
(2017-09-03)
Research report
Open AccessWe 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 a prefixed price a > 0 in order to get connected ... -
Network creation games: structure vs anarchy
(Universitat Politècnica de Catalunya, 2020-12-18)
Doctoral thesis
Open AccessIn 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 aspects and properties. Network Creation ... -
Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
(2023-03-24)
Article
Open AccessAn almost Moore (d,k)-digraph is a regular digraph of degree d>1, diameter k>1 and order N(d,k)=d+d2+⋯+dk. So far, their existence has only been shown for k=2, whilst it is known that there are no such digraphs for k=3, 4 ... -
On bipartite sum basic equilibria
(Springer, 2021)
Conference report
Open AccessA connected and undirected graph G of size n≥1 is said to be a sum basic equilibrium iff for every edge uv from G and any node v′ from G, when performing the swap of the edge uv for the edge uv′ the sum of the ... -
On the price of anarchy for high-price links
(Springer, 2019)
Conference report
Open AccessWe 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 is a selfish network creation model where ... -
On the spectra of token graphs of cycles and other graphs
(Elsevier, 2023-09-11)
Article
Open AccessThe k-token graph of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in G. It is a known result ... -
Stars and celebrities: A network creation game
(2015)
Research report
Open AccessCelebrity games, a new model of network creation games is introduced. The specific features of this model are that players have different celebrity weights and that a critical distance is taken into consideration. The aim ... -
The price of anarchy in network creation
(Universitat Politècnica de Catalunya, 2014-01)
Master thesis
Open AccessThis master thesis focuses its attention in the Sum Classic model introduced by Fabrikant et al. which is a simpli cation of the Internet and can be thought as a Strategic Game. In this model the distinct agents, who can ...
