{"page":"435-440","type":"conference","status":"public","_id":"395","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","user_id":"15415","file":[{"access_level":"closed","date_created":"2018-03-20T06:59:20Z","file_id":"1382","creator":"florida","relation":"main_file","file_size":161479,"file_name":"395-WINE2014ACJS.pdf","success":1,"content_type":"application/pdf","date_updated":"2018-03-20T06:59:20Z"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:59Z","ddc":["040"],"file_date_updated":"2018-03-20T06:59:20Z","year":"2014","title":"Multilevel Network Games","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2017-10-17T12:42:09Z","has_accepted_license":"1","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"abstract":[{"text":"We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic.","lang":"eng"}],"doi":"10.1007/978-3-319-13129-0_36","series_title":"LNCS","citation":{"chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={10.1007/978-3-319-13129-0_36}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS} }","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Multilevel Network Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 435–440). https://doi.org/10.1007/978-3-319-13129-0_36","mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]}