On Linear Congestion Games with Altruistic Social Context
From MaRDI portal
Publication:2920491
DOI10.1007/978-3-319-08783-2_47zbMath1435.91020arXiv1308.3329OpenAlexW1635105252MaRDI QIDQ2920491
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3329
Nash equilibriumpure Nash equilibriumcongestion gamepolynomial latency functionweight congestion game
Related Items (4)
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games
This page was built for publication: On Linear Congestion Games with Altruistic Social Context
