Stackelberg Routing in Arbitrary Networks
From MaRDI portal
Publication:3169096
DOI10.1287/moor.1100.0442zbMath1232.91016OpenAlexW2137967811MaRDI QIDQ3169096
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
Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65) Games with infinitely many players (91A07)
Related Items (8)
Strategic decentralization in binary choice composite congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Collusion in atomic splittable routing games ⋮ The price of optimum: complexity and approximation for a matching game ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
This page was built for publication: Stackelberg Routing in Arbitrary Networks
