The price of atomic selfish ring routing
type: Item
instance of: scholarly article
title: The price of atomic selfish ring routing
zbMATH Open document ID: 1188.90047
author: Bo Chen
author: Xujin Chen
author: Xiaodong Hu
published in: Journal of Combinatorial Optimization
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5719874
zbMATH Keywords: selfish routing
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: price of stability
MaRDI profile type: Publication
full work available at URL: s10878-008-9171-z
OpenAlex ID: W2000021718
cites work: Q3128902
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: The Price of Routing Unsplittable Flow
cites work: Q4778551
cites work: Atomic Routing Games on Maximum Congestion
cites work: The price of anarchy of finite congestion games
cites work: Network Games with Atomic Players
cites work: Fast, Fair, and Efficient Flows in Networks
cites work: The complexity of pure Nash equilibria
cites work: Selfish unsplittable flows
cites work: Q3409969
cites work: Potential games
cites work: Automata, Languages and Programming
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: The price of anarchy is independent of the network topology
cites work: How bad is selfish routing?
cites work: The Ring Loading Problem
cites work: Q4250199
DOI: 10.1007/S10878-008-9171-Z
description: scientific article; zbMATH DE number 5719874