Tradeoffs in worst-case equilibria

DOI10.1016/j.tcs.2006.05.010zbMath1097.68012OpenAlexW2154518750MaRDI QIDQ2503349

Baruch Awerbuch, Yossi Richter, Dekel Tsur, Yossi Azar

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.010

zbMATH Keywords

restricted assignmentunrelated linksworst-case coordination ratio

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

The shortest first coordination mechanism for a scheduling game with parallel-batching machines, On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games, Optimal Coordination Mechanisms for Unrelated Machine Scheduling, The Price of Matching with Metric Preferences, Worst-case Nash equilibria in restricted routing, Scheduling selfish jobs on multidimensional parallel machines, Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy, Smoothed performance guarantees for local search, Strategic Scheduling Games: Equilibria and Efficiency, The strong price of anarchy of linear bottleneck congestion games, Performance guarantees of jump neighborhoods on restricted related parallel machines, Non-clairvoyant scheduling games, Scheduling games with machine-dependent priority lists, A coordination mechanism for a scheduling game with parallel-batching machines, A new model for selfish routing, Nash equilibria in discrete routing games with convex latency functions, Coordinating oligopolistic players in unrelated machine scheduling, Computing Nash equilibria for scheduling on restricted parallel links, Decentralized utilitarian mechanisms for scheduling games, The Price of Stochastic Anarchy, Selfish load balancing for jobs with favorite machines, Strong price of anarchy, Coordination mechanisms for selfish scheduling, Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How much can taxes help selfish routing?
• How bad is selfish routing?
• Selfish traffic allocation for server farms
• Pricing network edges for heterogeneous selfish users
• The price of selfish routing
• Algorithms, games, and the internet
• The price of anarchy is independent of the network topology