[4] Nima Anari, Gagan Goel, and Afshin Nikzad. Mechanism design for crowdsourcing: An optimal 1-1/e competitive budget-feasible mechanism for large markets. In IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 266–275, 2014.
[5] Cigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan, and Wei Lu. Revenue maximization in incentivized social advertising. Proceedings of the VLDB Endowment (PVLDB), 10(11): 1238-1249, 2017.
[6] Lawrence M Ausubel, Paul Milgrom, et al. The lovely but lonely vickrey auction. Combinatorial auctions, 17:22-26, 2006.
[7] Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S Matthew Weinberg. A simple and approximately optimal mechanism for an additive buyer. Journal of the ACM (JACM), 67(4): 1-40, 2020.
[8] Eric Balkanski, Adam Breuer, and Yaron Singer. Non-monotone submodular maximization in exponentially fewer iterations. In Advances in Neural Information Processing Systems (NeurIPS), pages 2359-2370, 2018.
[9] Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, and Xizhi Tan. Deterministic budget-feasible clock auctions. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2940-2963, 2022.
[10] Xiaohui Bei, Ning Chen, Nick Gravin, and Pinyan Lu. Budget feasible mechanism design: from prior-free to bayesian. In ACM Symposium on the Theory of Computing (STOC), pages 449-458, 2012.
[11] Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. Maximizing social influence in nearly optimal time. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 946-957, 2014.
[12] Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. Multi-parameter mechanism design and sequential posted pricing. In ACM Symposium on Theory of Computing (STOC), pages 311-320, 2010.
[13] Ning Chen, Nick Gravin, and Pinyan Lu. On the approximability of budget feasible mechanisms. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 685-699, 2011.
[14] Wei Chen, Chi Wang, and Yajun Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 1029-1038, 2010.
[15] Xi Chen, George Matikas, Dimitris Paparas, and Mihalis Yannakakis. On the complexity of simple and optimal deterministic mechanisms for an additive buyer. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2036-2049, 2018.
[16] Matthew Fahrbach, Vahab Mirrokni, and Morteza Zadimoghaddam. Non-monotone submodular maximization with nearly optimal adaptivity and query complexity. In International Conference on Machine Learning (ICML), pages 1833-1842, 2019.
[17] David Gale. The law of supply and demand. Mathematica Scandinavica, 3(1):155-169, 1955.
[18] Nick Gravin, Yaonan Jin, Pinyan Lu, and Chenhao Zhang. Optimal budget-feasible mechanisms for additive valuations. ACM Transactions on Economics and Computation, 8(4):21:1-21:15, 2020.
[19] Kai Han, Keke Huang, Xiaokui Xiao, Jing Tang, Aixin Sun, and Xueyan Tang. Efficient algorithms for adaptive influence maximization. Proceedings of the VLDB Endowment, 11(9): 1029-1040, 2018.
[20] Kai Han, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu, Shaojie Tang, and He Huang. Approximation algorithms for submodular data summarization with a knapsack constraint. Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 5(1):1-31, 2021.
[21] Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Cigdem Aslay, and Laks VS Lakshmanan. Efficient and effective algorithms for revenue maximization in social advertising. In ACM Conference on Management of Data (SIGMOD), pages 671-684, 2021.
[22] He Huang, Kai Han, Shuang Cui, and Jing Tang. Randomized pricing with deferred acceptance for revenue maximization with submodular objectives. In International World Wide Web Conference (WWW), pages 3530-3540, 2023.