Skip to main content
SpringerLink
Log in

Selfish Bin Packing with Parameterized Punishment

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2020)

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

Included in the following conference series:

Abstract

In this paper we consider the problem of selfish bin packing with parameterized punishment. Different from the classical bin packing problem, each item to be packed belongs to a selfish agent, who wants to maximize his utility by selecting an appropriate bin. The utility of the agent is defined as the total size of the items sharing the same bin with its item. If an item moves unilaterally to another bin, it may have to pay the punishment. A parameter is defined such that the items are classified whether or not they are fit for the punishment. We study three versions of punishment-full, expansile and partial punishment, and prove the corresponding bounds of \(PoA^1\) (Price of Anarchy).

Research supported by NSFC (11201333).

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

References

  1. Dixit, A., Susan, S., David, R.: Games of Strategy, 3rd edn. W.W. Norton Company (2009)

    Google Scholar 

  2. Bilò, V.: On the packing of selfish items. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS2006), pp. 45–54. IEEE, Rhodes (2006)

    Google Scholar 

  3. Fernandes, C.G., Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.: Prices of anarchy of selfish 2D bin packing games. Int. J. Found. Comput. Sci. 30(3), 355–374 (2019)

    Article  MathSciNet  Google Scholar 

  4. Dósa, G., Epstein, L.: Generalized selfish bin packing (2012). ArXiv:1202.4080 [cs.GT]

  5. Dósa, G., Epstein, L.: A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150, 6–12 (2019)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Dósa, G., Kellerer, H., Tuza, Z.: Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1), 160–169 (2019)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  9. Epstein, L.: Selfish bin packing problems. In: Kao, M.Y. (eds) Encyclopedia of Algorithms. LNCS, pp. 1927–1930, Springer, Boston (2016). https://doi.org/10.1007/978-1-4939-2864-4

  10. Wang, Z., Han, X., Dósa, G., Tuza, Z.: General bin packing game: interest taken into account. Algorithmica 80, 1534–1555 (2018)

    Article  MathSciNet  Google Scholar 

  11. Zhang, C., Zhang, G.: Cost-sharing mechanisms for selfish bin packing. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 355–368. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-71150-8_30

    Chapter  Google Scholar 

  12. Zhang, C., Zhang, G.: From packing rules to cost-sharing mechanisms. J. Comb. Optim. 1–16 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, Shanghai University, Shanghai, 201444, People’s Republic of China

    Weiwei Zhang & Alin Gao

  2. Glorious Sun School of Business and Management, Donghua University, Shanghai, 200051, People’s Republic of China

    Ling Gai

Authors
  1. Weiwei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alin Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ling Gai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ling Gai .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, China

    Zhao Zhang

  2. Texas Southern University, Houston, TX, USA

    Wei Li

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

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, W., Gao, A., Gai, L. (2020). Selfish Bin Packing with Parameterized Punishment. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57602-8_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57601-1

  • Online ISBN: 978-3-030-57602-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation