The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms

References

• Adamczyk M (2011) Improved analysis of the greedy algorithm for stochastic matching. Inform. Processing Lett. 111(15):731–737.Crossref, Google Scholar
• Agrawal S, Ding Y, Saberi A, Ye Y (2010) Correlation robust stochastic optimization. Proc. Twenty-First Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1087–1096.Google Scholar
• Aouad A, Saban D (2022) Online assortment optimization for two-sided matching platforms. Management Sci. 69(4):2069–2087.Link, Google Scholar
• Arnosti N, Shi P (2020) Design of lotteries and wait-lists for affordable housing allocation. Management Sci. 66(6):2291–2307.Link, Google Scholar
• Ashlagi I, Krishnaswamy A, Makhijani R, Saban D, Shiragur K (2022) Technical note—Assortment planning for two-sided sequential matching markets. Oper. Res. 70(5):2784–2803.Link, Google Scholar
• Bansal N, Gupta A, Li J, Mestre J, Nagarajan V, Rudra A (2012) When LP is the cure for your matching woes: Improved bounds for stochastic matchings. Algorithmica 63:733–762.Crossref, Google Scholar
• Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Management Sci. 67(3):1350–1367.Link, Google Scholar
• Besbes O, Fonseca Y, Lobel I, Zheng F (2023) Signaling competition in two-sided markets. Proc. 24th ACM Conf. Econom. Computation (ACM, New York), 293.Google Scholar
• Celdir ME, Cho SH, Hwang EH (2024) Popularity bias in online dating platforms: Theory and empirical evidence. Manufacturing Service Oper. Management 26(2):537–553.Link, Google Scholar
• Chen N, Nasiry J (2020) Does loss aversion preclude price variation? Manufacturing Service Oper. Management 22(2):383–395.Link, Google Scholar
• Chen N, Immorlica N, Karlin AR, Mahdian M, Rudra A (2009) Approximating matches made in heaven. Automata, Languages and Programming (Springer, Berlin, Heidelberg), 266–278.Crossref, Google Scholar
• Cui T, Hamilton M (2024) Pricing strategies for online dating platforms. Preprint, submitted March 24, http://dx.doi.org/10.2139/ssrn.4032735.Google Scholar
• Gamlath B, Kale S, Svensson O (2019) Beating greedy for stochastic bipartite matching. Proc. Thirtieth Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 2841–2854.Google Scholar
• Gandhi R, Khuller S, Parthasarathy S, Srinivasan A (2006) Dependent rounding and its applications to approximation algorithms. J. ACM 53(3):324–360.Crossref, Google Scholar
• Guo MA, Jiang H, Shen ZJM (2025) Multiproduct dynamic pricing with reference effects under logit demand. Manufacturing Service Oper. Management 27(5):1645–1663.Link, Google Scholar
• Halaburda H, Piskorski MJ, Yıldırım P (2018) Competing by restricting choice: The case of search platforms. Management Sci. 64(8):3574–3594.Link, Google Scholar
• He T, Zhang Y, Zheng H (2024) Assortment optimization under history-dependent effects. Preprint, submitted August 20, https://arxiv.org/abs/2408.10967.Google Scholar
• Hu Z, Nasiry J (2018) Are markets with loss-averse consumers more sensitive to losses? Management Sci. 64(3):1384–1395.Link, Google Scholar
• Immorlica N, Lucier B, Manshadi V, Wei A (2022) Designing approximately optimal search on matching platforms. Management Sci. 69(8):4609–4626.Link, Google Scholar
• Jeloudar M, Lo I, Pollner T, Saberi A (2021) Decentralized matching in a probabilistic environment. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 635–653.Google Scholar
• Kagan E, Leider S, Sahin O (2025) Sequential decision making: From decision elicitation to strategy identification. Management Sci., ePub ahead of print September 22, https://doi.org/10.1287/mnsc.2023.02381.Link, Google Scholar
• Kanoria Y, Saban D (2021) Facilitating the search for partners on matching platforms. Management Sci. 67(10):5990–6029.Link, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2015) Assortment planning: Review of literature and industry practice. Agrawal N, Smith S, eds. Retail Supply Chain Management, International Series in Operations Research & Management Science, vol. 223 (Springer, Berlin), 175–236.Google Scholar
• Lee S, Niederle M (2015) Propose with a rose? Signaling in internet dating markets. Experiment. Econom. 18(4):731–755.Crossref, Google Scholar
• Long X, Nasiry J, Wu Y (2020) A behavioral study on abandonment decisions in multistage projects. Management Sci. 66(5):1999–2016.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, Rodilitz S, Saban D, Suresh A (2024) Online algorithms for matching platforms with multi-channel traffic. Management Sci. 71(9):7674-7691.Google Scholar
• Özer O, Zheng Y (2016) Markdown or everyday low price? The role of behavioral motives. Management Sci. 62(2):326–346.Link, Google Scholar
• Rios I, Ghosh P (2024) Competition in optimal stopping: Behavioral insights. Manufacturing Service Oper. Management 26(6):2256–2273.Link, 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
• Rochet JC, Tirole J (2003) Platform competition in two-sided markets. J. Eur. Econom. Assoc. 1(4):990–1029.Crossref, Google Scholar
• Torrico A, Carvalho M, Lodi A (2020) Multi-agent assortment optimization in sequential matching markets. Preprint, submitted June 8, https://doi.org/10.48550/arXiv.2006.04313.Google Scholar
• Wang R (2018) When prospect theory meets consumer choice models: Assortment and pricing management with reference prices. Manufacturing Service Oper. Management 20(3):583–600.Link, Google Scholar