Redesigning VolunteerMatch’s Search Algorithm: Toward More Equitable Access to Volunteers

References

• Abeliuk A, Berbeglia G, Cebrian M, Van Hentenryck P (2016) Assortment optimization under a multinomial logit model with position bias and social influence. 4OR 14(1):57–75.Crossref, Google Scholar
• Adebola O, Arora P, Zhang C (2022) Sharing platforms in emerging markets: The role of human intermediaries. Preprint, submitted August 29, http://dx.doi.org/10.2139/ssrn.4190725. Google Scholar
• Ahani N, Andersson T, Martinello A, Teytelboym A, Trapp AC (2021a) Placement optimization in refugee resettlement. Oper. Res. 69(5):1468–1486.Link, Google Scholar
• Ahani N, Gölz P, Procaccia AD, Teytelboym A, Trapp AC (2021b) Dynamic placement in refugee resettlement. Oper. Res. 72(3):1087–1104.Google Scholar
• Aminian MR, Manshadi V, Niazadeh R (2023) Markovian search with Ex-ante constraints: Theory and applications to socially aware algorithmic hiring. Preprint, submitted February 6, http://dx.doi.org/10.2139/ssrn.4347447.Google Scholar
• Angrist JD, Pischke JS (2013) Mostly Harmless Econometrics: An Empiricists Companion (Princeton University Press, Princeton, NJ).Google Scholar
• Aouad A, Saban D (2023) Online assortment optimization for two-sided matching platforms. Management Sci. 69(4):2069–2087.Link, Google Scholar
• Arnosti N, Bonet C (2022) Lotteries for shared experiences. Pennock DM, Segal I, Seuken S, eds. Proc. 23rd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 1179–1180.Google Scholar
• Baek J, Farias V (2024) Fair exploration via axiomatic bargaining. Management Sci. 70(12):8922–8939.Google Scholar
• Besbes O, Fonseca Y, Lobel I, Zheng F (2023) Signaling competition in two-sided markets. Preprint, submitted May 23, http://dx.doi.org/10.2139/ssrn.4451693.Google Scholar
• Biega AJ, Gummadi KP, Weikum G (2018) Equity of attention: Amortizing individual fairness in rankings. Collins-Thompson K, Mei Q, Davison BD, Liu Y, Yilmaz E, eds. 41st Internat. ACM SIGIR Conf. Res. Development Inform. Retrieval (Association for Computing Machinery, New York), 405–414.Google Scholar
• Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. Arge L, Hoffmann M, Welzl E, eds. Proc. 15th Annual Eur. Conf. Algorithms (Springer, Berlin), 253–264.Google Scholar
• Chen Q, Golrezaei N, Susan F, Baskoro E (2022) Fair assortment planning. Preprint, submitted August 15, https://arxiv.org/abs/2208.07341.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 (2025) Dynamic pricing with fairness constraints. Oper. Res., ePub ahead of print May 22, https://doi.org/10.1287/opre.2023.0123.Google Scholar
• Correa J, Cristi A, Duetting P, Norouzi-Fard A (2021) Fairness and bias in online selection. Marina M, Zhang T, eds. Proc. 38th Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 139 (JMLR.org), 2112–2121.Google Scholar
• de Zegher JF, Lo I (2020) Crowdsourcing market information from competitors. Preprint, submitted April 1, http://dx.doi.org/10.2139/ssrn.3537625.Google Scholar
• Devanur NR, Jain K (2012) Online matching with concave returns. Karloff HJ, Pitassi T, eds. Proc. 44th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 137–144.Google Scholar
• Dhanorkar S, Donohue K, Linderman K (2015) Repurposing materials and waste through online exchanges: Overcoming the last hurdle. Production Oper. Management 24(9):1473–1493.Crossref, Google Scholar
• Feng Y, Niazadeh R, Saberi A (2024) Technical note—Near-optimal bayesian online assortment of reusable resources. Oper. Res. 72(5):1861–1873.Google Scholar
• Ferreira KJ, Parthasarathy S, Sekar S (2022) Learning to rank an assortment of products. Management Sci. 68(3):1828–1848.Link, Google Scholar
• Freund D, Henderson SG, O’Mahony E, Shmoys DB (2019) Analytics and bikes: Riding tandem with motivate to improve mobility. INFORMS J. Appl. Anal. 49(5):310–323.Link, Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2020) Approximation algorithms for product framing and pricing. Oper. Res. 68(1):134–160.Link, Google Scholar
• Geyik SC, Ambler S, Kenthapadi K (2019) Fairness-aware ranking in search & recommendation systems with application to LinkedIn Talent Search. Teredesai A, Kumar V, Li Y, Rosales R, Terzi E, Karypis G, eds. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 2221–2231.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Gong XY, 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
• Goyal V, Udwani R (2022) Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. Oper. Res. 71(2):563–580.Google Scholar
• Goyal V, Iyengar G, Udwani R (2025) Asymptotically optimal competitive ratio for online allocation of reusable resources. Oper. Res. 73(4):1897–1915.Google Scholar
• Gupta S, Kamble V (2021) Individual fairness in hindsight. J. Machine Learn. Res. 22(1):6386–6420.Google Scholar
• Holtz D, Lobel R, Liskovich I, Aral S (2020) Reducing interference bias in online marketplace pricing experiments. Preprint, submitted April 26, https://arxiv.org/abs/2004.12489.Google Scholar
• Levi R, Rajan M, Singhvi S, Zheng Y (2020) The impact of unifying agricultural wholesale markets on prices and farmers’ profitability. Proc. Natl. Acad. Sci. USA 117(5):2366–2371.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
• 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
• Manshadi V, Rodilitz S (2022) Online policies for efficient volunteer crowdsourcing. Management Sci. 68(9):6572–6590.Link, Google Scholar
• Manshadi V, Niazadeh R, Rodilitz S (2023) Fair dynamic rationing. Management Sci. 69:6818–6836. Google Scholar
• Manshadi V, Rodilitz S, Shameli A (2024) Commitment on volunteer crowdsourcing platforms: Implications for growth and engagement. Manufacturing Service Oper. Management 26(5):1787–1805. Google Scholar
• Manshadi V, Rodilitz S, Saban D, Suresh A (2025) Online algorithms for matching platforms with multi-channel traffic. Management Sci. 71(9):7674–7691.Google Scholar
• McElfresh DC, Kroer C, Pupyrev S, Sodomka E, Sankararaman KA, Chauvin Z, Dexter N, Dickerson JP (2020) Matching algorithms for blood donation. Biro P, Hartline J, eds. Proc. 21st Assoc. Comput. Machinery Conf. Econom. Comput. (Association for Computing Machinery, New York), 463–464.Google Scholar
• Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM 54(5):22–es.Crossref, Google Scholar
• New York Times (2022) E.U. takes aim at social media’s harms with landmark new law. (April 22), https://www.nytimes.com/2022/04/22/technology/european-union-social-media-law.html.Google Scholar
• Rios I, Saban D, Zheng F (2023) Improving match rates in dating markets through assortment optimization. Manufacturing Service Oper. Management 25(4):1304–1323.Link, Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Singh A, Joachims T (2018) Fairness of exposure in rankings. Guo Y, Farooq F, eds. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 2219–2228.Google Scholar
• Ursu RM (2018) The power of rankings: Quantifying the effect of rankings on online consumer search and purchase decisions. Marketing Sci. 37(4):530–552.Link, Google Scholar
• Vazirani VV (2022) Online bipartite matching and Adwords. Szeider S, Ganian R, Silva A, eds. 47th Internat. Sympos. Math. Foundations Comput. Sci. (Dagstuhl Publishing, Wadern, Germany), 5. Google Scholar
• Vox (2019) Can monoculture survive the algorithm? (December 17), https://www.vox.com/the-goods/2019/12/17/21024439/monoculture-algorithm-netflix-spotify.Google Scholar