Sketching Stochastic Valuation Functions

References

• Asadpour A, Nazerzadeh H (2016) Maximizing stochastic monotone submodular functions. Management Sci. 62(8):2374–2391.Link, Google Scholar
• Badanidiyuru A, Dobzinski S, Fu H, Kleinberg R, Nisan N, Roughgarden T (2012) Sketching valuation functions. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1025–1035. Google Scholar
• Balcan MF, Harvey NJ (2011) Learning submodular functions. Proc 43rd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 793–802.Google Scholar
• Bian AA, Mirzasoleiman B, Buhmann J, Krause A (2017) Guaranteed non-convex optimization: Submodular maximization over continuous domains. Singh A, Zhu J, eds. Artificial Intelligence Statist. (PMLR, New York), vol. 54, 111–120.Google Scholar
• Cohavi K, Dobzinski S (2017) Faster and simpler sketches of valuation functions. ACM Trans. Algorithms 13(3):1–9.Google Scholar
• Cohen D, Mitra B, Lesota O, Rekabsaz N, Eickhoff C (2021) Not all relevance scores are equal: Efficient uncertainty and calibration modeling for deep retrieval models. Proc. 44th Internat. ACM SIGIR Conf. Res. Development Inform. Retrieval (Association for Computing Machinery, New York), 654–664.Google Scholar
• Goemans MX, Harvey NJA, Iwata S, Mirrokni V (2009) Approximating submodular functions everywhere. Proc. 20th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 535–544.Google Scholar
• He X, Pan J, Jin O, Xu T, Liu B, Xu T, Shi Y, et al. (2014) Practical lessons from predicting clicks on ads at facebook. Proc. 8th Internat. Workshop Data Mining Online Advertising (Association for Computing Machinery, New York), 1–9.Google Scholar
• Klass MJ (1981) A method of approximating expectations of functions of sums of independent random variables. Ann. Probability 9(3):413–428.Google Scholar
• Kleinberg J, Raghu M (2018) Team performance with test scores. ACM Trans. Econom. Comput. 6(3–4):1–26. Google Scholar
• Lee D, Vojnovic M, Yun SY (2023) Test score algorithms for budgeted stochastic utility maximization. INFORMS J. Optim. 5(1):27–67.Link, Google Scholar
• Lehmann B, Lehmann D, Nisan N (2006) Combinatorial auctions with decreasing marginal utilities. Games Econom. Behav. 55(2):270–296.Google Scholar
• Mehta A, Nadav U, Psomas A, Rubinstein A (2020) Hitting the high notes: Subset selection for maximizing expected order statistics. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Proc. Adv. Neural Informat. Processing Systems, vol. 33 (Curran Associates Inc., Red Hook, NY), 15800–15810.Google Scholar
• Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14(1):265–294.Google Scholar
• Sekar S, Vojnovic M, Yun S (2021) A test score-based approach to stochastic submodular optimization. Management Sci. 67(2):1075–1092.Link, Google Scholar
• Soma T, Yoshida Y (2015) A generalization of submodular cover via the diminishing return property on the integer lattice. Cortes C, Lawrence N, Lee D, Sugiyama M, Garnett R, eds. Proc. Adv. Neural Inform. Processing Systems, vol. 28 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Topkis DM (1978) Minimizing a submodular function on a lattice. Oper. Res. 26(2):305–321.Link, Google Scholar
• Zhu J, Wang J, Cox IJ, Taylor MJ (2009) Risky business: Modeling and exploiting uncertainty in information retrieval. Proc. 32nd Internat. ACM SIGIR Conf. Res. Development Inform. Retrieval (Association for Computing Machinery, New York), 99–106.Google Scholar