Online Algorithms for Matching Platforms with Multichannel Traffic

Vahideh Manshadi (), Scott Rodilitz (), Daniela Saban () and Akshaya Suresh ()
Additional contact information
Vahideh Manshadi: Yale School of Management, New Haven, Connecticut 06511
Scott Rodilitz: UCLA Anderson School of Management, Los Angeles, California 90095
Daniela Saban: Stanford Graduate School of Business, Stanford, California 94305
Akshaya Suresh: RAND, Arlington, Virginia 22202

Management Science, 2025, vol. 71, issue 9, 7674-7691

Abstract: Two-sided platforms rely on their recommendation algorithms to help visitors successfully find a match. However, on platforms such as VolunteerMatch, which has facilitated millions of connections between volunteers and nonprofits, a sizable fraction of website traffic arrives directly to a nonprofit’s volunteering page via an external link, thus bypassing the platform’s recommendation algorithm. We study how such platforms should account for this external traffic in the design of their recommendation algorithms, given the goal of maximizing successful matches. We model the platform’s problem as a special case of online matching, where (using VolunteerMatch terminology) volunteers arrive sequentially and probabilistically match with one opportunity, each of which has a finite need for volunteers. In our framework, external traffic is interested only in their targeted opportunity; by contrast, internal traffic may be interested in many opportunities, and the platform’s online algorithm selects which opportunity to recommend. In evaluating the performance of different algorithms, we refine the notion of competitive ratio by parameterizing it based on the amount of external traffic. After demonstrating the shortcomings of a commonly used algorithm that is optimal in the absence of external traffic, we propose a new algorithm, adaptive capacity ( AC ), which accounts for matches differently based on whether they originate from internal or external traffic. We provide a lower bound on AC ’s competitive ratio that is increasing in the amount of external traffic and that is close to (and, in some regimes, exactly matches) the parameterized upper bound we establish on the competitive ratio of any online algorithm. We complement our theoretical results with a numerical study motivated by VolunteerMatch data where we demonstrate the strong performance of AC relative to current practice and further our understanding of the difference between AC and other commonly used algorithms.

Keywords: matching platforms; online algorithms; competitive analysis; multichannel traffic (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.2022.00910 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:71:y:2025:i:9:p:7674-7691

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().