Inefficiency of Nash equilibria with parallel processing policy

DOI10.1016/J.IPL.2013.03.006MaRDI QIDQ2444737zbMATH OpenOpenAlexFDO

Authors Long Wan, Xiaofang Deng, Zhiyi Tan

Publication date 11 April 2014

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

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

zbMATH Keywords

Nash equilibriumparallel processingprice of anarchy

Mathematics Subject Classification ID

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

Recommendations

• Price of anarchy in parallel processing
• Nonpreemptive coordination mechanisms for identical machines
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• Coordination mechanisms with hybrid local policies

Cites work

• A linear time approximation algorithm for multiprocessor scheduling
• Automata, Languages and Programming
• Bounds for Certain Multiprocessing Anomalies
• Bounds for List Schedules on Uniform Processors
• Bounds on Multiprocessing Timing Anomalies
• Computing Nash equilibria for scheduling on restricted parallel links
• Coordination mechanisms for selfish scheduling
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• How much can taxes help selfish routing?
• scientific article; zbMATH DE number 5764807 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• Inefficiency of equilibria for the machine covering game on uniform machines
• New approximation bounds for LPT scheduling
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Performance guarantees of local search for multiprocessor scheduling
• Price of anarchy in parallel processing
• Stackelberg differential games in economic models
• Stackelberg scheduling strategies
• Worst-case equilibria

Cited in

(2)

• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
• Price of anarchy in parallel processing

This page was built for publication: Inefficiency of Nash equilibria with parallel processing policy

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