{"abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19]."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"has_accepted_license":"1","date_created":"2017-10-17T12:42:21Z","file_date_updated":"2018-03-16T11:22:57Z","ddc":["040"],"page":"480 - 485","file":[{"file_name":"456-WINE14final.pdf","file_id":"1340","success":1,"file_size":377378,"creator":"florida","date_created":"2018-03-16T11:22:57Z","date_updated":"2018-03-16T11:22:57Z","relation":"main_file","access_level":"closed","content_type":"application/pdf"}],"doi":"10.1007/978-3-319-13129-0_43","author":[{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"last_name":"Kotsialou","full_name":"Kotsialou, Grammateia","first_name":"Grammateia"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"year":"2014","status":"public","citation":{"short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 480–85. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>.","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2014}, pages={480–485}, collection={LNCS} }","apa":"Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 480–485). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>","ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:480-485. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>.","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–485."},"user_id":"477","department":[{"_id":"541"},{"_id":"63"}],"title":"Approximate pure Nash equilibria in Social Context Congestion Games","_id":"456","language":[{"iso":"eng"}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","date_updated":"2022-01-06T07:01:10Z","series_title":"LNCS"}