Greedy algorithms for the profit-aware social team formation problem
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...
Saved in:
Published in | Journal of combinatorial optimization Vol. 44; no. 1; pp. 94 - 118 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.08.2022
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
ISSN | 1382-6905 1573-2886 |
DOI | 10.1007/s10878-021-00817-y |
Cover
Loading…