Selfish load balancing for jobs with favorite machines

Cong Chen; Yinfeng Xu

doi:10.1016/j.orl.2018.11.004

Selfish load balancing for jobs with favorite machines

Cong Chen
, Yinfeng Xu

School of Management

Xi'an Jiaotong University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models.

Original language	English
Pages (from-to)	7-11
Number of pages	5
Journal	Operations Research Letters
Volume	47
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2018.11.004
State	Published - Jan 2019

Keywords

(Strong) Price of Anarchy
Favorite machine
Load balancing game

Access to Document

10.1016/j.orl.2018.11.004

Cite this

@article{c1c09ee11456423b9b9db0a8960e37d9,

title = "Selfish load balancing for jobs with favorite machines",

abstract = "This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models.",

keywords = "(Strong) Price of Anarchy, Favorite machine, Load balancing game",

author = "Cong Chen and Yinfeng Xu",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = jan,

doi = "10.1016/j.orl.2018.11.004",

language = "英语",

volume = "47",

pages = "7--11",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Selfish load balancing for jobs with favorite machines

AU - Chen, Cong

AU - Xu, Yinfeng

PY - 2019/1

Y1 - 2019/1

N2 - This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models.

AB - This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models.

KW - (Strong) Price of Anarchy

KW - Favorite machine

KW - Load balancing game

UR - https://www.scopus.com/pages/publications/85057311379

U2 - 10.1016/j.orl.2018.11.004

DO - 10.1016/j.orl.2018.11.004

M3 - 文章

AN - SCOPUS:85057311379

SN - 0167-6377

VL - 47

SP - 7

EP - 11

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -

Selfish load balancing for jobs with favorite machines

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this