Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy

DOI10.1007/s00236-010-0124-5zbMath1214.68092OpenAlexW2041319096MaRDI QIDQ611044

Leah Epstein

Publication date: 13 December 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1222/

zbMATH Keywords

job scheduling game

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Inefficiency of equilibria for scheduling game with machine activation costs ⋮ The price of anarchy on uniformly related machines revisited ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Online scheduling of jobs with favorite machines ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Machine load balancing game with linear externalities ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing the minimum load: the cost of selfishness
• Worst-case equilibria
• Strong equilibrium in cost sharing connection games
• The structure and complexity of Nash equilibria for a selfish routing game
• The price of selfish routing
• Strong price of anarchy
• Strong equilibrium in congestion games
• Approximate equilibria and ball fusion
• Tradeoffs in worst-case equilibria
• Non-cooperative games
• On-Line Load Balancing in a Hierarchical Server Topology
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Convergence time to Nash equilibrium in load balancing
• Atomic Congestion Games Among Coalitions
• Approximate Strong Equilibrium in Job Scheduling Games
• Algorithms, games, and the internet
• Strong Price of Anarchy for Machine Load Balancing
• The Price of Anarchy on Uniformly Related Machines Revisited
• Decentralization and Mechanism Design for Online Machine Scheduling

This page was built for publication: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy