Research Article
Fairness of Task Allocation in Crowdsourcing Workflows
| | Input: given workflow | | | Output: | | (1) | Let | | (2) | Let current_node = | | (3) | While current_node! = Do | | (4) | Let = | | (5) | Let longest_time = 0 | | (6) | Let be null | | (7) | For i = 1 to Do | | (8) | If > longest_time Then | | (9) | longest_time = | | (10) | = | | (11) | End If | | (12) | End For | | (13) | add to | | (14) | Let current_node = | | (15) | End while | | (16) | return |
|
