A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
From MaRDI portal
Publication:2848927
DOI10.1007/978-3-642-38016-7_18zbMath1390.91017OpenAlexW2897806075MaRDI QIDQ2848927
Publication date: 13 September 2013
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_18
Related Items (9)
On Stackelberg Strategies in Affine Congestion Games ⋮ On the performance of mildly greedy players in cut games ⋮ On Lookahead Equilibria in Congestion Games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ On lookahead equilibria in congestion games ⋮ Non-atomic one-round walks in congestion games ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Game efficiency through linear programming duality
This page was built for publication: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
