Fairness and Bias in Online Selection

References

• Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2):930–972.Crossref, Google Scholar
• Alpern S, Baston V (2017) The secretary problem with a selection committee: Do conformist committees hire better secretaries? Management Sci. 63(4):1184–1197.Link, Google Scholar
• Arsenis M, Kleinberg R (2022) Individual fairness in prophet inequalities. Proc. 23rd ACM Conf. Econom. Comput. (EC) (ACM, New York), 245.Google Scholar
• Azar P, Kleinberg R, Weinberg SM (2014) Prophet inequalities with limited information. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia).Google Scholar
• Babaioff M, Immorlica N, Kempe D, Kleinberg R (2018) Matroid secretary problems. J. ACM 65(6):35.Crossref, Google Scholar
• Becker GS (1971) The Economics of Discrimination (University of Chicago Press, Chicago).Crossref, Google Scholar
• Bhattacharjya D, Deleris LA (2014) The value of information in some variations of the stopping problem. Decision Anal. 11(3):189–203.Link, Google Scholar
• Buchbinder N, Jain K, Singh M (2014) Secretary problems via linear programming. Math. Oper. Res. 39(1):190–206.Link, Google Scholar
• Chow YS, Robbins HE, Siegmund D (1971) Great Expectations: The Theory of Optimal Stopping (Houghton Mifflin, Boston).Google Scholar
• Correa J, Dütting P, Fischer F, Schewior K (2022) Prophet inequalities for independent and identically distributed random variables from an unknown distribution. Math. Oper. Res. 47(2):1287–1309.Link, Google Scholar
• Correa J, Cristi A, Feuilloley L, Oosterwijk T, Tsigonias-Dimitriadis A (2021a) The secretary problem with independent sampling. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia).Google Scholar
• Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2021b) Posted price mechanisms and optimal threshold strategies for random arrivals. Math. Oper. Res. 46(4):1452–1478.Link, Google Scholar
• Drasgow F (1984) Scrutinizing psychological tests: Measurement equivalence and equivalent relations with external variables are the central issues. Psych. Bull. 95(1):134–135.Crossref, Google Scholar
• Dütting P, Kesselheim T, Lucier B (2020a) An O(log log m) prophet inequality for subadditive combinatorial auctions. Proc. IEEE Sympos. Foundations Comput. Sci. (FOCS) (SIAM, Philadelphia), 306–317.Google Scholar
• Dütting P, Feldman M, Kesselheim T, Lucier B (2020b) Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs. SIAM J. Comput. 49(3):540–582.Crossref, Google Scholar
• Dütting P, Lattanzi S, Paes Leme R, Vassilvitskii S (2021) Secretaries with advice. Proc. 22nd ACM Conf. Econom. Comput. (EC) (ACM, New York), 409–429.Google Scholar
• Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. Proc. Theory Cryptography Conf. (TCC) (Springer, Berlin, Heidelberg), 265–284.Google Scholar
• Ehsani S, Hajiaghayi M, Kesselheim T, Singla S (2018) Prophet secretary for combinatorial auctions and matroids. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA)(SIAM, Philadelphia), 700–714.Google Scholar
• Ezra T, Feldman M, Gravin N, Tang ZG (2020) Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models. Proc. ACM Conf. Econom. Comput. (EC) (ACM, New York), 769–787.Google Scholar
• Feldman M, Tennenholtz M (2012) Interviewing secretaries in parallel. Proc. ACM Conf. Electronic Commerce (EC) (ACM, New York), 550–567.Google Scholar
• Feldman M, Gravin N, Lucier B (2015a) Combinatorial auctions via posted prices. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia), 123–135.Google Scholar
• Feldman M, Svensson O, Zenklusen R (2015b) A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia), 1189–1201.Google Scholar
• Feldman M, Svensson O, Zenklusen R (2016) Online contention resolution schemes. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia), 1014–1033.Google Scholar
• Georgiou N, Kuchta M, Morayne M, Niemiec J (2008) On a universal best choice algorithm for partially ordered sets. Random Structures Algorithms 32(3):263–273.Crossref, Google Scholar
• Gilbert JP, Mosteller F (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61(313):35–73.Crossref, Google Scholar
• Gravin N, Wang H (2019) Prophet inequality for bipartite matching: Merits of being simple and non adaptive. Proc. ACM Conf. Econom. Comput. (EC) (ACM, New York), 93–109.Google Scholar
• Joseph M, Kearns M, Morgenstern JH, Roth A (2016) Fairness in learning: Classic and contextual bandits. Proc. Conf. Neural Inform. Processing Systems (NIPS) (Curran Associates Inc., Red Hook, NY), 325–333.Google Scholar
• Kaplan H, Naori D, Raz D (2020) Competitive analysis with a sample and the secretary problem. Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia), 2082–2095.Google Scholar
• Kearns M, Roth A (2019) The Ethical Algorithm: The Science of Socially Aware Algorithm Design (Oxford University Press, Oxford, UK).Google Scholar
• Kesselheim T, Radke K, Tönnis A, Vöcking B (2013) An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. Proc. Eur. Sympos. Algorithms (ESA) (Springer, Berlin, Heidelberg), 589–600.Google Scholar
• Khatibi A, Jacobson S (2018) Generalized sequential stochastic assignment problem. Stochastic Systems 8(4):293–306.Link, Google Scholar
• Kleinberg R, Weinberg SM (2012) Matroid prophet inequalities. Proc. ACM Sympos. Theory Comput. Conf. (STOC) (ACM, New York), 123–136.Google Scholar
• Kumar R, Lattanzi S, Vassilvitskii S, Vattani A (2011) Hiring a secretary from a poset. Proc. ACM Conf. Electronic Commerce (EC) (ACM, New York), 39–48.Google Scholar
• Lee E, Singla S (2018) Optimal online contention resolution schemes via ex-ante prophet inequalities. Proc. Eur. Sympos. Algorithms (ESA), vol. 57 (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern, Germany), 1–14.Google Scholar
• Lien RW, Iravani SMR, Smilowitz KR (2014) Sequential resource allocation for nonprofit operations. Oper. Res. 62(2):301–317.Link, Google Scholar
• Preater J (1999) The best-choice problem for partially ordered objects. Oper. Res. Lett. 25(4):187–190.Crossref, Google Scholar
• Rubinstein A, Wang JZ, Weinberg SM (2020) Optimal single-choice prophet inequalities from samples. Proc. Innovations Theoret. Comput. Sci. (ITCS) (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern, Germany), 60:1–60:10.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
• Samuel-Cahn E (1984) Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 12(4):1213–1216.Crossref, Google Scholar
• Sowell T (2004) Affirmative Action Around the World: An Empirical Study (Yale University Press, New Haven, CT).Google Scholar