Inefficiency of Nash equilibria with parallel processing policy

Authors:
Long Wan;Xiaofang Deng;Zhiyi Tan
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, 310027, PR China;Software School, Jiangxi Normal University, Nanchang, 330022, PR China;Department of Mathematics, State Key Lab of CAD, Zhejiang University, Hangzhou, 310027, PR China
Venue:
Information Processing Letters
Year:
2013

Citing 16
Cited 0

Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking (TON)
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Stackelberg scheduling strategies

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Nash equilibria for scheduling on restricted parallel links

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
How much can taxes help selfish routing?

Journal of Computer and System Sciences - Special issue on network algorithms 2005
Performance Guarantees of Local Search for Multiprocessor Scheduling

INFORMS Journal on Computing
(Almost) optimal coordination mechanisms for unrelated machine scheduling

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Coordination mechanisms for selfish scheduling

Theoretical Computer Science
Maximizing the Minimum Load: The Cost of Selfishness

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
New Approximation Bounds for Lpt Scheduling

Algorithmica
Price of anarchy in parallel processing

Information Processing Letters
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy

Acta Informatica

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we revisit the coordination mechanism of parallel processing policy introduced in [L. Yu, K. She, H. Gong, C. Yu, Price of anarchy in parallel processing, Information Processing Letters 110 (8-9) (2010) 288-293]. For both the problem of minimizing makespan and the machine covering problem, we give the analysis of price of anarchy with this new mechanism. In the first problem, we point out an error in the original paper and provide a correct instance. Moreover, we show the exact PoA for identical and uniform machines. In the second problem, we obtain new results for several scheduling models.