The price of anarchy in series-parallel network congestion games

DOI10.1007/s10107-022-01803-wOpenAlexW4224436758MaRDI QIDQ6120906

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01803-w

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Cites Work

Unnamed Item
Unnamed Item
Strong equilibrium in network congestion games: increasing versus decreasing costs
Network topology and the efficiency of equilibrium
Congestion games with linearly independent paths: convergence time and price of anarchy
Efficient graph topologies in network routing games
How easy is local search?
Potential games
A linear algorithm for the domination number of a series-parallel graph
The price of anarchy of affine congestion games with similar strategies
Generalized max flow in series-parallel graphs
A class of games possessing pure-strategy Nash equilibria
Faster Algorithms for the Generalized Network Flow Problem
Efficiency of Equilibria in Uniform Matroid Congestion Games
How bad is selfish routing?
The Price of Stability for Network Design with Fair Cost Allocation
On the impact of combinatorial structure on congestion games
The Price of Collusion in Series-Parallel Networks
The price of anarchy of finite congestion games
On the Inefficiency of Equilibria in Congestion Games
Multiple Equilibrium Behaviors on Networks
The Recognition of Series Parallel Digraphs
Linear-time computability of combinatorial problems on series-parallel graphs
Linear-time computation of optimal subgraphs of decomposable graphs
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
The network equilibrium problem in integers
Selfish Routing in Capacitated Networks
The Price of Routing Unsplittable Flow
The Price of Routing Unsplittable Flow
The price of anarchy is independent of the network topology

This page was built for publication: The price of anarchy in series-parallel network congestion games