Skip to main content
SpringerLink
Log in

Quality of strong equilibria for selfish bin packing with uniform cost sharing

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

The bin packing problem deals with packing items of sizes no larger than 1 into unit capacity bins. Here, we analyze a class of bin packing games where the cost of an item is 1 over the total number of items packed into its bin, which is a bin packing congestion game. We study strong equilibria and find the tight values of the SPoA and SPoS, that is, asymptotic approximation ratios of the worst and best strong equilibria. We show that these values are approximately 1.69103 and 1.611824, respectively. In particular, we observe that the two values are not equal, showing a difference from other known kinds of cost sharing approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andelman, N., Feldman, M., & Mansour, Y. (2009). Strong price of anarchy. Games and Economic Behavior, 65(2), 289–317.

    Article  Google Scholar 

  • Anshelevich, E., Dasgupta, A., Kleinberg, J. M., Tardos, É., Wexler, T., & Roughgarden, T. (2008). The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602–1623.

    Article  Google Scholar 

  • Aumann, R . J. (1959). Acceptable points in general cooperative n-person games. In A . W. Tucker & R . D. Luce (Eds.), Contributions to the Theory of Games IV, annals of mathematics study 40 (pp. 287–324). Princeton: Princeton University Press.

    Google Scholar 

  • Baker, B. S., & Coffman, E. G, Jr. (1981). A tight asymptotic bound for next-fit-decreasing bin-packing. SIAM Journal on Algebraic and Discrete Methods, 2(2), 147–152.

    Article  Google Scholar 

  • Bilò, V. (2006). On the packing of selfish items. In Proceedings of the 20th international parallel and distributed processing symposium (IPDPS’06). IEEE.

  • Caprara, A., & Pferschy, U. (2004). Worst-case analysis of the subset sum algorithm for bin packing. Operations Research Letters, 32(2), 159–166.

    Article  Google Scholar 

  • Chien, S., & Sinclair, A. (2009). Strong and pareto price of anarchy in congestion games. In Proceedings of the 36th international colloquium on automata, languages and programming (ICALP’09) (pp. 279–291).

  • Coffman, E . G., Garey, M . R., & Johnson, D . S. (1997). Approximation algorithms for bin packing: A survey. In D. Hochbaum (Ed.), Approximation algorithms. Boston: PWS Publishing Company.

    Google Scholar 

  • Czumaj, A., & Vöcking, B. (2007). Tight bounds for worst-case equilibria. ACM Transactions on Algorithms, 3(1).

  • Dósa, Gy., & Epstein, L. (2012). Generalized selfish bin packing. CoRR, abs/1202.4080.

  • Dósa, Gy., & Epstein, L. Selfish bin packing with general weights. Manuscript.

  • Dósa, Gy., & Epstein, L. The price of anarchy for selfish bin packing with uniform cost sharing. Manuscript.

  • Epstein, A., Feldman, M., & Mansour, Y. (2009). Strong equilibrium in cost sharing connection games. Games and Economic Behavior, 67(1), 51–68.

    Article  Google Scholar 

  • Epstein, L., & Kleiman, E. (2011). Selfish bin packing. Algorithmica, 60(2), 368–394.

    Article  Google Scholar 

  • Epstein, L., Kleiman, E., & Mestre, J. (2016). Parametric packing of selfish items and the Subset Sum algorithm. Algorithmica, 74(1), 177–207.

    Article  Google Scholar 

  • Epstein, L., & Levin, A. (2008). On bin packing with conflicts. SIAM Journal on Optimization, 19(3), 1270–1298.

    Article  Google Scholar 

  • Fernandes, C. G., Ferreira, C. E., Miyazawa, F. K., & Wakabayashi, Y. (2011). Selfish square packing. Electronic Notes in Discrete Mathematics, 37, 369–374.

    Article  Google Scholar 

  • Fiat, A., Kaplan, H., Levy, M., & Olonetsky, S. (2007). Strong price of anarchy for machine load balancing. In Proceedings of the 34th international colloquium on automata, languages and programming (ICALP’07) (pp. 583–594).

  • Fisher, D. C. (1988). Next-fit packs a list and its reverse into the same number of bins. Operations Research Letters, 7(6), 291–293.

    Article  Google Scholar 

  • Galambos, G., & Woeginger, G. J. (1993). Repacking helps in bounded space online bin packing. Computing, 49, 329–338.

    Article  Google Scholar 

  • Graham, R. L. (1972). Bounds on multiprocessing anomalies and related packing algorithms. In Proceedings of the 1972 spring joint computer conference (pp. 205–217).

  • Holzman, R., & Law-Yone, N. (1997). Strong equilibrium in congestion games. Games and Economic Behavior, 21(1–2), 85–101.

    Article  Google Scholar 

  • Ieong, S., McGrew, B., Nudelman, E., Shoham, Y., & Sun, Q. (2005). Fast and compact: A simple class of congestion games, In Proceedings of the 20th national conference on artificial intelligence (pp. 489–494).

  • Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3, 256–278.

    Article  Google Scholar 

  • Koutsoupias, E., & Papadimitriou, C. H.(1999). Worst-case equilibria. In Proceedings of the 16th annual symposium on theoretical aspects of computer science (STACS’99) (pp. 404–413).

  • Lee, C. C., & Lee, D. T. (1985). A simple online bin packing algorithm. Journal of the ACM, 32(3), 562–572.

    Article  Google Scholar 

  • Ma, R., Dósa, Gy, Han, X., Ting, H.-F., Ye, D., & Zhang, Y. (2013). A note on a selfish bin packing problem. Journal of Global Optimization, 56(4), 1457–1462.

    Article  Google Scholar 

  • Mavronicolas, M., & Spirakis, P. G. (2007). The price of selfish routing. Algorithmica, 48(1), 91–126.

    Article  Google Scholar 

  • Nash, J. (1951). Non-cooperative games. Annals of Mathematics, 54(2), 286–295.

    Article  Google Scholar 

  • Roughgarden, T. (2005). Selfish routing and the price of anarchy. Cambridge: MIT Press.

    Google Scholar 

  • Roughgarden, T., & Tardos, É. (2002). How bad is selfish routing? Journal of the ACM, 49(2), 236–259.

    Article  Google Scholar 

  • Tennenholtz, M., & Rozenfeld, O. (2006). Strong and correlated strong equilibria in monotone congestion games. In Proceedings of the 2nd international workshop on internet and network economics (WINE’06) (pp. 74–86).

  • Yu, G., & Zhang, G.(2008). Bin packing of selfish items. In The 4th international workshop on internet and network economics (WINE’08) (pp. 446–453).

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Pannonia, Veszprém, Hungary

    György Dósa

  2. Department of Mathematics, University of Haifa, Haifa, Israel

    Leah Epstein

Authors
  1. György Dósa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leah Epstein.

Additional information

Supported by VKSZ_12-1-2013-0088 “Development of cloud based smart IT solutions by IBM Hungary in cooperation with the University of Pannonia” and by National Research, Development and Innovation Office—NKFIH under the Grant SNN 116095. Dosa acknowledges the financial support of Széchenyi 2020 under the EFOP-3.6.1-16-2016-00015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dósa, G., Epstein, L. Quality of strong equilibria for selfish bin packing with uniform cost sharing. J Sched 22, 473–485 (2019). https://doi.org/10.1007/s10951-018-0587-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-018-0587-8

Keywords

Search

Navigation