Stackelberg strategies for selfish routing in general multicommodity networks
type: Item
instance of: scholarly article
title: Stackelberg strategies for selfish routing in general multicommodity networks
zbMATH Open document ID: 1175.90067
author: George Karakostas
author: Stavros G. Kolliopoulos
published in: Algorithmica
publication date: 2009-05-13T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5553464
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
OpenAlex ID: W2039786295
cites work: Equilibria on a Congested Transportation Network
cites work: Q4226167
cites work: Pricing network edges for heterogeneous selfish users
cites work: Selfish Routing in Capacitated Networks
cites work: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
cites work: Q3409969
cites work: Integer Programming and Combinatorial Optimization
cites work: Stackelberg Scheduling Strategies
cites work: Q4828932
cites work: The price of anarchy is independent of the network topology
cites work: Q5501360
cites work: On the severity of Braess's paradox: designing networks for selfish users is hard
cites work: How bad is selfish routing?
cites work: A convergence analysis for a convex version of Dikin's algorithm
cites work: Q2934708
DOI: 10.1007/S00453-007-9018-5
description: scientific article; zbMATH DE number 5553464