Risk Minimization as a Framework for Online Allocation in Display Advertising

References

• Agrawal S, Devanur NR (2014) Bandits with concave rewards and convex knapsacks. Proc. 15th ACM Conf. Econom. Comput. (ACM, New York), 989–1006.Google Scholar
• Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
• Arora S, Hazan E, Kale S (2012) The multiplicative weights update method: A meta-algorithm and applications. Theory Comput. 8(1):121–164.Crossref, Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J. ACM 65(3):1–55.Crossref, Google Scholar
• Balseiro SR, Lu H, Mirrokni VS (2022) The best of many worlds: Dual mirror descent for online allocation problems. Oper. Res. 71(1):101–119.Link, Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Bray RL (2024) Logarithmic regret in multisecretary and online linear programs with continuous valuations. Oper. Res. 73(4):2188–2203.Link, Google Scholar
• Devanur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 71–78.Google Scholar
• Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. Proc. 50th Ann. IEEE Sympos. Foundations Comput. Sci. (ACM, New York), 117–126.Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with uniformly bounded loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Kesselheim T, Radke K, Tönnis A, Vöcking B (2014) Primal beats dual on online packing LPs in the random-order model. Proc. 46th Annual ACM Sympos. Theory Comput. (ACM, New York), 303–312.Google Scholar
• Li X, Ye Y (2022) Online linear programming: Dual convergence, new algorithms, and regret bounds. Oper. Res. 70(5):2948–2966.Link, Google Scholar
• Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM 54(5):22.Crossref, Google Scholar
• Mirrokni V, Gharan SO, Zadimoghaddam M (2012) Simultaneous approximations for adversarial and stochastic online budgeted allocation. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (ACM, New York), 1690–1701.Google Scholar
• Shamsi D, Holtan M, Luenberger R, Ye Y (2014) Online allocation rules in display advertising. Preprint, submitted July 22, https://arxiv.org/abs/1407.5710.Google Scholar
• Vera A, Banerjee S (2020) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar