MULTIPOINT: Balancing Platform Profit and Worker Passion in Spatial Crowdsourcing

TL;DR

Researchers from the Athens University of Economics and Business have developed a new framework to solve the "Online Task Allocation" problem in spatial crowdsourcing. By combining a high-performance matching algorithm (TACTIC) with a multi-objective Genetic Algorithm (MULTIPOINT), they ensure that platforms stay profitable while workers stay motivated by performing tasks that actually interest them.

Background: The Moving Pieces of Crowdsourcing

Spatial crowdsourcing (SC) is the backbone of services like Uber, Gigwalk, and Amazon Last Mile. Unlike digital crowdsourcing, SC requires physical presence. The challenge is "Online Allocation"—deciding who does what in real-time as workers and tasks appear and disappear unpredictably.

Most existing systems treat workers as "interchangeable robots," focusing only on cost. This leads to worker burnout and high churn. This paper argues that if you assign a "plant enthusiast" to verify a nursery's inventory, the reliability and completion speed will naturally increase.

Motivation: Why Single-Objective Isn't Enough

Current SOTA methods usually optimize one of the following:

1. Platform Utility: Maximizing (Payment × Worker Reliability).
2. System Efficiency: Minimizing travel distance or latency.

The authors identify a critical gap: Worker Interests. By ignoring what workers want to do, platforms lose long-term engagement. The paper proposes a dual-utility model that treats worker interest as a primary mathematical constraint.

Methodology: The TACTIC and MULTIPOINT Engine

1. TACTIC (The Foundation)

For single-objective scenarios, the authors propose TACTIC. Instead of a "greedy" match, it runs the Hungarian Algorithm (a combinatorial optimization method) repeatedly at critical time points (arrivals and departures).

• The Insight: Even if a match is found at arrival, it isn't "locked in" until the last possible second (at the deadline). This allows the system to swap matches if a better worker appears later.
• Competitive Ratio: The authors mathematically prove a competitive ratio of $O(1/2)f(OPT)$, meaning it performs at least half as well as an "offline" version with perfect future knowledge.

2. MULTIPOINT (The Multi-Objective Brain)

To balance Profit and Interest, they use an Evolutionary Approach (EA).

• Semantic Matching: They use Word Embeddings (128-dimensional vectors) to calculate the "distance" between task descriptions and worker preferences.
• Genetic Algorithm: It creates a population of possible allocation "schedules," uses Crossover and Mutation to evolve them, and picks the one that minimizes the distance to the ideal score for both objectives.


Experiments: Superior Performance

The researchers tested their system against TGOA (a leading online matching algorithm).

• Utility Boost: TACTIC outperformed TGOA-Greedy by 27% when task volume was high (10,000 tasks).
• Scalability: Even with 100k tasks, the running time grew linearly, proving it can handle real-world city-scale traffic.
• Balancing: In the multi-objective tests, MULTIPOINT successfully narrowed the gap between Platform and Worker utility, proving that you don't have to sacrifice much profit to keep workers happy.

 and Figure 2(b) - Utility vs Task Volume)

Critical Insight & Conclusion

The true value of this work lies in its holistic view of the crowdsourcing lifecycle. By treating "Worker Satisfaction" as a mathematical objective rather than an afterthought, the system creates a self-sustaining loop.

Limitations: The model assumes workers provide honest preferences and that task descriptions are detailed enough for accurate word embedding. Future work could benefit from incorporating Deep Reinforcement Learning to predict "worker departure" more accurately than simple deadlines.

Final Takeaway: For the next generation of gig-economy apps, "matching" is no longer just about the nearest person—it's about the right person for the right job at the right price.