A convergence analysis of the price of anarchy in atomic congestion games

Autor: Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu

Publikováno v: Mathematical Programming. 199:937-993

This paper provides a comprehensive convergence analysis of the PoA of both pure and mixed Nash equilibria in atomic congestion games with unsplittable demands.
57 pages

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01329122c2483e435e1ba19dc37c3afe
https://doi.org/10.1007/s10107-022-01853-0

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tight inefficiency bounds for perception-parameterized affine congestion games

Autor: Kleer, Pieter, Schäfer, Guido, Fotakis, Dimitris, Pagourtzis, Aris, Paschos, Vangelis Th.

Publikováno v: Theoretical Computer Science, 754, 65-87
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
Kleer, P & Schäfer, G 2019, ' Tight inefficiency bounds for perception-parameterized affine congestion games ', Theoretical Computer Science, vol. 754, pp. 65-87 . https://doi.org/10.1016/j.tcs.2018.04.025
Kleer, P & Schäfer, G 2017, Tight inefficiency bounds for perception-parameterized affine congestion games . in D Fotakis, A Pagourtzis & V T Paschos (eds), Algorithms and Complexity-10th International Conference, CIAC 2017, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10236 LNCS, Springer Verlag, pp. 381-392, 10th International Conference on Algorithms and Complexity, CIAC 2017, Athens, Greece, 24/05/17 . https://doi.org/10.1007/978-3-319-57586-5_32
Algorithms and Complexity-10th International Conference, CIAC 2017, Proceedings, 381-392
STARTPAGE=381;ENDPAGE=392;TITLE=Algorithms and Complexity-10th International Conference, CIAC 2017, Proceedings
Theoretical Computer Science, 754, 65-87. Elsevier

Congestion games constitute an important class of non-cooperative games which was introduced by Rosenthal in 1973. In recent years, several extensions of these games were proposed to incorporate aspects that are not captured by the standard model. Ex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::267a6ddd3c47b94ae907dd5f0bc97f32
https://doi.org/10.1007/978-3-319-57586-5_32

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Stackelberg routing in arbitrary networks

Autor: Tobias Harks, Vincenzo Bonifaci, Guido Schäfer

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540921844
WINE
Mathematics of Operations Research, 35(2), 330-346

We investigate the impact of Stackelberg routing to reduce the price of anarchy in network routing games. In this setting, an α fraction of the entire demand is first routed centrally according to a predefined Stackelberg strategy and the remaining

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecc2ef4ab2e6ceb98b261db11d02c391
https://hdl.handle.net/11590/379884