On the Existence of Pure Nash Equilibria in Weighted Congestion Games

DOI10.1007/978-3-642-14165-2_8zbMath1287.91005OpenAlexW2063979082MaRDI QIDQ5901170

Tobias Harks, Max Klimm

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_8

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (7)

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Performance of one-round walks in linear congestion games ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies ⋮ Pure Nash equilibria in restricted budget games

This page was built for publication: On the Existence of Pure Nash Equilibria in Weighted Congestion Games