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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Feige, U.: A threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)
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)
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)
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Guo, L., Wu, C., Yu, H., Zhang, X. (2019). Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract). In: Tagarelli, A., Tong, H. (eds) Computational Data and Social Networks. CSoNet 2019. Lecture Notes in Computer Science(), vol 11917. Springer, Cham. https://doi.org/10.1007/978-3-030-34980-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-34980-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34979-0
Online ISBN: 978-3-030-34980-6
eBook Packages: Computer ScienceComputer Science (R0)