Exact Price of Anarchy for Polynomial Congestion Games

DOI10.1007/11672142_17zbMath1136.91337OpenAlexW1600126641MaRDI QIDQ5449800

Sebastian Aland, Burkhard Monien, Florian Schoppmann, Martin Gairing, Dominic Dumrauf

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_17

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (28)

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Coordination mechanisms ⋮ Collusion in atomic splittable routing games ⋮ The price of anarchy for polynomial social cost ⋮ On a generalized Cournot oligopolistic competition game ⋮ On Lookahead Equilibria in Congestion Games ⋮ The price of anarchy in loss systems ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Bayesian generalized network design ⋮ On the performance of approximate equilibria in congestion games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Tight bounds for selfish and greedy load balancing ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ The impact of social ignorance on weighted congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Unnamed Item ⋮ Good programming in transactional memory: game theory meets multicore architecture ⋮ Stackelberg strategies for atomic congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Malicious Bayesian Congestion Games ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Chaotic triopoly game: a congestion case

This page was built for publication: Exact Price of Anarchy for Polynomial Congestion Games