The effectiveness of Stackelberg strategies and tolls for network congestion games

DOI10.1145/2344422.2344426MaRDI QIDQ3189079zbMATH OpenOpenAlexFDO

Authors Chaitanya Swamy

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2344422.2344426

zbMATH Keywords

convex optimizationprice of anarchyalgorithmic game theoryrouting and congestion games

Mathematics Subject Classification ID

Convex programming (90C25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Noncooperative games (91A10) Games involving graphs (91A43) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Stackelberg strategies for selfish routing in general multicommodity networks
• Stackelberg Routing in Arbitrary Networks
• Stackelberg Strategies for Atomic Congestion Games
• Stackelberg strategies for atomic congestion games

Cited in

(28)

• Stackelberg strategies for atomic congestion games
• scientific article; zbMATH DE number 7378728 (Why is no real title available?)
• A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
• Toll caps in privatized road networks
• System optimal routing of traffic flows with user constraints using linear programming
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• A Stackelberg strategy for routing flow over time
• Enforcing efficient equilibria in network design games via subsidies
• Achieving target equilibria in network routing games without knowing the latency functions
• The limit of targeting in networks
• Stackelberg thresholds in network routing games or the value of altruism
• Cost-balancing tolls for atomic network congestion games
• Efficiency of restricted tolls in non-atomic network routing games
• 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
• Optimal externalities in a parallel transportation network
• Using reputation instead of tolls in repeated selfish routing with incomplete information
• Congestion games with priority-based scheduling
• Modifying link capacity to avoid Braess paradox considering elastic demand
• On Stackelberg strategies in affine congestion games
• Urgency-aware optimal routing in repeated games through artificial currencies
• Network spot‐checking games: Theory and application to toll enforcing in transportation networks
• On poisoned Wardrop equilibrium in congestion games
• Network pricing: how to induce optimal flows under strategic link operators
• 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: The effectiveness of Stackelberg strategies and tolls for network congestion games

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