The price of anarchy on uniformly related machines revisited
DOI10.1016/J.IC.2012.01.005zbMATH Open1238.90063OpenAlexW2005432425MaRDI QIDQ418148FDOQ418148
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.01.005
Recommendations
- The Price of Anarchy on Uniformly Related Machines Revisited
- The Price of Anarchy for Minsum Related Machine Scheduling
- The price of anarchy for utilitarian scheduling games on related machines
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Other game-theoretic models (91A40)
Cites Work
- Non-cooperative games
- Worst-case equilibria
- Worst-case equilibria
- How bad is selfish routing?
- Strong price of anarchy
- Tight bounds for worst-case equilibria
- Title not available (Why is that?)
- Strong Price of Anarchy for Machine Load Balancing
- The price of selfish routing
- Title not available (Why is that?)
- Bounds for LPT Schedules on Uniform Processors
- Approximate equilibria and ball fusion
- Convergence time to Nash equilibrium in load balancing
- Algorithmic mechanism design
- Coordination mechanisms for selfish scheduling
- Bounds for List Schedules on Uniform Processors
- Strong equilibrium in cost sharing connection games
- Algorithms, games, and the internet
- Strong equilibrium in congestion games
- Title not available (Why is that?)
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- The structure and complexity of Nash equilibria for a selfish routing game
- Tighter approximation bounds for LPT scheduling in two special cases
- Title not available (Why is that?)
- An On-Line Algorithm for Some Uniform Processor Scheduling
Cited In (10)
- On the price of anarchy of two-stage machine scheduling games
- Inefficiency of equilibria for the machine covering game on uniform machines
- The Price of Anarchy for Minsum Related Machine Scheduling
- Price of anarchy in a linear-state stochastic dynamic game
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- The Price of Anarchy on Uniformly Related Machines Revisited
- Inefficiency of equilibria for scheduling game with machine activation costs
- Multistage interval scheduling games
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
This page was built for publication: The price of anarchy on uniformly related machines revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418148)
