2022
Online Policies for Efficient Volunteer Crowdsourcing
Manshadi V, Rodilitz S. Online Policies for Efficient Volunteer Crowdsourcing. Management Science 2022, 68: 6572-6590. DOI: 10.1287/mnsc.2021.4220.Peer-Reviewed Original ResearchOnline policyTime-sensitive tasksFood Rescue U.S.Constant factor guaranteeMissed tasksCrowdsourcing platformsRandomized policyBipartite matchingTime-varying distributionFood recovery organizationsTask typeTaskDynamic programmingPlatformUpper boundNotificationSuccess cruciallyMarketing analyticsGabriel WeintraubFeasible solutionsMatch probabilityHardness resultsGuaranteesTradeoffPlatform data
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
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