Skip to main content
SpringerLink
Log in

An Improved Mechanism for Selfish Bin Packing

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

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

Abstract

Selfish bin packing can be viewed as the non-cooperative version of bin packing problem, where every item is a selfish agent and want to minimize his sharing cost with the other items packing in the same bin. In this paper, we focus on designing a new mechanism (a payoff rule) for selfish bin packing, called modified Dutch treatment mechanism. We first show that the pure Nash equilibrium exists and it can be obtained in polynomial time. We then prove that under the new mechanism, the price of anarchy (PoA) is between 1.47407 and 1.4748, improving the known results.

This work is supported by NSFC (No. 11271341 and No. 11501316).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bilò, V.: On the packing of selfish items. In: Proceedings of 20th IEEE International Parallel and Distributed Processing Symposium. IEEE (2006)

    Google Scholar 

  2. Coffman, J.E.G., Csirik, J.: Performance guarantees for one-dimensional bin packing. In: Handbook of Approximation Algorithms and Metaheuristics, p. 32-1 (2007)

    Google Scholar 

  3. Coffman, J.E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing Co. (1996)

    Google Scholar 

  4. Dósa, G., Epstein, L.: Generalized selfish bin packing. arXiv preprint arXiv:1202.4080 (2012)

  5. Dósa, G., Sgall, J.: First Fit bin packing: a tight analysis. LIPIcs-Leibniz International Proceedings in Informatics. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Epstein, L., Kleiman, E., Mestre, J.: Parametric packing of selfish items and the subset sum algorithm. Algorithmica 74(1), 177–207 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  8. Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pp. 143–150. ACM (1972)

    Google Scholar 

  9. Johnson, D.S., Demers, A., Ullman, J.D., et al.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299–325 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  10. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49116-3_38

    Chapter  Google Scholar 

  11. 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 

  12. Ma, R., Dósa, G., Han, X., et al.: A note on a selfish bin packing problem. J. Global Optim. 56(4), 1457–1462 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nash, J.: Non-cooperative games. Ann. Math. 54, 286–295 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  14. Neumann, L.J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1947)

    MATH  Google Scholar 

  15. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  16. Wang, Z., Han, X., Dósa, G., Tuza, Z.: Bin packing game with an interest matrix. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 57–69. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21398-9_5

    Chapter  Google Scholar 

  17. Yu, G., Zhang, G.: Bin packing of selfish items. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 446–453. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92185-1_50

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Ocean University of China, Qingdao, 266100, Shandong Province, People’s Republic of China

    Xin Chen, Qingqin Nong & Qizhi Fang

Authors
  1. Xin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingqin Nong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qizhi Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qizhi Fang .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, X., Nong, Q., Fang, Q. (2017). An Improved Mechanism for Selfish Bin Packing. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71147-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71146-1

  • Online ISBN: 978-3-319-71147-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation