The Price of Routing Unsplittable Flow
From MaRDI portal
Publication:5891074
DOI10.1137/070702370zbMath1286.68220OpenAlexW2023548600MaRDI QIDQ5891074
Amir Epstein, Baruch Awerbuch, 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
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)
Related Items (17)
Concurrent imitation dynamics in congestion games ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Incentives and coordination in bottleneck models ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ The price of anarchy in series-parallel network congestion games ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ Constraint games for stable and optimal allocation of demands in SDN ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ The Price of Stability of Weighted Congestion Games ⋮ Atomic congestion games with random players: network equilibrium and the price of anarchy ⋮ The Price of Stability of Weighted Congestion Games
This page was built for publication: The Price of Routing Unsplittable Flow
