Local smoothness and the price of anarchy in atomic splittable congestion games

MaRDI QIDQ5365041zbMATH OpenFDO

Authors Tim Roughgarden, Florian Schoppmann

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133058

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10)

Recommendations

• Local smoothness and the price of anarchy in splittable congestion games
• Intrinsic robustness of the price of anarchy
• Pathwise smooth splittable congestion games and inefficiency
• Intrinsic robustness of the price of anarchy
• The price of routing unsplittable flow

Cited in

(15)

• Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games
• Local smoothness and the price of anarchy in splittable congestion games
• Bounding the inefficiency of outcomes in generalized second price auctions
• Achieving target equilibria in network routing games without knowing the latency functions
• Pathwise smooth splittable congestion games and inefficiency
• Collusion in atomic splittable routing games
• Incentives and efficiency in uncertain collaborative environments
• Collusion in atomic splittable routing games
• Intrinsic robustness of the price of anarchy
• Strategic decentralization in binary choice composite congestion games
• LP-based covering games with low price of anarchy
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• Intrinsic robustness of the price of anarchy
• Robust price of anarchy bounds via LP and Fenchel duality
• Inefficiency of games with social context

This page was built for publication: Local smoothness and the price of anarchy in atomic splittable congestion games

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