Advertisement

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract)

  • Longkun Guo
  • Chenchen WuEmail author
  • Huahui Yu
  • Xiaoyan Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11917)

Abstract

In this work, we extend the set cover game, which is called as “generalized cover-sets game”. We propose several approximate cost allocation methods for three different game settings.

Keywords

Set cover Cost sharing Mechanism design 

Notes

Acknowledgements

The research of the first author is supported by Natural Science Foundation of China (No. 61772005) and Natural Science Foundation of Fujian Province (No. 2017J01753). The second author is supported by Natural Science Foundation of China (No. 11971349). The last author is supported by National Natural Science Foundation of China (No. 11871280 and No. 11471003) and Qing Lan Project.

References

  1. 1.
    Feige, U.: A threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Gupta, A., Krishnaswamy, R., Kumar, A., Panigrahi, D.: Online and dynamic algorithms for set cover. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 537–550. ACM, Montreal (2017)Google Scholar
  3. 3.
    Li, X.Y., Sun, Z., Wang, W.Z., Lou, W.: Cost sharing and strategyproof mechanisms for set cover games. J. Comb. Optim. 3, 259–284 (2010)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Longkun Guo
    • 1
  • Chenchen Wu
    • 2
    Email author
  • Huahui Yu
    • 3
  • Xiaoyan Zhang
    • 3
  1. 1.College of Mathematics and Computer ScienceFuzhou UniversityFuzhouPeople’s Republic of China
  2. 2.College of ScienceTianjin University of TechnologyTianjinPeople’s Republic of China
  3. 3.School of Mathematical Science, Institute of MathematicsNanjing Normal UniversityJiangsuChina

Personalised recommendations