Stackelberg Routing in Arbitrary Networks

DOI10.1287/MOOR.1100.0442zbMATH Open1232.91016OpenAlexW2137967811MaRDI QIDQ3169096FDOQ3169096

Tobias Harks, Vincenzo Bonifaci, 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)

Cited In (12)

• Fighting for routes: resource allocation among competing planners in transportation networks
• A Selective Tour Through Congestion Games
• Title not available (Why is that?)
• Leadership in singleton congestion games: what is hard and what is easy
• Achieving target equilibria in network routing games without knowing the latency functions
• Stackelberg Routing on Parallel Networks With Horizontal Queues
• 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 and collusion in network games with splittable flow
• The price of optimum: complexity and approximation for a matching game
• Directional Routing via Generalized st-Numberings
• Collusion in atomic splittable routing games

Recommendations

• Shortest-Path Routing in Arbitrary Networks 👍 👎
• Stochastic Selfish Routing 👍 👎
• Stackelberg Routing on Parallel Networks With Horizontal Queues 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)