Online Policies for Efficient Volunteer Crowdsourcing

  title={Online Policies for Efficient Volunteer Crowdsourcing},
  author={Vahideh H. Manshadi and Scott Rodilitz},
  journal={Proceedings of the 21st ACM Conference on Economics and Computation},
  • V. Manshadi, Scott Rodilitz
  • Published 19 February 2020
  • Computer Science
  • Proceedings of the 21st ACM Conference on Economics and Computation
Nonprofit crowdsourcing platforms such as food recovery organizations rely on volunteers to perform time-sensitive tasks. Thus, their success crucially depends on efficient volunteer utilization and engagement. To encourage volunteers to complete a task, platforms use nudging mechanisms to notify a subset of volunteers with the hope that at least one of them responds positively. However, since excessive notifications may reduce volunteer engagement, the platform faces a trade-off between… 

Bandit Data-Driven Optimization for Crowdsourcing Food Rescue Platforms

Bandit data-driven optimization combines the advantages of online bandit learning and offline predictive analytics in an integrated framework and shows that PROOF performs better than existing baseline on food rescue volunteer recommendation.

Online Algorithms for Matching Platforms with Multi-Channel Traffic

A new algorithm - Adaptive Capacity (AC) - is introduced which accounts for matches differently based on whether they originate from internal or external traffic, and it is found that (in certain parameter regimes) AC is near-optimal regardless of the amount of External traffic, even though it does not know this amount a priori.

Sharing Economy Rebound- The Case of Peer-2-Peer Sharing of Food Waste

: The Sharing Economy is commonly assumed to promote sustainable consumption and improve material efficiency through better utilization of existing product stocks. Yet the cost-savings and

OM Forum — Reducing Food Waste: An Operations Management Research Agenda

Problem definition: It is estimated that one third of the food produced worldwide is wasted. This has been recognized as a critical problem by the United Nations, the U.S. Environmental Protection

Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources

This framework provides a unified framework for dynamically allocating reusable resources over time in the general network revenue management setting and suggests a meta-algorithm for “bifurcating” the resources depending on the network structure and then using two different algorithms for controlling the capacities of two different groups of resources.

Public health risks arising from food supply chains: Challenges and opportunities

An introduction to various risks arising from food supply chains is given and important new research directions in these areas are highlighted, and especially those that might be of significant interest to the operations research community are highlighted.

Dynamic Bipartite Matching Market with Arrivals and Departures

It is shown that an algorithm that waits to thicken the market, called the Patient algorithm, is exponentially better than the Greedy algorithm, i.e., an algorithms that matches agents greedily, which means that waiting has substantial benefits on maximizing a matching over a bipartite network.

Fairness Maximization among Offline Agents in Online-Matching Markets

This paper proposes online matching algorithms which optimize for either individual or group-level fairness among offline agents in OMMs, and presents two linear-programming (LP) based sampling algorithms, which achieve online competitive ratios at least 0.725 for individual fairness maximization (IFM) and 0.719 for group fairness maximizations (GFM), respectively.



Online prophet-inequality matching with applications to ad allocation

We study the problem of online prophet-inequality matching in bipartite graphs. There is a static set of bidders and an online stream of items. We represent the interest of bidders in items by a

Matching Algorithms for Blood Donation

Using the recently-deployed Facebook Blood Donation tool, the first large-scale algorithmic matching of blood donors with donation opportunities is conducted, guided by a machine learning model trained on prior observations of donor behavior.

Dynamic Stochastic Matching Under Limited Time

This work designs simple matching algorithms that achieve constant-factor approximations in cost-minimization and reward-maximization settings and develops a (e-1)/(2e)-approximation algorithm for reward maximization on arbitrary bipartite graphs.

Dynamic Volunteer Staffing in Multicrop Gleaning Operations

Although edible and healthy food was left unharvested in farm fields, 14% of U.S. households in 2014 were food insecure. The practice of gleaning combines the dual paradoxical problems of food wast...

Dynamic Staffing of Volunteer Gleaning Operations

Gleaning programs organize volunteer gleaners to harvest leftover crops that are donated by farmers for the purpose of feeding food-insecure individuals. Thus, the gleaning process simultaneously

Online Stochastic Weighted Matching: Improved Approximation Algorithms

The first approximation (0.667-competitive) algorithm for the online stochastic weighted matching problem beating the 1−1 / e barrier is presented and the approximation factor is improved by computing a careful third pseudo-matching along with the two offline solutions, and using it in the online algorithm.

Linear Programming Based Online Policies for Real-Time Assortment of Reusable Resources

This work develops a randomized primal-dual framework based on the authors' introduced LP to settle that inventory balancing policies of Golrezaei et al. (2014) obtain same (asymptotically optimal) competitive ratios as with non-reusable resources when product rental times are fixed over time.

Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers

  • S. Alaei
  • Computer Science
    2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
This work presents a general framework for approximately reducing the mechanism design problem for multiple buyers to the mechanismDesign problem for each individual buyer for Bayesian combinatorial auctions and improves several results from the literature.

A Dynamic Model for Managing Volunteer Engagement

Non-profit organizations that provide food, shelter, and other services to people in need, rely on volunteers to deliver their services. Unlike paid labor, non-profit organizations have less control

Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities

A polynomial-time algorithm is presented which approximates optimal online within a factor of 0.51---beating the best-possible prophet inequality and showing that it is PSPACE-hard to approximate this problem within some constant α < 1.