Price of anarchy in parallel processing

DOI10.1016/j.ipl.2010.02.003zbMath1209.68075OpenAlexW1982325951MaRDI QIDQ991788

Kun She, Haigang Gong, Chang-Yuan Yu, Ling-Fei Yu

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.02.003

zbMATH Keywords

Nash equilibriumanalysis of algorithmsprice of anarchycoordination mechanismjob scheduling game

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

The price of anarchy for utilitarian scheduling games on related machines ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ Inefficiency of Nash equilibria with parallel processing policy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg differential games in economic models
• Coordination mechanisms for selfish scheduling
• How much can taxes help selfish routing?
• Algorithmic mechanism design (extended abstract)
• A linear time approximation algorithm for multiprocessor scheduling
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Stackelberg scheduling strategies
• Automata, Languages and Programming
• Computing Nash equilibria for scheduling on restricted parallel links

This page was built for publication: Price of anarchy in parallel processing