Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
From MaRDI portal
Publication:1755838
DOI10.1016/j.orl.2016.07.014zbMath1408.91005arXiv1512.03484OpenAlexW2963239560MaRDI QIDQ1755838
Akaki Mamageishvili, Paolo Penna
Publication date: 11 January 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.03484
Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Nash equilibria with minimum potential in undirected broadcast games
- Sequential scheduling on identical machines
- The Price of Stability for Network Design with Fair Cost Allocation
- Algorithmic Game Theory
- Bounds on Multiprocessing Timing Anomalies
- Selfish Routing in Capacitated Networks
This page was built for publication: Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games