A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games

DOI10.1007/978-3-642-38016-7_18MaRDI QIDQ2848927zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò

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

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Recommendations

• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games

Cited in

(11)

• Non-atomic one-round walks in congestion games
• On the robustness of the approximate price of anarchy in generalized congestion games
• On Lookahead Equilibria in Congestion Games
• On lookahead equilibria in congestion games
• On Stackelberg strategies in affine congestion games
• On the performance of mildly greedy players in cut games
• Game efficiency through linear programming duality
• An Efficient Game Form for Unicast Service Provisioning
• Coping with selfishness in congestion games. Analysis and design via LP duality
• Exact price of anarchy for weighted congestion games with two players
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games

This page was built for publication: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848927)