Stackelberg Routing on Parallel Networks With Horizontal Queues

DOI10.1109/TAC.2013.2289709MaRDI QIDQ2983233zbMATH OpenOpenAlexFDO

Authors Walid Krichene, Jack Reilly, Saurabh Amin, Alexandre Bayen

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Games involving graphs (91A43) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• Stackelberg Routing in Arbitrary Networks
• An algorithm for sub-optimal routeing in series-parallel queueing networks
• ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
• Combining routing and buffer allocation problems in series-parallel queueing networks
• The model of queueing network with parallel routes
• Parallel algorithms for routing in nonblocking networks
• scientific article; zbMATH DE number 822904
• Optimal routing to parallel heterogeneous servers-small arrival rates

Cited in

(7)

• A study of general and security Stackelberg game formulations
• System optimal routing of traffic flows with user constraints using linear programming
• Minimizing the total travel time with limited unfairness in traffic networks
• Stackelberg Routing in Arbitrary Networks
• ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
• scientific article; zbMATH DE number 6783389 (Why is no real title available?)
• Using Temporal Dummy Players in Cost-Sharing Games

This page was built for publication: Stackelberg Routing on Parallel Networks With Horizontal Queues

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