[5] Maria-Florina F Balcan, Tuomas Sandholm, and Ellen Vitercik. Sample complexity of automated mechanism design. Advances in Neural Information Processing Systems, 29, 2016.
[6] Jonathan Baron, Barbara A. Mellers, Philip E. Tetlock, Eric Stone, and Lyle H. Ungar. Two Reasons to Make Aggregated Probability Forecasts More Extreme. Decision Analysis, 11(2):133-145, June 2014.
[7] John M. Bates and Clive W. J. Granger. The Combination of Forecasts. Journal of the Operational Research Society, 20(4):451-468, December 1969.
[8] Robert F. Bordley. A Multiplicative Formula for Aggregating Probability Assessments. Management Science, 28(10):1137-1148, 1982. Publisher: INFORMS.
[9] Glenn W. Brier. Verification of Forecasts Expressed in Terms of Probability. Monthly Weather Review, 78(1):1-3, January 1950.
[10] Johannes Brustle, Yang Cai, and Constantinos Daskalakis. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 715–761, Virtual Event Hungary, July 2020. ACM.
[11] Yang Cai and Constantinos Daskalakis. Learning Multi-Item Auctions with (or without) Samples. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 516–527, Berkeley, CA, October 2017. IEEE.
[12] Clément L. Canonne. A short note on learning discrete distributions, 2020.
[13] Nicolo Cesa-Bianchi and Gabor Lugosi. Prediction, Learning, and Games. Cambridge University Press, Cambridge, 2006.
[14] Yi-Chun Chen, Manuel Mueller-Frank, and Mallesh Pai. The Wisdom of the Crowd and Higher-Order Beliefs. In Proceedings of the 24th ACM Conference on Economics and Computation, pages 450–450, London United Kingdom, July 2023. ACM.
[15] Gerda Claeskens, Jan R. Magnus, Andrey L. Vasnev, and Wendun Wang. The forecast combination puzzle: A simple theoretical explanation. International Journal of Forecasting, 32(3):754-762, July 2016.
[16] Robert T. Clemen. Combining forecasts: A review and annotated bibliography. International Journal of Forecasting, 5(4):559-583, January 1989.
[17] Richard Cole and Tim Roughgarden. The sample complexity of revenue maximization. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14, pages 243-252, New York, New York, 2014. ACM Press.
[18] Henrique De Oliveira, Yuhta Ishii, and Xiao Lin. Robust Merging of Information. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 341-342, Budapest Hungary, July 2021. ACM.
[19] Nikhil R. Devanur, Zhiyi Huang, and Christos-Alexandros Psomas. The sample complexity of auctions with side information. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 426-439, Cambridge MA USA, June 2016. ACM.
[20] Peerapong Dhangwatnotai, Tim Roughgarden, and Qiqi Yan. Revenue maximization with a single sample. Games and Economic Behavior, 91:318-333, May 2015.
[21] R. Glen Donaldson and Mark Kamstra. Forecast combining with neural networks. Journal of Forecasting, 15(1):49-61, January 1996.
[22] Rafael Frongillo, Robert Gomez, Anish Thilagar, and Bo Waggoner. Efficient Competitions and Online Learning with Strategic Forecasters. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 479-496, Budapest Hungary, July 2021. ACM.
[23] Véronique Genre, Geoff Kenny, Aidan Meyler, and Allan Timmermann. Combining expert forecasts: Can anything beat the simple average? International Journal of Forecasting, 29(1):108-121, January 2013.
[24] John Geweke and Charles Whiteman. Chapter 1 Bayesian Forecasting. In Handbook of Economic Forecasting, volume 1, pages 3-80. Elsevier, 2006.
[25] Yannai A. Gonczarowski and S. Matthew Weinberg. The Sample Complexity of Up-to-  $\epsilon$  Multidimensional Revenue Maximization. Journal of the ACM, 68(3):1-28, March 2021.