IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i3d10.1007_s10878-018-0323-5.html
   My bibliography  Save this article

Pareto optimal equilibria for selfish bin packing with uniform cost sharing

Author

Listed:
  • György Dósa

    (University of Pannonia)

  • Leah Epstein

    (University of Haifa)

Abstract

Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is $$\frac{1}{k}$$1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0323-5
    DOI: 10.1007/s10878-018-0323-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0323-5
    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-018-0323-5?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. Epstein, Amir & Feldman, Michal & Mansour, Yishay, 2009. "Strong equilibrium in cost sharing connection games," Games and Economic Behavior, Elsevier, vol. 67(1), pages 51-68, September.
    2. Andelman, Nir & Feldman, Michal & Mansour, Yishay, 2009. "Strong price of anarchy," Games and Economic Behavior, Elsevier, vol. 65(2), pages 289-317, March.
    3. 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.
    4. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    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. Kameda, Hisao, 2021. "Magnitude of inefficiency," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1133-1145.

    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. 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.
    2. Le Breton, Michel & Shapoval, Alexander & Weber, Shlomo, 2021. "A game-theoretical model of the landscape theory," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 41-46.
    3. Ruben Juarez & Rajnish Kumar, 2013. "Implementing efficient graphs in connection networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 359-403, October.
    4. Krzysztof R. Apt & Bart Keijzer & Mona Rahn & Guido Schäfer & Sunil Simon, 2017. "Coordination games on graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(3), pages 851-877, August.
    5. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
    6. Martin Hoefer, 2013. "Strategic cooperation in cost sharing games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 29-53, February.
    7. Leah Epstein & Sven O. Krumke & Asaf Levin & Heike Sperber, 2011. "Selfish bin coloring," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 531-548, November.
    8. Clempner, Julio B. & Poznyak, Alexander S., 2015. "Computing the strong Nash equilibrium for Markov chains games," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 911-927.
    9. Tami Tamir, 2023. "Cost-sharing games in real-time scheduling systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 273-301, March.
    10. Tobias Harks & Max Klimm & Rolf Möhring, 2013. "Strong equilibria in games with the lexicographical improvement property," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 461-482, May.
    11. Kukushkin, Nikolai S., 2017. "Strong Nash equilibrium in games with common and complementary local utilities," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 1-12.
    12. Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
    13. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    14. Xujin Chen & Zhuo Diao & Xiaodong Hu, 2022. "On weak Pareto optimality of nonatomic routing networks," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1705-1723, October.
    15. Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Documents de travail du Centre d'Economie de la Sorbonne 14033, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    16. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    17. Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
    18. Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco, 0. "Selfish colorful bin packing games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-26.
    19. Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.
    20. Cong Chen & Yinfeng Xu, 0. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-33.

    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:37:y:2019:i:3:d:10.1007_s10878-018-0323-5. 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.