Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended 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.
KeywordsSet cover Cost sharing Mechanism design
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.
- 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