Markovian Search with Ex Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring

References

• Adelman D, Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3):712–727.Link, Google Scholar
• Agrawal S, Devanur NR (2014) Fast algorithms for online stochastic convex programming. Proc. 26th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1405–1424.Google Scholar
• Agarwal A, Ghuge R, Nagarajan V (2024) Semi-bandit learning for monotone stochastic optimization. Proc. IEEE 65th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 1260–1274.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
• Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2):930–972.Crossref, Google Scholar
• Alaei S, Makhdoumi A, Malekian A (2025) Revenue maximization under unknown private values with nonobligatory inspection. Oper. Res. 73(3):1307–1319.Google Scholar
• Aleksandrov MD, Aziz H, Gaspers S, Walsh T (2015) Online fair division: Analysing a food bank problem. Proc. 24th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 2540–2546.Google Scholar
• Anari N, Niazadeh R, Saberi A, Shameli A (2019) Nearly optimal pricing algorithms for production constrained and laminar Bayesian selection. Proc. ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 91–92.Google Scholar
• Aouad A, Ji J, Shaposhnik Y (2026) The Pandora’s box problem with sequential inspections. Oper. Res., ePub ahead of print May 7, https://doi.org/10.1287/opre.2024.0733.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
• Arsenis M, Kleinberg R (2022) Individual fairness in prophet inequalities. Preprint, submitted May 20, https://arxiv.org/abs/2205.10302.Google Scholar
• Asadpour A, Niazadeh R, Saberi A, Shameli A (2023) Sequential submodular maximization and applications to ranking an assortment of products. Oper. Res. 71(4):1154–1170.Link, Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J. ACM 65(3):1–55.Crossref, Google Scholar
• Baek J, Farias VF (2024) Fair exploration via axiomatic bargaining. Management Sci. 70(12):8922–8939.Google Scholar
• Baek J, Makhdoumi A (2025) The feedback loop of statistical discrimination. Proc. 5th ACM Conf. Equity Access Algorithms Mechanisms Optim. (EAAMO '25) (Association for Computing Machinery, New York), 301.Google Scholar
• Balseiro SR, Lu H, Mirrokni V (2023) The best of many worlds: Dual mirror descent for online allocation problems. Oper. Res. (1):101–119.Link, Google Scholar
• Bansak K, Lee S, Manshadi V, Niazadeh R, Paulson E (2026) Dynamic matching with postallocation service and its application to refugee resettlement. Management Sci., ePub ahead of print May 8, https://doi.org/10.1287/mnsc.2024.07817.Google Scholar
• Barocas S, Hardt M, Narayanan A (2017) Fairness in machine learning. Nips Tutorial 1:2.Google Scholar
• Baruah SK, Cohen NK, Plaxton CG, Varvel DA (1993) Proportionate progress: A notion of fairness in resource allocation. Proc. 25th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 345–354.Google Scholar
• Bateni M, Chen Y, Ciocan DF, Mirrokni V (2022) Fair resource allocation in a volatile marketplace. Oper. Res. 70(1):288–308.Link, Google Scholar
• Becker GS (2010) The Economics of Discrimination (University of Chicago Press, Chicago).Google Scholar
• Bertrand M, Mullainathan S (2004) Are Emily and Greg more employable than Lakisha and Jamal? A field experiment on labor market discrimination. Amer. Econom. Rev. 94(4):991–1013.Crossref, Google Scholar
• Bertsimas D, Farias VF, Trichakis N (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.Link, Google Scholar
• Beyhaghi H, Kleinberg R (2019) Pandora’s problem with nonobligatory inspection. Proc. ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 131–132.Google Scholar
• Blackwell D (1956) An analog of the minimax theorem for vector payoffs. Pacific J. Math. 6(4):1–8.Crossref, Google Scholar
• Bock L (2015) Work Rules!: Insights from inside Google That Will Transform How You Live and Lead (Twelve).Google Scholar
• Boodaghians S, Fusco F, Lazos P, Leonardi S (2023) Pandora’s box problem with order constraints. Math. Oper. Res. 48(1):498–519.Link, Google Scholar
• Brown DB, Uru C (2024) Sequential search with acquisition uncertainty. Management Sci. 70(11):7712–7729.Google Scholar
• Brown DB, Uru C (2025) Data-driven sequential search. Preprint, submitted July 22, http://dx.doi.org/10.2139/ssrn.5348531.Google Scholar
• Bubeck S. (2015) Convex optimization: Algorithms and complexity. Foundations Trends Machine Learn. 8(3–4):231–357.Crossref, Google Scholar
• Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2):270–286.Link, Google Scholar
• Buchbinder N, Jain K, Singh M (2009) Secretary problems and incentives via linear programming. ACM SIGecom Exchanges 8(2):1–5.Crossref, Google Scholar
• Cai Y, Daskalakis C, Weinberg SM (2012) Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization. Proc. IEEE 53rd Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 130–139.Google Scholar
• Cai W, Gaebler J, Garg N, Goel S (2020) Fair allocation through selective information acquisition. Proc. AAAI/ACM Conf. AI, Ethics, and Society (Association for Computing Machinery, New York), 22–28.Google Scholar
• Canay IA, Mogstad M, Mountjoy J (2020) On the use of outcome tests for detecting bias in decision making. Technical report, National Bureau of Economic Research, Cambridge, MA.Google Scholar
• Caratheódory C (1911) Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen. Rendiconti Circolo Matematico Palermo (1884-1940) 32(1):193–217.Crossref, Google Scholar
• Cayci S, Gupta S, Eryilmaz A (2020) Group-fair online allocation in continuous time. Adv. Neural Inform. Processing Systems, vol. 33 (Curran Associates Inc., Red Hook, NY), 13750–13761.Google Scholar
• Chawla S, Gergatsouli E, Teng Y, Tzamos C, Zhang R (2020) Pandora’s box with correlations: Learning and approximation. Proc. IEEE 61st Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 1214–1225.Google Scholar
• Chen Q, Golrezaei N, Susan F (2022a) Fair assortment planning. Preprint, submitted August 15, https://arxiv.org/abs/2208.07341.Google Scholar
• Chen X, Zhang X, Zhou Y (2021) Fairness-aware online price discrimination with nonparametric demand models. Preprint, submitted November 16, https://arxiv.org/abs/2111.08221.Google Scholar
• Chen X, Lyu J, Wang Y, Zhou Y (2022b) Fairness-aware network revenue management with demand learning. Preprint, submitted July 22, https://arxiv.org/abs/2207.11159.Google Scholar
• Chetty R, Friedman JN, Saez E, Turner N, Yagan D (2020) Income segregation and intergenerational mobility across colleges in the United States. Quart. J. Econom. 135(3):1567–1633.Crossref, Google Scholar
• Cohen MC, Elmachtoub AN, Lei X (2022) Price discrimination with fairness constraints. Management Sci. 68(12):8536–8552.Link, Google Scholar
• Combettes CW, Pokutta S (2023) Revisiting the approximate carathéodory problem via the Frank-Wolfe algorithm. Math. Programming 197(1):191–214.Crossref, Google Scholar
• Correa J, Cristi A, Duetting P, Norouzi-Fard A (2021) Fairness and bias in online selection. Meila M, Zhang T, eds. Proc. 38th Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 139 (PMLR, New York), 2112–2121.Google Scholar
• Dantzig BG, Ford LR, Fulkerson DR (1956) A primal-dual algorithm for linear programs. Linear Inequalities Related Systems 38:171–182.Google Scholar
• Delong S, Farhadi A, Niazadeh R, Sivan B, Udwani R (2023) Online bipartite matching with reusable resources. Math. Oper. Res. 49(3):1825–1854.Link, Google Scholar
• DeOrtentiis PS, Van Iddekinge CH, Wanberg CR (2022) Different starting lines, different finish times: The role of social class in the job search process. J. Appl. Psych. 107(3):444.Crossref, Google Scholar
• Devanur NR, Jain K, Sivan B, Wilkens CA (2011) Near optimal online algorithms and fast approximation algorithms for resource allocation problems. J. ACM 66(1):1–41.Google Scholar
• Doval L (2018) Whether or not to open Pandora’s box. J. Econom. Theory 175:127–158.Crossref, Google Scholar
• Dughmi S, Hartline J, Kleinberg RD, Niazadeh R (2021) Bernoulli factories and black-box reductions in mechanism design. J. ACM 68(2):1–30.Crossref, Google Scholar
• Dumitriu I, Tetali P, Winkler P (2003) On playing golf with two balls. SIAM J. Discrete Math. 16(4):604–615.Crossref, Google Scholar
• Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. Proc. 3rd Innovations Theoret. Comput. Sci. Conf. (Association for Computing Machinery, New York), 214–226.Google Scholar
• Ekbatani F, Feng Y, Niazadeh R (2023) Online resource allocation with buyback: Optimal algorithms via primal-dual. Proc. 24th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 583.Google Scholar
• Ekbatani F, Feng Y, Kash I, Niazadeh R (2025) Online job assignment. Preprint, submitted June 7, https://arxiv.org/abs/2506.06893.Google Scholar
• Epstein B, Ma W (2024) Selection and ordering policies for hiring pipelines via linear programming. Oper. Res. 72(5):2000–2013.Link, Google Scholar
• Faenza Y, Gupta S, Zhang X (2020) Reducing the feeder effect in public school admissions: A bias-aware analysis for targeted interventions. Preprint, submitted April 22, https://arxiv.org/abs/2004.10846.Google Scholar
• Farajollahzadeh S, Lee S, Manshadi V, Monachou F (2025) Why the Rooney rule fumbles: Limitations of interview-stage diversity interventions in labor markets. Proc. 5th ACM Conf. Equity Access Algorithms Mechanisms Optim. (EAAMO '25) (Association for Computing Machinery, New York), 303.Google Scholar
• Feng Y, Niazadeh R (2024) Batching and optimal multistage bipartite allocations. Management Sci.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2021) Robustness of online inventory balancing algorithm to inventory shocks. Preprint, submitted March 2, http://dx.doi.org/10.2139/ssrn.3795056.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2024) Two-stage stochastic matching and pricing with applications to ride hailing. Oper. Res. 72(4):1574–1594.Link, Google Scholar
• Finocchiaro J, Maio R, Monachou F, Patro GK, Raghavan M, Stoica A-A, Tsirtsis S (2021) Bridging machine learning and mechanism design towards algorithmic fairness. Proc. ACM Conf. Fairness, Accountability, and Transparency (Association for Computing Machinery, New York), 489–503.Google Scholar
• Freund D, Hssaine C (2025) Fair incentives for repeated engagement. Production Oper. Management 34(1):16–29.Crossref, Google Scholar
• Freund D, Lykouris T, Paulson E, Sturt B, Weng W (2023) Group fairness in dynamic refugee assignment. Preprint, submitted January 25, https://arxiv.org/abs/2301.10642.Google Scholar
• Gaddis SM (2013) The influence of habitus in the relationship between cultural capital and academic achievement. Soc. Sci. Res. 42(1):1–13.Crossref, Google Scholar
• Gao Y, Kroer C (2023) Infinite-dimensional fisher markets and tractable fair division. Oper. Res. 71(2):688–707.Link, Google Scholar
• Garr SS, Jackson C (2019) Diversity & inclusion technology: The rise of a transformative market. Red Thread Res. and Mercer.Google Scholar
• Gatmiry K, Kesselheim T, Singla S, Wang Y (2022) Bandit algorithms for prophet inequality and Pandora’s box. Preprint, submitted November 16, https://arxiv.org/abs/2211.08586.Google Scholar
• Ghosh A, Nagaraj D, Jain M, Tambe M (2023) Indexability is not enough for whittle: Improved, near-optimal algorithms for restless bandits. Proc. Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1294–1302.Google Scholar
• Gittins JC (1979) Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc.: Ser. B (Methodological) 41(2):148–164.Crossref, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Golrezaei N, Niazadeh R, Patel KK, Susan F (2024) Online combinatorial optimization with group fairness constraints. Proc. Thirty-Third Internat. Joint Conf. Artificial Intelligence (IJCAI '24), Article 44, 394–402 .Google Scholar
• Gong X-Y, Goyal V, Iyengar GN, Simchi-Levi D, Udwani R, Wang S (2022) Online assortment optimization with reusable resources. Management Sci. 68(7):4772–4785.Link, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169–197.Crossref, Google Scholar
• Grötschel M, Lovász L, Schrijver A (2012) Geometric Algorithms and Combinatorial Optimization, vol. 2 (Springer Science & Business Media).Google Scholar
• Guha S, Munagala K, Shi P (2010) Approximation algorithms for restless bandit problems. J. ACM 58(1):1–50.Crossref, Google Scholar
• Gupta S, Kamble V (2021) Individual fairness in hindsight. J. Machine Learn. Res. 22(144):1–35.Google Scholar
• Gupta A, Jiang H, Scully Z, Singla S (2019) The Markovian price of information. Lodi A, Nagarajan V, eds. Proc. Internat. Conf. Integer Programming Combinatorial Optim., Lecture Notes in Computer Science, vol. 11480 (Springer, Cham, Switzerland), 233–246.Crossref, Google Scholar
• Hawkins JT (2003) A Langrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Ho DE, Xiang A (2020) Affirmative algorithms: The legal grounds for fairness as awareness. Univ. Chicago Law Rev. Online 134.Google Scholar
• Huang Z, Tang ZG, Wu X, Zhang Y (2019) Online vertex-weighted bipartite matching: Beating 1-1/e with random arrivals. ACM Trans. Algorithms 15(3):1–15.Crossref, Google Scholar
• Jaillet P, Podimata C, Zhou Z (2024) Grace period is all you need: Individual fairness without revenue loss in revenue management. Preprint, submitted February 13, https://arxiv.org/abs/2402.08533.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.Google Scholar
• Kaneko M, Nakamura K (1979) The Nash social welfare function. Econometrica 423–435.Crossref, Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
• Kash I, Procaccia AD, Shah N (2014) No agent left behind: Dynamic fair division of multiple resources. J. Artificial Intelligence Res. 51:579–603.Crossref, Google Scholar
• Kearns M, Neel S, Roth A, Wu ZS (2018) Preventing fairness gerrymandering: Auditing and learning for subgroup fairness. Dy J, Krause A, eds. Proc. 35th Internat. Conf. Machine Learn., vol. 80 (PMLR, New York), 2564–2572.Google Scholar
• Kleinberg J, Raghavan M (2018) Selection problems in the presence of implicit bias. 9th Innovations Theoret. Comput. Sci. Conf. (ITCS 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 94 (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Wadern, Germany), 33:1–33:17.Google Scholar
• Kleinberg RD, Slivkins A (2017) Tutorial: Incentivizing and coordinating exploration. Proc. 18th ACM Conf. Econom. Comput.Google Scholar
• Kleinberg R, Waggoner B, Weyl EG (2016) Descending price coordinates approximately efficient search. Proc. 17th ACM Conf. Electronic Commerce.Google Scholar
• Kleinberg J, Ludwig J, Mullainathan S, Rambachan A (2018) Algorithmic fairness. AEA Papers Proc. 108:22–27.Crossref, Google Scholar
• Komiyama J, Noda S (2024) On statistical discrimination as a failure of social learning: A multiarmed bandit approach. Management Sci. 72(1):442–455.Link, Google Scholar
• Kumar A, Kleinberg J (2006) Fairness measures for resource allocation. SIAM J. Comput. 36(3):657–680.Google Scholar
• Li D, Varakantham P (2022) Efficient resource allocation with fairness constraints in restless multi-armed bandits. Uncertainty in Artificial Intelligence (PMLR, New York), 1158–1167.Google Scholar
• Li F, Liu J, Ji B (2019) Combinatorial sleeping bandits with fairness constraints. IEEE Trans. Network Sci. Engrg. 7(3):1799–1813.Crossref, Google Scholar
• Li D, Raymond L, Bergman P (2025) Hiring as exploration. Rev. Econom. Stud. rdaf040.Google Scholar
• Liao L, Gao Y, Kroer C (2022) Nonstationary dual averaging and online fair allocation. Adv. Neural Inform. Processing Systems, vol. 35 (Curran Associates Inc., Red Hook, NY), 37159–37172.Google Scholar
• Liebkind K, Larja L, Brylka A (2016) Ethnic and gender discrimination in recruitment: Experimental evidence from finland. J. Soc. Political Psych. 4(1):403–426.Crossref, Google Scholar
• Lien RW, Iravani SMR, Smilowitz KR (2014) Sequential resource allocation for nonprofit operations. Oper. Res. 62(2):301–317.Link, Google Scholar
• Liu LT, Dean S, Rolf E, Simchowitz M, Hardt M (2018) Delayed impact of fair machine learning. Dy J, Krause A, eds. Proc. 35th Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 80 (PMLR, New York), 3150–3158.Google Scholar
• Lu W, Sahin O, Wang R (2023) A simple way towards fair assortment planning: Algorithms and welfare implications. Preprint, submitted July 25, http://dx.doi.org/10.2139/ssrn.4514495.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, Simchi-Levi D (2020) Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. 68(6):1787–1803.Link, Google Scholar
• Ma W, Xu P, Xu Y (2022) Group-level fairness maximization in online bipartite matching. Proc. 21st Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1687–1689.Google Scholar
• Manshadi V, Niazadeh R, Rodilitz S (2023) Fair dynamic rationing. Management Sci. 69(11):6818–6836.Google Scholar
• Mehta A (2010) Online matching and ad allocation. Foundations Trends Theoretical Comput. Sci. 8(4):265–368.Crossref, 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, Leme RP, Vladu A, Wong S C-W (2017) Tight bounds for approximate Carathéodory and beyond. Precup D, Teh YW, eds. Proc. 34th Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 70 (PMLR, New York), 2440–2448.Google Scholar
• Nashed SB, Svegliato J, Blodgett SL (2023) Fairness and sequential decision making: Limits, lessons, and opportunities. Preprint, submitted January 13, https://arxiv.org/abs/2301.05753.Google Scholar
• Niazadeh R, Golrezaei N, Wang J, Susan F, Badanidiyuru A (2023) Online learning via offline greedy algorithms: Applications in market design and optimization. Management Sci. 69(7):3797–3817.Link, Google Scholar
• Niño-Mora J (2007) Dynamic priority allocation via restless bandit marginal productivity indices. Top 15:161–198.Crossref, Google Scholar
• Niño-Mora J (2023) Markovian restless bandits and index policies: A review. Mathematics 11(7):1639.Crossref, Google Scholar
• Papadimitriou CH, Tsitsiklis JN (1987) The complexity of Markov decision processes. Math. Oper. Res. 12(3):441–450.Link, Google Scholar
• Papadimitriou CH, Tsitsiklis JN (1999) The complexity of optimal queuing network control. Math. Oper. Res. 24(2):293–305.Link, Google Scholar
• Papadimitriou C, Pollner T, Saberi A, Wajc D (2021) Online stochastic max-weight bipartite matching: Beyond prophet inequalities. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 763–764.Google Scholar
• Peysakhovich A, Kroer C, Usunier N (2023) Implementing fairness constraints in markets using taxes and subsidies. Proc. ACM Conf. Fairness, Accountability, and Transparency (Association for Computing Machinery, New York), 916–930.Google Scholar
• Plotkin SA, Shmoys DB, Tardos É (1995) Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20(2):257–301.Link, Google Scholar
• Quillian L, Pager D, Hexel O, Midtbøen AH (2017) Meta-analysis of field experiments shows no change in racial discrimination in hiring over time. Proc. Natl. Acad. Sci. USA 114(41):10870–10875.Crossref, Google Scholar
• Resnick SI (2013) Adventures in Stochastic Processes (Springer Science & Business Media).Google Scholar
• Ryan AM, Tippins NT (2004) Attracting and selecting: What psychological research tells us. Human Res. Management 43(4):305–318.Google Scholar
• Salem J, Gupta S (2024) Secretary problems with biased evaluations using partial ordinal information. Management Sci. 70(8):5337–5366.Link, Google Scholar
• Schumann C, Lang Z, Mattei N, Dickerson JP (2022) Group fairness in bandits with biased feedback. Proc. 21st Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1155–1163.Google Scholar
• Segev D, Singla S (2021) Efficient approximation schemes for stochastic probing and prophet problems. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 793–794.Google Scholar
• Sinclair SR, Jain G, Banerjee S, Yu CL (2020) Sequential fair allocation of limited resources under stochastic demands. Preprint, submitted November 29, https://arxiv.org/abs/2011.14382.Google Scholar
• Singla S (2018) The price of information in combinatorial optimization. Proc. 29th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 2523–2532.Google Scholar
• Sion M (1958) On general minimax theorems. Pacific J. Math. 8(1):171–176.Crossref, Google Scholar
• Tang S, Yuan J (2023) Beyond submodularity: A unified framework of randomized set selection with group fairness constraints. J. Combinatorial Optim. 45(4):102.Crossref, Google Scholar
• Udwani R (2024) When stochastic rewards reduce to deterministic rewards in online bipartite matching. Proc. Sympos. Simplicity Algorithms (SIAM, Philadelphia), 321–330.Google Scholar
• U.S. Bureau of Labor Statistics (2017) Wage and job skill distributions in the national compensation survey. Accessed January 1, 2025, https://www.bls.gov/opub/mlr/2017/article/wage-and-job-skill-distributions-in-the-national-compensation-survey.htm.Google Scholar
• Vishnoi NK (2018) Algorithms for Convex Optimization (Cambridge University Press, New York).Google Scholar
• Walsh T (2011) Online cake cutting. Brafman RI, Roberts FS, Tsoukiàs A, eds. Algorithmic Decision Theory (ADT 2011), Lecture Notes in Computer Science, vol. 6992 (Springer, Berlin, Heidelberg).Google Scholar
• Wang S, Xiong G, Li J (2024) Online restless multi-armed bandits with long-term fairness constraints. Proc. AAAI Conf. Artificial Intelligence, vol. 38 (AAAI Press, Palo Alto, CA), 15616–15624.Google Scholar
• Wang K, Xu L, Taneja A, Tambe M (2023) Optimistic whittle index policy: Online learning for restless bandits. Proc. AAAI Conf. Artificial Intelligence, vol. 37 (AAAI Press, Palo Alto, CA), 10131–10139.Google Scholar
• Weber RR, Weiss G (1990) On an index policy for restless bandits. J. Appl. Probability 27(3):637–648.Crossref, Google Scholar
• Weitzman ML (1979) Optimal search for the best alternative. Econometrica 641–654.Crossref, Google Scholar
• Welch F (1976) Employment quotas for minorities. J. Political Econom. 84(4, Part 2):S105–S141.Crossref, Google Scholar
• Wenneras C, Wold A (2010) Nepotism and sexism in peer-review. Women, Science, and Technology (Routledge, New York), 64–70.Google Scholar
• Whittle P (1988) Restless bandits: Activity allocation in a changing world. J. Appl. Probability 25(A):287–298.Crossref, Google Scholar
• Zhang X, Frazier PI (2021) Restless bandits with many arms: Beating the central limit theorem. Preprint, submitted July 25, https://arxiv.org/abs/2107.11911.Google Scholar
• Zhong Y, Zheng Z, Chou MC, Teo C-P (2018) Resource pooling and allocation policies to deliver differentiated service. Management Sci. 64(4):1555–1573.Link, Google Scholar