Atomic congestion games with random players: network equilibrium and the price of anarchy
type: Item
instance of: scholarly article
title: Atomic congestion games with random players: network equilibrium and the price of anarchy
zbMATH Open document ID: 1503.91025
author: Chenlan Wang
author: Xuan Vinh Doan
author: Bo Chen
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 91A14
zbMATH DE Number: 7595936
zbMATH Keywords: congestion game
zbMATH Keywords: network equilibrium
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
full work available at URL: s10878-020-00583-3
OpenAlex ID: W3027778823
cites work: Exact Price of Anarchy for Polynomial Congestion Games
cites work: The Price of Routing Unsplittable Flow
cites work: The price of routing unsplittable flow
cites work: The price of anarchy of finite congestion games
cites work: Selfish Routing in Capacitated Networks
cites work: A geometric approach to the price of anarchy in nonatomic congestion games
cites work: Q3409969
cites work: Population uncertainty and Poisson games
cites work: The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q4092698
cites work: How bad is selfish routing?
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
DOI: 10.1007/S10878-020-00583-3
description: scientific article; zbMATH DE number 7595936