Stackelberg strategies for selfish routing in general multicommodity networks

DOI10.1007/S00453-007-9018-5zbMATH Open1175.90067OpenAlexW2039786295MaRDI QIDQ1017909FDOQ1017909

Authors: 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

Recommendations

• Stackelberg Routing in Arbitrary Networks
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg strategies for atomic congestion games

zbMATH Keywords

price of anarchy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Worst-case equilibria
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology
• On the severity of Braess's paradox: designing networks for selfish users is hard
• How bad is selfish routing?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equilibria on a Congested Transportation Network
• Stackelberg Scheduling Strategies
• Stackelberg strategies for selfish routing in general multicommodity networks
• Pricing network edges for heterogeneous selfish users
• Title not available (Why is that?)
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• A convergence analysis for a convex version of Dikin's algorithm
• Integer Programming and Combinatorial Optimization

Cited In (21)

• Stackelberg strategies for atomic congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• System optimal routing of traffic flows with user constraints using linear programming
• Title not available (Why is that?)
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Efficient methods for selfish network design
• Traffic routing oligopoly
• An improved tax scheme for selfish routing
• Stackelberg thresholds in network routing games or the value of altruism
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Strategic decentralization in binary choice composite congestion games
• Stackelberg strategies for selfish routing in general multicommodity networks
• Stackelberg strategies and collusion in network games with splittable flow
• Congestion games with priority-based scheduling
• Stackelberg network pricing games
• On Stackelberg strategies in affine congestion games
• A selective tour through congestion games
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• On Stackelberg strategies in affine congestion games
• The price of anarchy of affine congestion games with similar strategies
• Non-atomic one-round walks in congestion games

This page was built for publication: Stackelberg strategies for selfish routing in general multicommodity networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017909)