Results 1  10
of
13,457
On a network creation game
 in Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing
, 2003
"... christos @ cs.berkeley.edu ..."
Basic Network Creation Games
, 2010
"... We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident edge at a time. The central question is what structure the resulting equilibrium graphs have, in particular, how well they ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident edge at a time. The central question is what structure the resulting equilibrium graphs have, in particular, how well
IPD network creation Games
"... Motivated by the possible application to technical communication networks, we study a gametheoretical approach to network structure creation. By allowing nodes to change their neighborhood to maximize their payoff according to the rules of the iterated prisoner’s dilemma (IPD) the network structur ..."
Abstract
 Add to MetaCart
Motivated by the possible application to technical communication networks, we study a gametheoretical approach to network structure creation. By allowing nodes to change their neighborhood to maximize their payoff according to the rules of the iterated prisoner’s dilemma (IPD) the network
Network Creation Games with Disconnected Equilibria
, 2008
"... In this paper we extend a popular noncooperative network creation game (NCG) [11] to allow for disconnected equilibrium networks. There are n players, each is a vertex in a graph, and a strategy is a subset of players to build edges to. For each edge a player must pay a cost α, and the individual ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper we extend a popular noncooperative network creation game (NCG) [11] to allow for disconnected equilibrium networks. There are n players, each is a vertex in a graph, and a strategy is a subset of players to build edges to. For each edge a player must pay a cost α, and the individual
On Dynamics in Basic Network Creation Games
"... We initiate the study of game dynamics in the Sum Basic Network Creation Game, which was recently introduced by Alon et al.[SPAA’10]. In this game players are associated to vertices in a graph and are allowed to “swap ” edges, that is to remove an incident edge and insert a new incident edge. By per ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We initiate the study of game dynamics in the Sum Basic Network Creation Game, which was recently introduced by Alon et al.[SPAA’10]. In this game players are associated to vertices in a graph and are allowed to “swap ” edges, that is to remove an incident edge and insert a new incident edge
A Delivery Network Creation Game
"... We study a noncooperative network creation game where players, represented by nodes, can build edges to other players for a cost of α, and strive to maintain short paths to other players while minimizing cost. Players incur a penalty of β for each unreachable node in addition to the charges for co ..."
Abstract
 Add to MetaCart
We study a noncooperative network creation game where players, represented by nodes, can build edges to other players for a cost of α, and strive to maintain short paths to other players while minimizing cost. Players incur a penalty of β for each unreachable node in addition to the charges
On Nash equilibria for a network creation game
 In Proc. of SODA
, 2006
"... We study a network creation game recently proposed by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker. In this game, each player (vertex) can create links (edges) to other players at a cost of α per edge. The goal of every player is to minimize the sum consisting of (a) the cost of the links he ..."
Abstract

Cited by 86 (6 self)
 Add to MetaCart
We study a network creation game recently proposed by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker. In this game, each player (vertex) can create links (edges) to other players at a cost of α per edge. The goal of every player is to minimize the sum consisting of (a) the cost of the links
The Price of Anarchy in Network Creation Games
, 2007
"... and that the price of anarchy is 15 "1 + (min { ff2n, n2ff})1/3 " for any ff. The latter bound shows the first sublinear worstcase bound, O(n1/3), for all ff. But no better bound is known for ff between!(pn) and o(n lg n). Yet ff ss n is perhaps the most interesting range, for it c ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
, for it corresponds to considering the average distance (instead of the sum of distances) to other nodes to be roughly on par with link creation (effectively dividing ff by n). In this paper, we prove the first o(n") upper bound for general ff, namely 2O(plg n). We also prove a constant upper bound for ff
THE PRICE OF ANARCHY IN COOPERATIVE NETWORK CREATION GAMES
, 2009
"... We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the network design and network routing problems by modeling both creation and usage costs. In general, the games are played o ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the network design and network routing problems by modeling both creation and usage costs. In general, the games are played
Results 1  10
of
13,457