Routing (un-) splittable flow in games with player-specific affine latency functions

DOI10.1145/1978782.1978786zbMATH Open1295.91009OpenAlexW2090957813MaRDI QIDQ3189014FDOQ3189014

Authors: Martin Gairing, Burkhard Monien, Karsten Tiemann 

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1978782.1978786

Recommendations

• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• The price of routing unsplittable flow
• The price of routing unsplittable flow
• Selfish unsplittable flows
• Automata, Languages and Programming

zbMATH Keywords

price of anarchycongestion gamesconvergence to pure Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Games with infinitely many players (91A07) Games involving graphs (91A43)

Cited In (14)

• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Two-terminal routing games with unknown active players
• Congestion Games with Player-Specific Constants
• Equilibrium computation in resource allocation games
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
• Weighted Boolean Formula Games
• Selfish unsplittable flows
• The complexity of pure equilibria in mix-weighted congestion games on parallel links
• Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
• The contest game for crowdsourcing reviews
• Automata, Languages and Programming
• Congestion games with variable demands

This page was built for publication: Routing (un-) splittable flow in games with player-specific affine latency functions

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