The price of routing unsplittable flow
From MaRDI portal
Publication:5891074
DOI10.1137/070702370zbMATH Open1286.68220OpenAlexW2023548600MaRDI QIDQ5891074FDOQ5891074
Authors: Baruch Awerbuch, Amir Epstein, Yossi Azar
Publication date: 4 July 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070702370
Recommendations
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)
Cited In (28)
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Atomic Routing Games on Maximum Congestion
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- Constraint games for stable and optimal allocation of demands in SDN
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Concurrent imitation dynamics in congestion games
- The Price of Stability of Weighted Congestion Games
- The Price of Stability of Weighted Congestion Games
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
- Atomic routing games on maximum congestion
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- Exact price of anarchy for polynomial congestion games
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
- Price of anarchy for parallel link networks with generalized mean objective
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- The Price of Anarchy in Selfish Multicast Routing
- The price of routing unsplittable flow
- Selfish unsplittable flows
- The sequential price of anarchy for affine congestion games with few players
- The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
- Incentives and coordination in bottleneck models
- On the robustness of the approximate price of anarchy in generalized congestion games
- The price of anarchy in series-parallel network congestion games
- The price of anarchy of affine congestion games with similar strategies
- Automata, Languages and Programming
This page was built for publication: The price of routing unsplittable flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891074)