Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria

DOI10.1007/978-3-319-13129-0_3zbMath1404.91049OpenAlexW119483277MaRDI QIDQ2936974

Martin Gairing, Alexander Skopalik, Matthias Feldotto

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)

Related Items (5)

Congestion Games with Complementarities ⋮ Congestion games with mixed objectives ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Congestion Games with Mixed Objectives

This page was built for publication: Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria