scientific article; zbMATH DE number 6783389

MaRDI QIDQ5365037zbMATH OpenFDO

Authors Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133054

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Games involving graphs (91A43) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
• scientific article; zbMATH DE number 934458
• Stackelberg strategies for selfish routing in general multicommodity networks
• Stackelberg Routing in Arbitrary Networks
• Stackelberg Routing on Parallel Networks With Horizontal Queues
• Stochastic flow networks via multiple paths under time threshold and budget constraint
• Optimal Time-Varying Flows on Congested Networks
• Dynamic flows with adaptive route choice

Cited in

(8)

• Timed network games
• Algorithms for flows over time with scheduling costs
• A Stackelberg strategy for routing flow over time
• Competitive routing of traffic flows by navigation providers
• Algorithms for Flows over Time with Scheduling Costs
• Timed network games
• Using Temporal Dummy Players in Cost-Sharing Games
• Competitive routing over time

This page was built for publication:

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