The asymptotic price of anarchy for k-uniform congestion games

DOI10.1007/978-3-319-89441-6_23MaRDI QIDQ1644955zbMATH OpenOpenAlexFDO

Authors Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz

Publication date 22 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-89441-6_23

zbMATH Keywords

asymptotic price of anarchycongestion gamesuniform matroid

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Recommendations

• Efficiency of equilibria in uniform matroid congestion games
• Strong and Pareto Price of Anarchy in Congestion Games
• A convergence analysis of the price of anarchy in atomic congestion games
• Exact price of anarchy for polynomial congestion games
• The price of anarchy of affine congestion games with similar strategies

Cited in

(9)

• Computation and efficiency of potential function minimizers of combinatorial congestion games
• Local smoothness and the price of anarchy in splittable congestion games
• The price of anarchy of affine congestion games with similar strategies
• The sequential price of anarchy for affine congestion games with few players
• Efficiency of equilibria in uniform matroid congestion games
• A convergence analysis of the price of anarchy in atomic congestion games
• Price of anarchy for graphic matroid congestion games
• Price of anarchy in paving matroid congestion games
• The strong price of anarchy of linear bottleneck congestion games

This page was built for publication: The asymptotic price of anarchy for \(k\)-uniform congestion games

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