The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms
Ignacio Rios, Alfredo Torrico

TL;DR
This paper introduces a new matching algorithm for online dating platforms that guarantees near-optimal performance by balancing initial and follow-up interactions, validated through theoretical analysis and empirical data.
Contribution
The paper develops a provably strong, theoretically grounded heuristic for dynamic matching in dating platforms, addressing the two-sided market and user history effects.
Findings
DH-int achieves a 1-1/e performance guarantee.
Empirical results show DH-int outperforms benchmarks.
DH-int approaches the theoretical upper bound in real data.
Abstract
Motivated by online dating platforms, we study the problem of selecting which subset of profiles to display to each user in each period. Users observe the profiles set by the platform, decide which of them to like, and a match occurs if and only if two users mutually like each other, potentially across different periods. The platform aims to maximize the expected number of matches produced over the entire time horizon, and users' behavior -- captured by their like probabilities -- may depend on their history. We develop a general theoretical model that captures the dynamic, two-sided nature of the problem and the influence of users' past experiences on their future behavior. We focus on one-lookahead policies and propose the Integral Dating Heuristic (DH-int), providing formal performance guarantees: DH-int achieves a uniform guarantee across all platform designs under…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Consumer Market Behavior and Pricing · Game Theory and Voting Systems
