Tighter price of anarchy for selfish task allocation on selfish machines-Reference-Cited by-同舟云学术

Tighter price of anarchy for selfish task allocation on selfish machines

Published:2020-03-06 Issue: Volume: Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Cheng Xiayan,Li Rongheng^ORCID,Zhou Yunxia

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-020-00556-6.pdf

Reference15 articles.

1. Andelman N, Azar Y, Sorani M (2007) Truthful approximation mechanisms for scheduling selfish related machines. Theory Comput Syst 40:423–436

2. Chen B, Gürel S (2012) Efficiency analysis of load balancing games with and without activation costs. J Sched 15(2):157–164

3. Chen X, Hu X, Ma W, Wang C (2013) Reducing price of anarchy of selfish task allocation with more selfishness. Theor Comput Sci 507:17–33

4. Christodoulou G, Gourvès L, Pascual F (2007) Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, LNCS 4598. Springer-Verlag, Berlin, pp 187–197

5. Finn G, Horowitz E (1979) A linear time approximation algorithm for multiprocessor scheduling. BIT Numer Math 19:312–320

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling Games with Potential Penalties on the Move of Jobs;Journal of the Operations Research Society of China;2023-11-15

2. Coordination mechanisms for scheduling games with machine modification;International Transactions in Operational Research;2020-09-21