Approximation and Online Algorithms
From MaRDI portal
Publication:5896921
DOI10.1007/b95598zbMath1173.68402OpenAlexW4300520713MaRDI QIDQ5896921
Baruch Awerbuch, Yossi Azar, Dekel Tsur, Yossi Richter
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Communication networks in operations research (90B18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
Strong equilibrium in cost sharing connection games ⋮ Atomic routing games on maximum congestion ⋮ Greedy distributed optimization of multi-commodity flows ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Subjective vs. Objective Reality — The Risk of Running Late
This page was built for publication: Approximation and Online Algorithms
