Inefficiency of equilibria for the machine covering game on uniform machines
From MaRDI portal
Publication:715052
DOI10.1007/s00236-012-0163-1zbMath1285.68023OpenAlexW2057588755MaRDI QIDQ715052
Zhiyi Tan, Long Wan, Qi Zhang, Wei Ren
Publication date: 15 October 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0163-1
Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
Cites Work
- Unnamed Item
- Unnamed Item
- Maximizing the minimum load: the cost of selfishness
- The price of anarchy on uniformly related machines revisited
- Worst-case equilibria
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Strong price of anarchy
- Tight bounds for bandwidth allocation on two links
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- The Santa Claus problem
- A linear time approximation algorithm for multiprocessor scheduling
- The Price of Stability for Network Design with Fair Cost Allocation
- Convergence time to Nash equilibrium in load balancing
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Strong Price of Anarchy for Machine Load Balancing
- Max-min Online Allocations with a Reordering Buffer
This page was built for publication: Inefficiency of equilibria for the machine covering game on uniform machines
