The price of routing unsplittable flow

DOI10.1137/070702370MaRDI QIDQ5891074zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Nash equilibriaprice of anarchycongestion gamesunsplittable flowselfish routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)

Recommendations

• The price of routing unsplittable flow
• Selfish unsplittable flows
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Automata, Languages and Programming

Cited in

(36)

• 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
• A priority-based model of routing
• Cost-sharing in generalised selfish routing
• Atomic congestion games with random players: network equilibrium and the price of anarchy
• Constraint games for stable and optimal allocation of demands in SDN
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Concurrent imitation dynamics in congestion games
• When is selfish routing bad? The price of anarchy in light and heavy traffic
• The curse of sequentiality in routing games
• Selfish routing with atomic players
• 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
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• Exact price of anarchy for polynomial congestion games
• 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
• The price of anarchy in routing games as a function of the demand
• Selfish unsplittable flows
• The sequential price of anarchy for affine congestion games with few players
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games
• Incentives and coordination in bottleneck models
• On the robustness of the approximate price of anarchy in generalized congestion games
• Local smoothness and the price of anarchy in atomic splittable congestion games
• The price of anarchy of affine congestion games with similar strategies
• The price of anarchy in series-parallel network congestion games
• Automata, Languages and Programming
• Computing approximate equilibria in weighted congestion games via best-responses

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)