We propose an optimization problem to model a situation when a platform with a limited budget wants to pay a group of workers to work on a set of jobs with possibly worker-job-dependent execution costs.
The platform needs to assign workers to jobs and at the same time decides how much to pay each worker to maximize the total “contribution” from the workers by using up the limited budget. The binary effort assignment problem, in which an effort from a worker is indivisible and can only be dedicated to a single job, is reminiscent of bipartite matching problems. Yet, a matched worker and job pair neither incurs cost nor enforces a compulsory effort in a standard matching setting while we consider such
cost to be covered by payment and certain level of effort to be made when a job is executed by a worker. The fractional effort assignment problem, in which generally a worker’s effort can be divisible and split among multiple jobs, bears a resemblance to a labor economy or online labor platform, and the platform needs to output an arrangement of efforts and the corresponding payments.
There are six settings in total to consider by combining the conditions on payments and efforts. Intuitively, we study how to come up with the best assignment under each setting and how different these assignments
under different settings can be in terms of the total contribution from workers when the information of each worker’s quality of service and cost is available. NP-completeness results and approximation algorithms are given for different settings. We then compare the solution quality of some settings in the end.
Relation:
34th Proceedings of the International Workshop on Combinatorial Algorithms
