Online Advertisement Allocation Under Customer Choices and Algorithmic Fairness

References

• Alptekinoğlu A, Banerjee A, Paul A, Jain N (2013) Inventory pooling to deliver differentiated service. Manufacturing Service Oper. Management 15(1):33–44.Link, Google Scholar
• Atkinson AB (1970) On the measurement of inequality. J. Econom. Theory 2(3):244–263.Crossref, Google Scholar
• Balseiro SR, Besbes O, Pizarro D (2023) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res., ePub ahead of print May 9, https://doi.org/10.1287/opre.2023.2441.Link, Google Scholar
• Balseiro S, Lu H, Mirrokni V (2021) Regularized online allocation problems: Fairness and beyond. Internat. Conf. Machine Learning (PMLR, New York), 630–639.Google Scholar
• Balseiro SR, Feldman J, Mirrokni V, Muthukrishnan S (2014) Yield optimization of display advertising with ad exchange. Management Sci. 60(12):2886–2907.Link, Google Scholar
• Bateni MH, Chen Y, Ciocan DF, Mirrokni V (2022) Fair resource allocation in a volatile marketplace. Oper. Res. 70(1) 288–308.Link, Google Scholar
• Bernstein F, Modaresi S, Sauré D (2019) A dynamic clustering approach to data-driven assortment personalization. Management Sci. 65(5):2095–2115.Abstract, Google Scholar
• Bertsimas D, Farias VF, Trichakis N (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.Link, Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Caro F, Martínez-de Albéniz V, Rusmevichientong P (2014) The assortment packing problem: Multiperiod assortment planning for short-lived products. Management Sci. 60(11):2701–2721.Link, Google Scholar
• Chen X, Ma W, Simchi-Levi D, Xin L (2023) Assortment planning for recommendations at checkout under inventory constraints. Math. Oper. Res. 49(1):297–325.Link, Google Scholar
• Cheung WC, Simchi-Levi D (2017) Thompson sampling for online personalized assortment optimization problems with multinomial logit choice models. Preprint, submitted November 27, https://dx.doi.org/10.2139/ssrn.3075658.Google Scholar
• Choi H, Mela CF, Balseiro SR, Leary A (2020) Online display advertising markets: A literature review and future directions. Inform. Systems Res. 31(2):556–575.Link, Google Scholar
• Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
• Dave P (2021) Study flags gender bias in Facebook’s ads tools. Reuters (April 9), https://www.reuters.com/technology/study-flags-gender-bias-facebooks-ads-tools-2021-04-09/.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Dong L, Shi D, Zhang F (2022) 3D printing and product assortment strategy. Management Sci. 68(8):5724–5744.Link, Google Scholar
• Feldman J, Zhang DJ, Liu X, Zhang N (2022) Customer choice models vs. machine learning: Finding optimal product displays on Alibaba. Oper. Res. 70(1):309–328.Link, Google Scholar
• Feldman M, Sorelle A, Friedler JM, Scheidegger C, Venkatasubramanian S (2015) Certifying and removing disparate impact. Proc. 21th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining (Association for Computing Machinery, New York), 259–268.Google Scholar
• Gallego G, Ratliff R, Shebalov S (2015a) A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2015b) Online resource allocation with customer choice. Preprint, submitted November 5, https://arxiv.org/abs/1511.01837.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Hao X, Peng Z, Ma Y, Wang G, Jin J, Hao J, Chen S, et al. (2020) Dynamic knapsack optimization toward efficient multi-channel sequential advertising. Proc. 37th Internat. Conf. Machine Learning (PMLR, New York), 4060–4070.Google Scholar
• Hojjat A, Turner J, Cetintas S, Yang J (2017) A unified framework for the scheduling of guaranteed targeted display advertising under reach and frequency requirements. Oper. Res. 65(2):289–313.Link, Google Scholar
• Imana B, Korolova A, Heidemann J (2021) Auditing for discrimination in algorithms delivering job ads. Proc. Web Conf. 2021 (Association for Computing Machinery, New York), 3767–3778.Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Jiang J, Wang S, Zhang J (2023) Achieving high individual service levels without safety stock? Optimal rationing policy of pooled resources. Oper. Res. 71(1):358–377.Link, Google Scholar
• Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper. Res. 68(4):1020–1037.Link, Google Scholar
• Kumar A, Kleinberg J (2000) Fairness measures for resource allocation. Proc. 41st Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 75–85.Google Scholar
• Lambrecht A, Tucker C (2019) Algorithmic bias? An empirical study of apparent gender-based discrimination in the display of stem career ads. Management Sci. 65(7):2966–2981.Link, Google Scholar
• Lejeune MA, Turner J (2019) Planning online advertising using gini indices. Oper. Res. 67(5):1222–1245.Link, Google Scholar
• Liu Q, Van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Luce RD (2012) Individual Choice Behavior: A Theoretical Analysis (Courier Corporation, Chelmsford, MA).Google Scholar
• Lyu G, Chou MC, Teo C-P, Zheng Z, Zhong Y (2022) Stochastic knapsack revisited: The service level perspective. Oper. Res. 70(2):729–747.Link, Google Scholar
• Lyu G, Cheung W-C, Chou MC, Teo C-P, Zheng Z, Zhong Y (2019) Capacity allocation in flexible production networks: Theory and applications. Management Sci. 65(11):5091–5109.Link, Google Scholar
• Ma W, Xu P, Xu Y (2020) Group-level fairness maximization in online bipartite matching. Preprint, submitted November 27, https://arxiv.org/abs/2011.13908.Google Scholar
• Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoret. Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• Microsoft (2020) Partner Incentives Co-op Guidebook: Business Policies for FY21 (Microsoft Corporation, Redmond, WA).Google Scholar
• Nakamura A, Abe N (2005) Improvements to the linear programming based scheduling of web advertisements. Electronics Commerce Res. 5(1):75–98.Crossref, Google Scholar
• Nilforoshan H, Gaebler JD, Shroff R, Goel S (2022) Causal conceptions of fairness and their consequences. Internat. Conf. Machine Learning (PMLR, New York), 16848–16887.Google Scholar
• Rubin RB (1978) The uniform guidelines on employee selection procedures: Compromises and controversies. Catholic Univ. Law Rev. 28:605.Google Scholar
• Rusmevichientong P, Shen ZJM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Shen H, Li Y, Chen Y, Pan K (2021a) Integrated ad delivery planning for targeted display advertising. Oper. Res. 69(5):1409–1429.Link, Google Scholar
• Shen H, Li Y, Guan J, Tso GKF (2021b) A planning approach to revenue management for non-guaranteed targeted display advertising. Production Oper. Management 30(6):1583–1602.Crossref, Google Scholar
• Shi C, Wei Y, Zhong Y (2019) Process flexibility for multiperiod production systems. Oper. Res. 67(5):1300–1320.Link, Google Scholar
• Speicher T, Ali M, Venkatadri G, Ribeiro FN, Arvanitakis G, Benevenuto F, Gummadi KP, Loiseau P, Mislove A (2018) Potential for discrimination in online targeted advertising. Conf. Fairness Accountability Transparency (PMLR, New York), 5–19.Google Scholar
• Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.Crossref, Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2021) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.Google Scholar
• Turner J (2012) The planning of guaranteed targeted display advertising. Oper. Res. 60(1):18–33.Link, Google Scholar
• Wang R (2012) Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40(6):492–497.Crossref, Google Scholar
• Xu K, Zhong Y (2020) Information and memory in dynamic resource allocation. Oper. Res. 68(6):1698–1715.Link, Google Scholar
• Ye Z, Zhang DJ, Zhang H, Zhang R, Chen X, Xu Z (2023) Cold start to improve market thickness on online advertising platforms: Data-driven algorithms and field experiments. Management Sci. 69(7):3838–3860.Link, Google Scholar
• Young HP (1995) Equity: In Theory and Practice (Princeton University Press, Princeton, NJ).Google Scholar
• Zhong Y, Zheng Z, Chou MC, Teo C-P (2017) Resource pooling and allocation policies to deliver differentiated service. Management Sci. 64(4):1555–1573.Link, Google Scholar