Algorithms for pure Nash equilibria in weighted congestion games

DOI10.1145/1187436.1216584zbMath1169.68319OpenAlexW2171306573MaRDI QIDQ3507775

Panagiota N. Panagopoulou, Paul G. Spirakis

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1187436.1216584

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (15)

A Glimpse at Paul G. Spirakis ⋮ A Selective Tour Through Congestion Games ⋮ Computing pure Nash equilibria in network revenue management games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Unnamed Item ⋮ Performance of one-round walks in linear congestion games ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Congestion Games with Variable Demands ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ A unifying approximate potential for weighted congestion games ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash Equilibria in Resource Graph Games

This page was built for publication: Algorithms for pure Nash equilibria in weighted congestion games