Stackelberg Routing in Arbitrary Networks

DOI10.1287/MOOR.1100.0442MaRDI QIDQ3169096zbMATH OpenOpenAlexFDO

Authors Vincenzo Bonifaci, Tobias Harks, Guido Schäfer

Publication date 27 April 2011

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL http://edoc.mpg.de/536757

zbMATH Keywords

network routing gamesStackelberg routinginefficiency of equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Games with infinitely many players (91A07) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• Shortest-Path Routing in Arbitrary Networks
• scientific article; zbMATH DE number 786519
• Stackelberg Routing on Parallel Networks With Horizontal Queues
• scientific article; zbMATH DE number 956788
• scientific article; zbMATH DE number 1256754
• Stochastic selfish routing

Cited in

(22)

• Fighting for routes: resource allocation among competing planners in transportation networks
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• scientific article; zbMATH DE number 6783389 (Why is no real title available?)
• A Stackelberg strategy for routing flow over time
• Leadership in singleton congestion games: what is hard and what is easy
• Achieving target equilibria in network routing games without knowing the latency functions
• Experimental and Efficient Algorithms
• Stackelberg Routing on Parallel Networks With Horizontal Queues
• 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
• On Stackelberg strategies in affine congestion games
• A selective tour through congestion games
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Stackelberg strategies for network design games
• The price of optimum: complexity and approximation for a matching game
• On Stackelberg strategies in affine congestion games
• Directional Routing via Generalized st-Numberings
• Collusion in atomic splittable routing games

This page was built for publication: Stackelberg Routing in Arbitrary Networks

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