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

DOI10.1145/1978782.1978786zbMath1295.91009OpenAlexW2090957813MaRDI QIDQ3189014

Karsten Tiemann, Burkhard Monien, Martin Gairing

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

zbMATH Keywords

congestion gamesprice of anarchyconvergence to pure Nash equilibria

Mathematics Subject Classification ID

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

Related Items (7)

Equilibrium computation in resource allocation games ⋮ Weighted Boolean Formula Games ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Congestion Games with Variable Demands ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms

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