Inefficiency of equilibria for the machine covering game on uniform machines

DOI10.1007/S00236-012-0163-1zbMATH Open1285.68023OpenAlexW2057588755MaRDI QIDQ715052FDOQ715052

Authors: 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

Recommendations

• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
• Inefficiency of equilibria for scheduling game with machine activation costs
• The price of anarchy for utilitarian scheduling games on related machines
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Worst-case equilibria
• Strong price of anarchy
• The Price of Stability for Network Design with Fair Cost Allocation
• Strong Price of Anarchy for Machine Load Balancing
• Convergence time to Nash equilibrium in load balancing
• The Santa Claus problem
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Title not available (Why is that?)
• Title not available (Why is that?)
• Performance guarantees of local search for multiprocessor scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Maximizing the minimum load: the cost of selfishness
• The price of anarchy on uniformly related machines revisited
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Tight bounds for bandwidth allocation on two links
• Max-min online allocations with a reordering buffer

Cited In (6)

• 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
• Inefficiency of Nash equilibria with parallel processing policy
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• Maximizing the minimum load: the cost of selfishness

This page was built for publication: Inefficiency of equilibria for the machine covering game on uniform machines

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