Greedy algorithms for the profit-aware social team formation problem |
| |
Authors: | Liu Shengxin Poon Chung Keung |
| |
Affiliation: | 1.School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China ;2.Department of Computing, The Hang Seng University of Hong Kong, New Territories, Hong Kong ; |
| |
Abstract: | Motivated by applications in online labor markets, we study the problem of forming multiple teams of experts in a social network to accomplish multiple tasks that require different combinations of skills. Our goal is to maximize the total profit of tasks that are completed by these teams subject to the capacity constraints of the experts. We study both the offline and online settings of the problem. For the offline problem, we present a simple and practical algorithm that improves upon previous results in many situations. For the online problem, we design competitive deterministic and randomized online algorithms. These are complemented by some hardness results in both settings. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|