IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v27y2014i4d10.1007_s10878-012-9555-y.html
   My bibliography  Save this article

The cost of selfishness for maximizing the minimum load on uniformly related machines

Author

Listed:
  • Leah Epstein

    (University of Haifa)

  • Elena Kleiman

    (University of Haifa)

  • Rob Stee

    (Max-Planck-Institut für Informatik)

Abstract

Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load of the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (the value of the cover) over the machines. This goal is different from the regular makespan minimization goal, which was extensively studied in a game theoretic context. We study the price of anarchy (poa) and the price of stability (pos) for uniformly related machines. The results are expressed in terms of s, which is the maximum speed ratio between any two machines. For uniformly related machines, we prove that the pos is unbounded for s>2, and the poa is unbounded for s≥2. For the remaining cases we show that while the poa grows to infinity as s tends to 2, the pos is at most 2 for any s≤2.

Suggested Citation

  • Leah Epstein & Elena Kleiman & Rob Stee, 2014. "The cost of selfishness for maximizing the minimum load on uniformly related machines," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 767-777, May.
  • Handle: RePEc:spr:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9555-y
    DOI: 10.1007/s10878-012-9555-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9555-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-012-9555-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Petra Schuurman & Tjark Vredeveld, 2007. "Performance Guarantees of Local Search for Multiprocessor Scheduling," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 52-63, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Deshi Ye & Lin Chen & Guochuan Zhang, 0. "On the price of anarchy of two-stage machine scheduling games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    2. Deshi Ye & Lin Chen & Guochuan Zhang, 2021. "On the price of anarchy of two-stage machine scheduling games," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 616-635, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guoqiang Fan & Qingqin Nong, 2018. "A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
    2. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    3. Tobias Brueggemann & Johann L. Hurink & Tjark Vredeveld & Gerhard J. Woeginger, 2011. "Exponential size neighborhoods for makespan minimization scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 795-803, December.
    4. Cong Chen & Yinfeng Xu, 0. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-33.
    5. Cole, Richard & Correa, Jose & Gkatzelis, Vasillis & Mirrokni, Vahab & Olver, Neil, 2015. "Decentralized utilitarian mechanisms for scheduling games," LSE Research Online Documents on Economics 103081, London School of Economics and Political Science, LSE Library.
    6. Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2012. "Coordination mechanisms for parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 220(2), pages 305-313.
    7. Cong Chen & Yinfeng Xu, 2020. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 333-365, August.
    8. Q. Q. Nong & G. Q. Fan & Q. Z. Fang, 2017. "A coordination mechanism for a scheduling game with parallel-batching machines," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 567-579, February.
    9. Cole, Richard & Correa, José R. & Gkatzelis, Vasilis & Mirrokni, Vahab & Olver, Neil, 2015. "Decentralized utilitarian mechanisms for scheduling games," Games and Economic Behavior, Elsevier, vol. 92(C), pages 306-326.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9555-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.