Algorithmic Challenges in Ensuring Fairness at the Time of Decision

References

• Agarwal A, Foster DP, Hsu D, Kakade SM, Rakhlin A (2011) Stochastic convex optimization with bandit feedback. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira F, Weinberger KQ, eds. NIPS ‘11 Proc. 25th Internat. Conf. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 1035–1043.Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Balcan MFF, Dick T, Noothigattu R, Procaccia AD (2019) Envy-free classification. Wallach H, Larochelle H, Beygelzimer A, d’Alché-Buc F, Fox E, Garnett R, eds. Adv. Neural Inform. Processing Systems 32 (NeurIPS 2019) (Curran Associates, Red Hook, NY).Google Scholar
• Bansal S, Srivastava A, Arora A (2017) Topic modeling driven content based jobs recommendation engine for recruitment industry. Procedia Comput. Sci. 122:865–872.Crossref, Google Scholar
• Beam C (2024) Welcome to pricing hell: The ubiquitous rise of add-on fees and personalized pricing has turned buying stuff into a game you can’t win. The Atlantic (April 16), https://www.theatlantic.com/ideas/archive/2024/04/surge-pricing-fees-economy/678078/.Google Scholar
• Bertsimas D, Farias VF, Trichakis N (2013) Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61(1):73–87.Link, Google Scholar
• Bolton LE, Warlop L, Alba JW (2003) Consumer perceptions of price (un)fairness. J. Consumer Res. 29(4):474–491.Crossref, Google Scholar
• Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (2016) Handbook of Computational Social Choice (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Bubeck S (2015) Convex optimization: Algorithms and complexity. Foundations Trends Machine Learn. 8(3–4):231–357.Crossref, Google Scholar
• Calders T, Kamiran F, Pechenizkiy M (2009) Building classifiers with independency constraints. Wang W, Kargupta H, Ranka S, Yu PS, Wu X, eds. 2009 IEEE Internat. Conf. Data Mining Workshops (IEEE, New York), 13–18.Google Scholar
• California State Legislature (2018) Title 1.81.5. California Consumer Privacy Act of 2018 (Title 1.81.5 added by Stats. 2018, Ch. 55, Sec. 3.Google Scholar
• Chen N (2021) Multi-armed bandit requiring monotone arm sequences. Ranzata M, Beygelzimer A, Dauphin Y, Liang PS, Wortman Vaughan J, eds. Adv. Neural Inform. Processing Systems 34 (NeurIPS 2021) (Curran Associates, Red Hook, NY), 16093–16103.Google Scholar
• Chen Q, Golrezaei N, Susan F (2022) Fair assortment planning. Preprint, submitted March 30, http://dx.doi.org/10.2139/ssrn.4072912.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
• Cohen MC, Elmachtoub AN, Lei X (2022) Price discrimination with fairness constraints. Management Sci. 68(12):8536–8552.Link, Google Scholar
• Cohen MC, Miao S, Wang Y (2021) Dynamic pricing with fairness constraints. Preprint, submitted September 25, http://dx.doi.org/10.2139/ssrn.3930622.Google Scholar
• Cope EW (2009) Regret and convergence bounds for a class of continuum-armed bandit problems. IEEE Trans. Automatic Control 54(6):1243–1253.Crossref, Google Scholar
• Darke PR, Dahl DW (2003) Fairness and discounts: The subjective value of a bargain. J. Consumer Psych. 13(3):328–338.Crossref, Google Scholar
• Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. Goldwasser S, ed. Proc. 3rd Innovations Theoret. Comput. Sci. (ITCS) (ACM, New York), 214–226.Google Scholar
• Flaxman AD, Kalai AT, McMahan HB (2005) Online convex optimization in the bandit setting: Gradient descent without a gradient. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 385–394.Google Scholar
• Foley DK (1966) Resource allocation and the public sector. Doctoral dissertation, Yale University, New Haven, CT.Google Scholar
• Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res. Logist. Quart. 3(1–2):95–110.Crossref, Google Scholar
• Gupta S, Kamble V (2021) Individual fairness in hindsight. J. Machine Learn. Res. 22(144):1–35.Google Scholar
• Haws KL, Bearden WO (2006) Dynamic pricing and consumer fairness perceptions. J. Consumer Res. 33(3):304–311.Crossref, Google Scholar
• Hazan E (2016) Introduction to online convex optimization. Foundations Trends Optim. 2(3–4):157–325.Crossref, Google Scholar
• Hazan E, Levy KY (2014) Bandit convex optimization: Towards tight bounds. Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger KQ, Adv. Neural Inform. Processing Systems 27 (NIPS 2014) (Curran Associates, Red Hook, NY), 784–792.Google Scholar
• Heidari H, Krause A (2018) Preventing disparate treatment in sequential decision making. Lang J, ed. Proc. 27th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Washington, DC), 2248–2254.Google Scholar
• Heyman JE, Mellers BA (2018) Perceptions of fair pricing. Handbook of Consumer Psychology (Routledge), 679–693.Google Scholar
• Jia S, Li A, Ravi R (2021) Markdown pricing under unknown demand. Preprint, submitted June 7, http://dx.doi.org/10.2139/ssrn.3861379.Google Scholar
• Jia S, Li A, Ravi R (2022) Dynamic pricing with monotonicity constraint under unknown parametric demand model. Koyejo S, Mohamed S, Agarwal A, Belgrave D, Cho K, Oh A, eds. Adv. Neural Inform. Processing Systems 35 (NeurIPS 2022) (Curran Associates, Red Hook, NY), 19179–19188.Google Scholar
• Joseph M, Kearns M, Morgenstern J, Roth A (2016) Fairness in learning: Classic and contextual bandits. Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R, eds. Adv. Neural Inform. Processing Systems 29 (NIPS 2016) (Curran Associates, Red Hook, NY), 325–333.Google Scholar
• Kallus N, Zhou A (2021) Fairness, welfare, and equity in personalized pricing. FAccT ‘21 Proc. 2021 ACM Conf. Fairness Accountability Transparency (ACM, New York), 296–314.Google Scholar
• Karimi H, Nutini J, Schmidt M (2016) Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition. Frasconi P, Landwehr N, Manco G, Vreeken J, eds. Proc. Eur. Conf. Machine Learn. Principles Practice Knowledge Discovery Databases (ECML PKDD 2016) (Springer, Cham, Switzerland), 795–811.Google Scholar
• Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Link, Google Scholar
• Kiefer J (1953) Sequential minimax search for a maximum. Proc. Amer. Math. Soc. 4(3):502–506.Crossref, Google Scholar
• Kiefer J, Wolfowitz J (1952) Stochastic estimation of the maximum of a regression function. Ann. Math. Statist. 23(3):462–466.Crossref, Google Scholar
• Klarsfeld A, Cachat-Rosset G (2021) Equality of treatment, opportunity, and outcomes: Mapping the law. Oxford Res. Encyclopedia Bus. Management (March 25), https://doi.org/10.1093/acrefore/9780190224851.013.315.Crossref, Google Scholar
• Kleinberg R (2004) Nearly tight bounds for the continuum-armed bandit problem. Saul LK, Weiss Y, Bottou L, eds. NIPS’04 Proc. 18th Internat. Conf. Neural Inform. Processing Systems (MIT Press, Cambridge, MA), 697–704.Google Scholar
• Liu Y, Radanovic G, Dimitrakakis C, Mandal D, Parkes DC (2017) Calibrated fairness in bandits. Preprint, submitted July 6, https://arxiv.org/abs/1707.01875.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
• Manshadi V, Niazadeh R, Rodilitz S (2021) Fair dynamic rationing. EC’21 22nd ACM Conf. Econom. Comput. (ACM, New York), 694–695.Google Scholar
• Nesterov Y, Spokoiny V (2017) Random gradient-free minimization of convex functions. Foundations Comput. Math. 17(2):527–566.Crossref, Google Scholar
• Raghavan M, Barocas S, Kleinberg J, Levy K (2020) Mitigating bias in algorithmic hiring: Evaluating claims and practices. FAT* ‘20 Proc. 2020 Conf. Fairness Accountability Transparency (ACM, New York), 469–481.Google Scholar
• Salem J, Gupta S (2024) Secretary problems with biased evaluations using partial ordinal information. Management Sci. 70(8):5337–5366.Google Scholar
• Sen A (2013) Equality of what? Baber HE, Dimon D, eds. Globalization and International Development: The Ethical Issues (Broadview Press, Peterborough, Canada), 61–76.Google Scholar
• Sinha AK, Akhtar AK, Kumar A (2021) Resume screening using natural language processing and machine learning: A systematic review. Swain D, Pattnaik PK, Athawale T, eds. Machine Learn. Inform. Processing. Proc. ICMLIP 2020 (Springer, Singapore), 207–214.Google Scholar
• Spall JC (1992) Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Automatic Control 37(3):332–341.Crossref, Google Scholar
• Stromquist W (1980) How to cut a cake fairly. Amer. Math. Monthly 87(8):640–644.Crossref, Google Scholar
• Vershynin R (2018) High-Dimensional Probability: An Introduction with Applications in Data Science, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 47 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Waters T (2022) Wells Fargo bank sued for race discrimination in mortgage lending practices. USA Today (April 26), https://www.usatoday.com/story/money/2022/04/26/wells-fargo-being-sued-discriminating-against-black-borrowers/7451521001/.Google Scholar
• Xia L, Monroe KB, Cox JL (2004) The price is unfair! A conceptual framework of price fairness perceptions. J. Marketing 68(4):1–15.Crossref, Google Scholar
• Zafar MB, Valera I, Gomez Rodriguez M, Gummadi KP (2017) Fairness beyond disparate treatment & disparate impact: Learning classification without disparate mistreatment. WWW ‘17 Proc. 26th Internat. Conf. World Wide Web (International World Wide Web Conferences Steering Committee, Geneva), 1171–1180.Google Scholar