Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Arnau Messegué"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Arnau Messegué, Carme Àlvarez
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
A 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 distances from u to all the other
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fa6acec1c7a3b05463ef48ec2096da1
https://hdl.handle.net/2117/363353
https://hdl.handle.net/2117/363353
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in an $\epsil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a534b4ff368a193952afcfcf419c5cb1
https://hdl.handle.net/2117/177597
https://hdl.handle.net/2117/177597
Autor:
Arnau Messegué, Carme Àlvarez
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Web and Internet Economics ISBN: 9783030353889
WINE
Universitat Politècnica de Catalunya (UPC)
Web and Internet Economics ISBN: 9783030353889
WINE
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 is a selfish network creation model where players correspond to nodes in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e9a7edf99219cf0af339ff42cb07917
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We 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 α. The cost incurred by a player depends
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43a276e646efa24b968daafea96a0959
https://hdl.handle.net/2117/98737
https://hdl.handle.net/2117/98737
Autor:
Carme Àlvarez, Arnau Messegué
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319497860
WAW
WAW
We introduce Max celebrity games a new variant of Celebrity games defined in [4]. In both models players have weights and there is a critical distance \(\beta \) as well as a link cost \(\alpha \). In the max celebrity model the cost of a player depe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3fa4513efd9c1ad4211cec772dc3b64
https://doi.org/10.1007/978-3-319-49787-7_8
https://doi.org/10.1007/978-3-319-49787-7_8