Skip to main content
Springer Nature Link
Log in

On Various Open-End Bin Packing Game

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13135))

  • 1000 Accesses

Abstract

In this paper, we introduce various open-end bin packing problems in a game theoretic setting. The items (as agents) are selfish and intelligent to minimize the cost they have to pay, by selecting a proper bin to fit in. For both general open-end bin packing game and minimum open-end bin packing game, we prove the existence of the pure Nash Equilibrium and study the Price of Anarchy. We prove the upper bound to be approximately 2 and show a corresponding tight lower bound for both models. Furthermore, we study the open-end bin packing game with conflict and also give the proof for the existence of Nash Equilibrium. Under multipartite and simple conflict graph, we study the upper bound of Price of Anarchy separately.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ceselli, A., Righini, G.: An optimization algorithm for the ordered open-end bin-packing problem. Oper. Res. 56(2), 425–436 (2008)

    Article  MathSciNet  Google Scholar 

  2. Epstein, L., Levin, A.: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109, 32–37 (2008)

    Article  MathSciNet  Google Scholar 

  3. Epstein, L.: Open-end bin packing: new and old analysis approaches. https://arxiv.org/abs/2105.05923v1 [cs.DS] (2021)

  4. Epstein, L., Levin, A.: A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48, 844–849 (2020)

    Article  MathSciNet  Google Scholar 

  5. Balogh, J., Epstein, L., Levin, A.: More on ordered open end bin packing. https://arxiv.org/abs/2010.07119v1 [cs.DS] (2020)

  6. Gai, L., Wu, C., Xu, C., Zhang. W.: Selfish bin packing under Harmonic mean cost sharing mechanism. Optim. Lett. 1–12 (2021)

    Google Scholar 

  7. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65–69 (2009)

    Article  Google Scholar 

  8. Joseph, Y.-T., Leung, M.D., Young, G.H.: A note on an open-end bin packing problem. J. Sched. Manuscriot, 1996

    Google Scholar 

  9. Leung, J.Y.T., Dror, M., Young, G.H.: A note on an open-end bin packing problem. J. Sched. 4(4), 201–207 (2001)

    Google Scholar 

  10. Li, W., Fang, Q., Liu, W.: An incentive mechanism for selfish bin covering. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 641–654. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48749-6_46

    Chapter  Google Scholar 

  11. Wang, Z., Han, X., Dosa, G., Tuza, Z.: A general bin packing game: interest taken into account. Algorithmica 80, 1534–1555 (2018)

    Google Scholar 

  12. Yang, J., Leung, T.Y.T.: The ordered open-end bin-packing problem. Oper. Res. 51(5), 759–770 (2003)

    Google Scholar 

  13. Zhang, G.: Parameterized on-line open-end bin packing. Computing 60, 267–273 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Glorious Sun School of Business & Management, Donghua University, Shanghai, 200051, China

    Ling Gai

  2. School of Management, Shanghai University, Shanghai, 201444, China

    Weiwei Zhang

  3. School of Mathematics and Statistics, Ningbo University, Ningbo, 315211, China

    Wenchang Luo

  4. Business School, Suzhou University of Science and Technology, Suzhou, 215009, China

    Yukun Cheng

Authors
  1. Ling Gai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weiwei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenchang Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yukun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yukun Cheng .

Editor information

Editors and Affiliations

  1. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. University of New Brunswick, Fredericton, NB, Canada

    Donglei Du

  3. Tianjin University of Technology, Tianjin, China

    Chenchen Wu

  4. Beijing University of Technology, Beijing, China

    Dachuan Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gai, L., Zhang, W., Luo, W., Cheng, Y. (2021). On Various Open-End Bin Packing Game. In: Du, DZ., Du, D., Wu, C., Xu, D. (eds) Combinatorial Optimization and Applications. COCOA 2021. Lecture Notes in Computer Science(), vol 13135. Springer, Cham. https://doi.org/10.1007/978-3-030-92681-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92681-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92680-9

  • Online ISBN: 978-3-030-92681-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics