Efficient graph topologies in network routing games
type: Item
instance of: scholarly article
title: Efficient graph topologies in network routing games
zbMATH Open document ID: 1161.91332
author: Amir Epstein
author: Michal Feldman
author: Yishay Mansour
published in: Games and Economic Behavior
publication date: 2009-06-08T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5562805
zbMATH Keywords: network routing games
zbMATH Keywords: congestion games
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
full work available at URL: j.geb.2008.04.011
OpenAlex ID: W1989972248
cites work: The Price of Routing Unsplittable Flow
cites work: Über ein Paradoxon aus der Verkehrsplanung
cites work: Atomic Routing Games on Maximum Congestion
cites work: The price of anarchy of finite congestion games
cites work: Q4828962
cites work: Strong equilibrium in cost sharing connection games
cites work: Strong equilibrium in congestion games
cites work: Network structure and strong equilibrium in route selection games.
cites work: Q3409969
cites work: Topological Conditions for Uniqueness of Equilibrium in Networks
cites work: Network topology and the efficiency of equilibrium
cites work: Algorithms, games, and the internet
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: Q5501360
cites work: Selfish routing with atomic players
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
DOI: 10.1016/J.GEB.2008.04.011
description: scientific article; zbMATH DE number 5562805