How hard is it to find extreme Nash equilibria in network congestion games?
type: Item
instance of: scholarly article
title: How hard is it to find extreme Nash equilibria in network congestion games?
zbMATH Open document ID: 1175.91044
author: Elisabeth Gassner
author: Johannes Hatzl
author: Sven O. Krumke
author: Heike Sperber
author: Gerhard J. Woeginger
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 5626967
zbMATH Keywords: network congestion game
zbMATH Keywords: unsplittable flow
zbMATH Keywords: makespan objective
zbMATH Keywords: extreme equilibria
zbMATH Keywords: complexity
zbMATH Keywords: non-cooperative games
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.046
OpenAlex ID: W2046097055
cites work: Q3056948
cites work: The Price of Routing Unsplittable Flow
cites work: Minimum cost flow algorithms for series-parallel networks
cites work: The price of anarchy of finite congestion games
cites work: Q4828962
cites work: The complexity of pure Nash equilibria
cites work: Q4449200
cites work: On the structure and complexity of worst-case equilibria
cites work: Q4737150
cites work: Selfish unsplittable flows
cites work: Approximation and Online Algorithms
cites work: Structure and complexity of extreme Nash equilibria
cites work: `` Strong '' NP-Completeness Results
cites work: Worst-case equilibria
cites work: The price of selfish routing
cites work: Algorithms, games, and the internet
cites work: A class of games possessing pure-strategy Nash equilibria
DOI: 10.1016/J.TCS.2009.07.046
Recommended article: How to find Nash equilibria with extreme total latency in network congestion games?
Recommended article: Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
Recommended article: Computing approximate Nash equilibria in network congestion games
Recommended article: Computing Approximate Nash Equilibria in Network Congestion Games
Recommended article: Experimental and Efficient Algorithms
Recommended article: Inefficiency of pure Nash equilibria in series-parallel network congestion games
Recommended article: Strong equilibrium in network congestion games: increasing versus decreasing costs
Recommended article: Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
description: scientific article; zbMATH DE number 5626967