{"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"title":"Congestion games with mixed objectives","date_updated":"2022-01-06T07:03:15Z","file":[{"creator":"feldi","relation":"main_file","file_size":605207,"date_updated":"2018-10-31T16:57:32Z","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","access_level":"closed","file_id":"5226","content_type":"application/pdf","success":1,"date_created":"2018-10-31T16:57:32Z"}],"issue":"4","intvolume":"        36","department":[{"_id":"63"},{"_id":"541"}],"has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"volume":36,"publication_identifier":{"issn":["1382-6905","1573-2886"]},"author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052"},{"full_name":"Leder, Lennart","last_name":"Leder","first_name":"Lennart"},{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"file_date_updated":"2018-10-31T16:57:32Z","publication_status":"published","external_id":{"arxiv":["1607.05143"]},"doi":"10.1007/s10878-017-0189-y","date_created":"2017-10-26T14:11:04Z","publication":"Journal of Combinatorial Optimization","page":"1145-1167","language":[{"iso":"eng"}],"ddc":["000"],"citation":{"apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167."},"type":"journal_article","publisher":"Springer Nature","user_id":"14052","year":"2018","status":"public","_id":"669"}