2023
Designing Approximately Optimal Search on Matching Platforms
Immorlica N, Lucier B, Manshadi V, Wei A. Designing Approximately Optimal Search on Matching Platforms. Management Science 2023, 69: 4609-4626. DOI: 10.1287/mnsc.2022.4601.Peer-Reviewed Original ResearchSocial welfareTwo-sided matching marketsUnique stationary equilibriumDecentralized two-sided matching marketFirst-best social welfareEquilibrium social welfareImproved approximation factorMeeting rateStationary equilibriumMatching marketsAgents' incentivesOptimal welfareOmar BesbesBipartite graphsIncentive issuesSearch designAgent typesApproximation factorOnline appendixConstant factorWelfareMarketMarketing analyticsSearch problemDesign problem
2021
Designing Approximately Optimal Search on Matching Platforms
Immorlica N, Lucier B, Manshadi V, Wei A. Designing Approximately Optimal Search on Matching Platforms. 2021, 632-633. DOI: 10.1145/3465456.3467530.Peer-Reviewed Original ResearchSocial welfareTwo-sided matching marketsUnique stationary equilibriumDecentralized two-sided matching marketEquilibrium social welfareOptimal social welfareMeeting rateStationary equilibriumMatching marketsOptimal welfareIncentive issuesWelfareEquilibriumPairwise preferencesEasy-to-implementAgent searchesMatching platformPreferencesPotential partnersBipartite graphsConstant factorIncentivesMarketNP-hardDesign problem
2020
Online Policies for Efficient Volunteer Crowdsourcing
Manshadi V, Rodilitz S. Online Policies for Efficient Volunteer Crowdsourcing. 2020, 315-316. DOI: 10.1145/3391403.3399519.Peer-Reviewed Original ResearchOnline policyTime-sensitive tasksFood Rescue U.S.Constant factor guaranteeMissed tasksCrowdsourcing platformsRandomized policyBipartite matchingTime-varying distributionFood recovery organizationsTask typeTaskConstant factorNotificationPlatformUpper boundSuccess cruciallyMatch probabilityHardness resultsGuaranteesPlatform dataProbability