---
res:
bibo_abstract:
- 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Sebastian
foaf_name: Abshoff, Sebastian
foaf_surname: Abshoff
- foaf_Person:
foaf_givenName: Andreas
foaf_name: Cord-Landwehr, Andreas
foaf_surname: Cord-Landwehr
- foaf_Person:
foaf_givenName: Daniel
foaf_name: Jung, Daniel
foaf_surname: Jung
- foaf_Person:
foaf_givenName: Alexander
foaf_name: Skopalik, Alexander
foaf_surname: Skopalik
foaf_workInfoHomepage: http://www.librecat.org/personId=40384
dct_date: 2014^xs_gYear
dct_language: eng
dct_title: 'Brief Announcement: A Model for Multilevel Network Games@'
...