The strong price of anarchy of linear bottleneck congestion games
type: Item
instance of: scholarly article
title: The strong price of anarchy of linear bottleneck congestion games
zbMATH Open document ID: 1409.91012
author: Bart de Keijzer
author: Guido Schäfer
author: Orestis A. Telelis
published in: Theory of Computing Systems
publication date: 2016-01-28T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/24020
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6536609
zbMATH Keywords: algorithmic game theory
zbMATH Keywords: congestion games
zbMATH Keywords: inefficiency of equilibria
zbMATH Keywords: price of anarchy
zbMATH Keywords: strong equilibria
MaRDI profile type: Publication
OpenAlex ID: W2085695690
cites work: Exact Price of Anarchy for Polynomial Congestion Games
cites work: Q2934597
cites work: Acceptable points in games of perfect information
cites work: The Price of Routing Unsplittable Flow
cites work: Tradeoffs in worst-case equilibria
cites work: Stretch in Bottleneck Games
cites work: Atomic routing games on maximum congestion
cites work: Algorithms and Computation
cites work: The price of anarchy of finite congestion games
cites work: Tight bounds for worst-case equilibria
cites work: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
cites work: Strong Price of Anarchy for Machine Load Balancing
cites work: A linear time approximation algorithm for multiprocessor scheduling
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: Coordination mechanisms for selfish scheduling
cites work: Approximate equilibria and ball fusion
cites work: Q3409969
cites work: Worst-case equilibria
cites work: Potential games
cites work: Algorithms, games, and the internet
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Performance guarantees of local search for multiprocessor scheduling
cites work: Q3524729
DOI: 10.1007/S00224-014-9598-9
Recommended article: Strong and Pareto Price of Anarchy in Congestion Games
Recommended article: Bottleneck Congestion Games with Logarithmic Price of Anarchy
Recommended article: Computation of equilibria and the price of anarchy in 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: Algorithms – ESA 2005
Recommended article: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
Recommended article: The price of anarchy of affine congestion games with similar strategies
Recommended article: The asymptotic price of anarchy for \(k\)-uniform congestion games
Recommended article: Exact Price of Anarchy for Polynomial Congestion Games
description: scientific article; zbMATH DE number 6536609