Atomic routing games on maximum congestion
type: Item
instance of: scholarly article
title: Atomic routing games on maximum congestion
zbMATH Open document ID: 1168.91328
author: Costas Busch
author: Malik Magdon-Ismail
published in: Theoretical Computer Science
publication date: 2009-08-21T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5597931
zbMATH Keywords: algorithmic game theory
zbMATH Keywords: congestion game
zbMATH Keywords: routing game
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.04.015
OpenAlex ID: W2059997911
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Near-optimal network design with selfish agents
cites work: The Price of Routing Unsplittable Flow
cites work: Approximation and Online Algorithms
cites work: Optimal oblivious routing in polynomial time
cites work: Q4252279
cites work: Approximating Congestion + Dilation in Networks via "Quality of Routing&#x201D; Games
cites work: The price of anarchy of finite congestion games
cites work: Integer Programming and Combinatorial Optimization
cites work: Q4228489
cites work: Q4828962
cites work: Selfish traffic allocation for server farms
cites work: Q4737150
cites work: Selfish unsplittable flows
cites work: The price of anarchy for polynomial social cost
cites work: Nash equilibria in discrete routing games with convex latency functions
cites work: Computing Nash equilibria for scheduling on restricted parallel links
cites work: Automata, Languages and Programming
cites work: Tradeoffs and Average-Case Equilibria in Selfish Routing
cites work: The Influence of Link Restrictions on (Random) Selfish Routing
cites work: Approximate equilibria and ball fusion
cites work: Q3409969
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Q4002466
cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
cites work: Atomic resource sharing in noncooperative networks
cites work: A new model for selfish routing
cites work: The price of selfish routing
cites work: Potential games
cites work: Q4527032
cites work: Algorithms, games, and the internet
cites work: Q4228490
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q5501360
cites work: Selfish routing with atomic players
cites work: How bad is selfish routing?
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
cites work: Selfish load balancing and atomic congestion games
DOI: 10.1016/J.TCS.2009.04.015
description: scientific article; zbMATH DE number 5597931