Competitive online multicommodity routing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- A priority-based model of routing
- Competitive Online Multicommodity Routing
- Competitive routing in networks with polynomial costs
- Geometric algorithms and combinatorial optimization.
- How bad is selfish routing?
- Increasing internet capacity using local search
- Online algorithms. The state of the art
- Selfish Routing in Capacitated Networks
- Selfish load balancing and atomic congestion games
- Selfish routing with atomic players
- The impact of oligopolistic competition in networks
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Tight Bounds for Selfish and Greedy Load Balancing
- Traffic assignment problem for a general network
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(9)- The inefficiency of Nash and subgame perfect equilibria for network routing
- Competitive Online Multicommodity Routing
- Dynamic Atomic Congestion Games with Seasonal Flows
- Competitive FIB aggregation for independent prefixes: online ski rental on the trie
- Online mixed ring covering problem with two nodes
- The quality of equilibria for set packing and throughput scheduling games
- The sequential price of anarchy for affine congestion games with few players
- Competitive routing over time
- Smart routing of electric vehicles for load balancing in smart grids
This page was built for publication: Competitive online multicommodity routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839644)