Stackelberg Routing on Parallel Networks With Horizontal Queues
From MaRDI portal
Publication:2983233
DOI10.1109/TAC.2013.2289709zbMath1360.91047OpenAlexW2078424621MaRDI QIDQ2983233
Walid Krichene, Jack Reilly, Alexandre M. Bayen, Saurabh Amin
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2013.2289709
Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (4)
Minimizing the total travel time with limited unfairness in traffic networks ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ A study of general and security Stackelberg game formulations ⋮ System optimal routing of traffic flows with user constraints using linear programming
This page was built for publication: Stackelberg Routing on Parallel Networks With Horizontal Queues
