Brief Announcement: A Model for Multilevel Network Games
Abshoff, Sebastian
Cord-Landwehr, Andreas
Jung, Daniel
Skopalik, Alexander
Lavi, Ron
ddc:040
Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \alpha > 0, if it decides to be a gateway. For both games and different ranges of \alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics.
2014
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
https://ris.uni-paderborn.de/record/452
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294.
eng
info:eu-repo/semantics/closedAccess