Computation of equilibria and the price of anarchy in bottleneck congestion games
type: Item
instance of: scholarly article
title: Computation of equilibria and the price of anarchy in bottleneck congestion games
zbMATH Open document ID: 1339.91006
author: T. L. Werth
author: Sven O. Krumke
author: Heike Sperber
published in: CEJOR. Central European Journal of Operations Research
publication date: 2016-06-30T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 6599669
zbMATH Keywords: network bottleneck game
zbMATH Keywords: unsplittable flow
zbMATH Keywords: optimal equilibria
zbMATH Keywords: complexity
zbMATH Keywords: price of stability
zbMATH Keywords: price of anarchy
MaRDI profile type: MaRDI publication profile
full work available at URL: s10100-013-0295-6
OpenAlex ID: W2043672253
cites work: Pure Nash equilibria in player-specific and weighted congestion games
cites work: Q3254691
cites work: Minimum cost flow algorithms for series-parallel networks
cites work: Atomic routing games on maximum congestion
cites work: Algorithms and Computation
cites work: Selfish Routing in Capacitated Networks
cites work: An improved general procedure for lexicographic bottleneck problems
cites work: Efficient graph topologies in network routing games
cites work: The Price of Anarchy on Uniformly Related Machines Revisited
cites work: The complexity of pure Nash equilibria
cites work: Approximation and Online Algorithms
cites work: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
cites work: Strong equilibria in games with the lexicographical improvement property
cites work: Network structure and strong equilibrium in route selection games.
cites work: Worst-case equilibria
cites work: Atomic resource sharing in noncooperative networks
cites work: Network topology and the efficiency of equilibrium
cites work: Equilibrium points in n -person games
cites work: Algorithms, games, and the internet
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
cites work: Lexicographic bottleneck combinatorial problems
cites work: The Recognition of Series Parallel Digraphs
DOI: 10.1007/S10100-013-0295-6
Recommended article: Bottleneck congestion games with logarithmic price of anarchy
Recommended article: Computing pure Nash and strong equilibria in bottleneck congestion games
Recommended article: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Recommended article: The strong price of anarchy of linear bottleneck congestion games
Recommended article: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Recommended article: Congestion games with linearly independent paths: convergence time and price of anarchy
Recommended article: Efficient computation of approximate pure Nash equilibria in congestion games
Recommended article: On the Performance of Approximate Equilibria in Congestion Games
Recommended article: On the performance of approximate equilibria in congestion games
Recommended article: Price of anarchy for highly congested routing games in parallel networks
description: scientific article; zbMATH DE number 6599669