IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i1d10.1007_s10878-024-01239-2.html
   My bibliography  Save this article

New bounds on the price of anarchy of selfish bin packing with partial punishment

Author

Listed:
  • Xiaowei Li

    (East China University of Science and Technology)

  • Peihai Liu

    (East China University of Science and Technology)

  • Xiwen Lu

    (East China University of Science and Technology)

Abstract

The selfish bin packing with partial punishment is studied in this paper. In this problem, the utility of an item is defined as the load of the bin it is in. Each item plays the role of a selfish agent and wants to maximize its own utility. If an item with size $$s_i$$ s i moves to another bin, it has to pay the partial punishment of $$\alpha s_{i}$$ α s i , where $$0

Suggested Citation

  • Xiaowei Li & Peihai Liu & Xiwen Lu, 2025. "New bounds on the price of anarchy of selfish bin packing with partial punishment," Journal of Combinatorial Optimization, Springer, vol. 49(1), pages 1-17, January.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:1:d:10.1007_s10878-024-01239-2
    DOI: 10.1007/s10878-024-01239-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01239-2
    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-024-01239-2?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. Dosa, Gyorgy & Kellerer, Hans & Tuza, Zsolt, 2019. "Using weight decision for decreasing the price of anarchy in selfish bin packing games," European Journal of Operational Research, Elsevier, vol. 278(1), pages 160-169.
    2. Xin Chen & Qingqin Nong & Qizhi Fang, 2021. "An improved mechanism for selfish bin packing," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 636-656, October.
    3. Chenhao Zhang & Guochuan Zhang, 2022. "From packing rules to cost-sharing mechanisms," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1578-1593, October.
    4. Ruixin Ma & György Dósa & Xin Han & Hing-Fung Ting & Deshi Ye & Yong Zhang, 2013. "A note on a selfish bin packing problem," Journal of Global Optimization, Springer, vol. 56(4), pages 1457-1462, August.
    5. Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco, 2020. "Selfish colorful bin packing games," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 610-635, October.
    Full references (including those not matched with items on IDEAS)

    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. Chenhao Zhang & Guochuan Zhang, 0. "From packing rules to cost-sharing mechanisms," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    2. Chenhao Zhang & Guochuan Zhang, 2022. "From packing rules to cost-sharing mechanisms," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1578-1593, October.
    3. Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco, 0. "Selfish colorful bin packing games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-26.
    4. Xin Chen & Qingqin Nong & Qizhi Fang, 2021. "An improved mechanism for selfish bin packing," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 636-656, October.
    5. György Dósa & Leah Epstein, 2019. "Quality of strong equilibria for selfish bin packing with uniform cost sharing," Journal of Scheduling, Springer, vol. 22(4), pages 473-485, August.
    6. Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco, 2020. "Selfish colorful bin packing games," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 610-635, October.
    7. Q. Q. Nong & T. Sun & T. C. E. Cheng & Q. Z. Fang, 2018. "Bin packing game with a price of anarchy of $$\frac{3}{2}$$ 3 2," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 632-640, February.
    8. Dosa, Gyorgy & Kellerer, Hans & Tuza, Zsolt, 2019. "Using weight decision for decreasing the price of anarchy in selfish bin packing games," European Journal of Operational Research, Elsevier, vol. 278(1), pages 160-169.
    9. György Dósa & Leah Epstein, 2019. "Pareto optimal equilibria for selfish bin packing with uniform cost sharing," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 827-847, April.
    10. Xin Chen & Qingqin Nong & Qizhi Fang, 0. "An improved mechanism for selfish bin packing," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-21.
    11. Kameda, Hisao, 2021. "Magnitude of inefficiency," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1133-1145.

    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:49:y:2025:i:1:d:10.1007_s10878-024-01239-2. 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.