Stackelberg strategies for selfish routing in general multicommodity networks
From MaRDI portal
Publication:1017909
DOI10.1007/s00453-007-9018-5zbMath1175.90067OpenAlexW2039786295MaRDI QIDQ1017909
George Karakostas, Stavros G. Kolliopoulos
Publication date: 13 May 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.6934
Related Items (17)
Stackelberg thresholds in network routing games or the value of altruism ⋮ Traffic routing oligopoly ⋮ Strategic decentralization in binary choice composite congestion games ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ A Selective Tour Through Congestion Games ⋮ Stackelberg network pricing games ⋮ Efficient methods for selfish network design ⋮ Non-atomic one-round walks in congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Congestion games with priority-based scheduling ⋮ Stackelberg strategies for atomic congestion games ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ System optimal routing of traffic flows with user constraints using linear programming ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Stackelberg strategies for selfish routing in general multicommodity networks ⋮ On Stackelberg strategies in affine congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Stackelberg strategies for selfish routing in general multicommodity networks
- A convergence analysis for a convex version of Dikin's algorithm
- On the severity of Braess's paradox: designing networks for selfish users is hard
- How bad is selfish routing?
- Pricing network edges for heterogeneous selfish users
- Equilibria on a Congested Transportation Network
- Stackelberg Scheduling Strategies
- Selfish Routing in Capacitated Networks
- Integer Programming and Combinatorial Optimization
- The price of anarchy is independent of the network topology
This page was built for publication: Stackelberg strategies for selfish routing in general multicommodity networks
