[17] Jeremy Bulow and Paul Klemperer. Auctions versus negotiations. The American Economic Review, 1996.
[18] Tanmoy Chakraborty, Zhiyi Huang, and Sanjeev Khanna. Dynamic and nonuniform pricing strategies for revenue maximization. SIAM Journal on Computing, 2013.
[19] Ed H. Clarke. Multipart pricing of public goods. Public Choice, 1971.
[20] Jacques Crémer and Richard P McLean. Full extraction of the surplus in bayesian and dominant strategy auctions. *Econometrica: Journal of the Econometric Society*, pages 1247–1257, 1988.
[21] Constantinos Daskalakis and George Pierrakos. Simple, optimal and efficient auctions. In International Workshop on Internet and Network Economics (WINE). Springer, 2011.
[22] Nikhil R Devanur, Zhiyi Huang, and Christos-Alexandros Psomas. The sample complexity of auctions with side information. In ACM Symposium on Theory of Computing (STOC), 2016.
[23] Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos, and Yaron Singer. Efficiency-revenue trade-offs in auctions. In International Colloquium on Automata, Languages, and Programming (ICALP), 2012.
[24] Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. Optimal auctions through deep learning. In International Conference on Machine Learning (ICML), pages 1706-1715. PMLR, 2019.
[25] Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review, 97(1):242-259, 2007.
[26] Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, and Xizhi Tan. Improved price of anarchy via predictions. In Proceedings of the 23rd ACM Conference on Economics and Computation (EC), 2022.
[27] Andrew V. Goldberg, Jason D. Hartline, and Andrew Wright. Competitive auctions and digital goods. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001.
[28] Theodore Groves. Incentives in teams. Econometrica, 1973.
[29] Faruk Gul and Ennio Stacchetti. Walrasian equilibrium with gross substitutes. Journal of Economic theory, 87(1):95-124, 1999.
[30] Venkatesan Guruswami, Jason D Hartline, Anna R Karlin, David Kempe, Claire Kenyon, and Frank McSherry. On profit-maximizing envy-free pricing. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
[31] Jason D Hartline and Tim Roughgarden. Simple versus optimal mechanisms. In Proceedings of the 10th ACM conference on Electronic commerce, pages 225-234, 2009.
[32] Misha Khodak, Maria-Florina Balcan, Ameet Talwalkar, and Sergei Vassilvitskii. Learning predictions for algorithms with predictions. Advances in Neural Information Processing Systems, 35:3542–3555, 2022.
[33] Robert Kleinberg and Yang Yuan. On the ratio of revenue to welfare in single-parameter mechanism design. In Proceedings of the Fourteenth ACM Conference on Electronic Commerce (EC), 2013.
[34] Vijay Krishna and Motty Perry. Efficient mechanism design. Available at SSRN 64934, 1998.
[35] Anton Likhodedov, Tuomas Sandholm, et al. Approximating revenue-maximizing combinatorial auctions. In AAAI, volume 5, pages 267-274, 2005.
[36] Alexey Malakhov and Rakesh V Vohra. An optimal auction for capacity constrained bidders: a network perspective. Economic Theory, 2009.