Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2308.02584 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914358020276224 |
|---|---|
| author | Rios, Ignacio Torrico, Alfredo |
| author_facet | Rios, Ignacio Torrico, Alfredo |
| contents | 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 $1-1/e$ guarantee across all platform designs under reasonable assumptions. Our empirical analysis, using proprietary data from a major U.S.-based dating app, confirms that DH-int consistently outperforms other benchmarks such as Greedy, Perfect Matching and DH, and approaches the theoretical upper bound across multiple platform designs and variants of the history effect. The superior performance of DH-int is driven primarily by its careful balancing of initial and follow-up interactions, which accounts for the two-sided nature of the market. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_02584 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms Rios, Ignacio Torrico, Alfredo Optimization and Control 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 $1-1/e$ guarantee across all platform designs under reasonable assumptions. Our empirical analysis, using proprietary data from a major U.S.-based dating app, confirms that DH-int consistently outperforms other benchmarks such as Greedy, Perfect Matching and DH, and approaches the theoretical upper bound across multiple platform designs and variants of the history effect. The superior performance of DH-int is driven primarily by its careful balancing of initial and follow-up interactions, which accounts for the two-sided nature of the market. |
| title | The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2308.02584 |