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
2012
Online Stochastic Matching: Online Actions Based on Offline Statistics
Manshadi V, Gharan S, Saberi A. Online Stochastic Matching: Online Actions Based on Offline Statistics. Mathematics Of Operations Research 2012, 37: 559-573. DOI: 10.1287/moor.1120.0551.Peer-Reviewed Original ResearchCompetitive ratioOnline algorithmOnline stochastic matching problemStochastic matching problemOptimum offline solutionBipartite graphsHardness resultsPermutation modelMonte Carlo samplingMatching problemHard sideAd allocationEmpty binsOffline solutionGraphOffline statisticsAlgorithmOnline actionsBallPermutationProblemAllocationBall typeMonteBins