Bounding the potential function in congestion games and approximate pure Nash equilibria

DOI10.1007/978-3-319-13129-0_3MaRDI QIDQ2936974zbMATH OpenOpenAlexFDO

Authors Matthias Feldotto, Martin Gairing, Alexander Skopalik

Publication date 7 January 2015

Published in Web and Internet Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13129-0_3

zbMATH Keywords

congestion gamespotential functionpure Nash equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Approximate pure Nash equilibria in weighted congestion games
• On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
• Approximate Pure Nash Equilibria in Social Context Congestion Games
• Efficient computation of approximate pure Nash equilibria in congestion games
• On the Performance of Approximate Equilibria in Congestion Games

Cited in

(16)

• Congestion games with mixed objectives
• A logarithmic approximation for polymatroid congestion games
• On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
• Improving approximate pure Nash equilibria in congestion games
• Approximate Pure Nash Equilibria in Social Context Congestion Games
• Congestion Games with Mixed Objectives
• Approximate pure Nash equilibria in weighted congestion games
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
• Computing approximate equilibria in weighted congestion games via best-responses
• On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies
• Congestion games with complementarities
• Convergence and Approximation in Potential Games
• Potential functions and the inefficiency of equilibria
• A common generalization of budget games and congestion games
• Convergence to approximate Nash equilibria in congestion games
• Computing better approximate pure Nash equilibria in cut games via semidefinite programming

This page was built for publication: Bounding the potential function in congestion games and approximate pure Nash equilibria

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