CN106557891B - Crowdsourcing task allocation method based on user reliability - Google Patents

Abstract

The invention discloses a crowdsourcing task allocation method based on user reliability, which comprises the following steps: s1, inputting a user set W and a task set T; s2, starting task allocation, and initializing a relevant task and a user set; s3, for each task T in the task set T to be distributed_iSelecting users meeting the conditions to join the task t_iSet of users W_r，iPerforming the following steps; s4, starting the first round of user allocation, and traversing each task in the task set T to be allocated; s5, continuing the user distribution from the second round to the first round, and traversing each task T in the task set T to be distributed_i(ii) a S6, finishing task distribution according to the set W_rAnd the quality of the task completed by the user is updated according to the reputation value of the user. The invention can not only ensure the reliability of users, the heterogeneity of users and the heterogeneity of tasks, but also improve the actual benefit of tasks and stimulate more users to finish the tasks with high quality.

Description

Crowdsourcing task allocation method based on user reliability

Technical Field

The invention relates to the technical field of computer networks and communication, in particular to a crowdsourcing task allocation method based on user reliability.

Background

Crowdsourcing refers to the practice of a company or organization outsourcing work tasks performed by employees in the past to an unspecified (and often large) mass network in a free-voluntary manner. People on crowdsourcing platforms fall into two categories: the person who publishes the task on the platform is called the task publisher and the person who completes the task is called the user. The task publisher publishes the task on the platform, and the user obtains a certain reward by completing the task. Typical tasks that are crowd-sourced are designing graphics, soliciting marketing solutions, image tagging, and data collection.

Crowd-sourced work can help task publishers get a large number of free users to solve practical problems by exploiting the intelligence of these users. However, since the users and task publishers have selfish characteristics and strive to maximize their own benefits, such situations result in the results submitted by the users containing a large number of arbitrary or even false answers, eventually leaving the task publishers with no high quality answers. Therefore, how to stimulate the user to complete the task with high quality is an important link for optimizing the crowdsourcing service, so that the quality of result data obtained by a task publisher is guaranteed.

However, the existing discussion of the user service quality difference only exists in a simple task allocation method, and no reasonable incentive mechanism is provided to attract the user to participate in the task. Moreover, most of the existing researches are focused on a single-user single-task model, namely, each task is only distributed to one user to be completed, and the problems of reliability of the users, heterogeneity of the tasks and the like are not fully considered, namely, for the same task, the completion quality of different users is different; the quality of different tasks performed by the same user is also different. Therefore, the design aspects of the mode of operation and the incentive mechanism of the crowdsourcing have defects, and the actual requirements of the crowdsourcing system cannot be met.

Therefore, in order to solve the above technical problems, it is necessary to establish a complete user reliability-based crowd-sourced task allocation method, which can not only ensure the reliability of users, the heterogeneity of users and the heterogeneity of tasks, but also improve the actual benefit of tasks and encourage more users to complete tasks with high quality.

Disclosure of Invention

In view of this, the present invention provides a method for distributing crowdsourcing tasks based on user reliability, so as to encourage users to complete tasks with high quality and improve task efficiency.

In order to achieve the above purpose, the technical solutions provided by the embodiments of the present invention are as follows:

a method of crowd-sourced task allocation based on user reliability, the method comprising:

s1, the task publisher publishes n heterogeneous tasks on the crowdsourcing platform, and the set T is ═ T₁，t₂，...，t_nIndicates that there are m heterogeneous users on the crowdsourcing platform, and the set W ═ W₁，w₂，...，w_mRepresents;

s2, starting task allocation, initializing related tasks and user sets, and allocating the completed task sets

Set of users assigned to tasks

Is in accordance with task t_iConditional set of users to be allocated

Is assigned to task t_iUser set of

；

S3, for each task T in the task set T to be distributed_iSelecting users meeting the conditions to join the task t_iSet of users W_r，iPerforming the following steps;

s4, according to the number | W of users participating in all tasks to be distributed in the set T_r，iI is arranged in ascending order, and then each task t to be distributed is_iSet of users W_r，iThe users in the system are arranged in descending order according to the user reputation values;

s5, continuing the user allocation from the second round to the first round, and in the allocation process of each round, firstly arranging the tasks in the task set T to be allocated according to the ascending order of the user credit values to be allocated, and then traversing each task in the task set T to be allocated;

s6, finishing task distribution and finishing the distributed task set T_s＝T_sU.T. according to the set W of users assigned to the task_rAnd (4) the answers submitted by the users, and the task publisher evaluates the users.

As a further improvement of the present invention, the step S3 specifically includes:

s301, traversing ith task T in task set T to be distributed_i；

S302, if i < ═ T |, namely task T_iIn the task set T to be distributed, jumping to step S303, otherwise jumping to step S4;

s303, traversing jth user W in user set W_j；

S304, if j < ═ W |, i.e. user W_jIn the user set W, jumping to step S305, otherwise jumping to step S308;

s305, if the user w_jAt task t_iAnd satisfies task t_iIf so, jumping to step S306, otherwise, jumping to step S307;

s306, conforming to the task t_iRequested user w_jJoining to a user set W_r，iPerforming the following steps;

s307, continuously traversing the j +1 th user in the user set W, and jumping to the step S304;

s308, conforming to the task t_iAnd (4) all the required users are traversed, the (i + 1) th task in the task set T to be distributed is continuously traversed, and the step S302 is skipped.

As a further improvement of the present invention, the step S4 further includes:

and starting the first round of user allocation from the task with the minimum number of users in the task set T to be allocated.

As a further improvement of the present invention, the step S4 specifically includes:

s401, for each task in the task set to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the number of the tasks is null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S402;

s402, tasks to be distributedAll tasks in the set T are according to the number of participating users | W_r，iI is arranged in ascending order;

s403, for each task t to be distributed_iSet of users W_r，iThe users in (1) are arranged in descending order according to the reputation value;

s404, traversing the ith task T in the task set T to be distributed_iInitiating task t_iAssigned subscriber identity flag_iThis flag is used to determine task t_iWhether it has been assigned to a user;

s405, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S406, otherwise jumping to step S5;

s406, traversing task t_iSet of users W_r，iJ (th) user w in (1)_j；

S407, if j < ═ W_r，iI.e. user w_jIn a user set W_r，iIf yes, go to step S408, otherwise go to step S412;

s408, if the user w_jIf the task is not allocated in the stage, jumping to step S409, otherwise jumping to step S410;

s409, processing the task t_iIs assigned to user w_jFlag, flag_i＝true，x _i，j1 denotes the task t_iIs assigned to user w_jHold user w_jJoining a set of users W assigned to a task_rAnd assigned to task t_iSet of users W_iAnd user w_jFrom task t_iTo be allocated user set W_r，iDeleting, and jumping to step S412;

s410, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting;

s411, continuously traversing the user set W_r，iThe (j + 1) th user jumps to step S407;

s412, continuously traversing the (i + 1) th task in the task set T to be distributed, and jumping to the step S405.

As a further improvement of the present invention, the step S5 specifically includes:

s501, starting the h-th round of user allocation, wherein the initial value of h is 2;

s502, for each task in the task set T to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the data are all null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S503;

s503, if h < ═ l, that is, task allocation in this stage has not ended yet, jumping to step S504, otherwise jumping to S6;

s504, for all tasks in the task set T to be distributed, arranging the tasks according to the distributed user reputation values in an ascending order, and traversing the ith task T in the task set T to be distributed_i；

S505, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S506, otherwise jumping to step S515;

s506, traversing task t_iSet of users W_r，iJ (th) user w in (1)_j；

S507, if j < ═ W_r，iI.e. user w_jIn a user set W_r，iIf yes, jumping to step S508, otherwise jumping to step S511;

s508, if the user omega_jIf no task is allocated in this stage, go to step S509, otherwise go to step S510;

s509, task t_iIs assigned to user w_j，x _i，j1 denotes the task t_iTo a user omega_jLet user ω_jJoining a set of users W assigned to a task_rAnd assigned to task t_iUser W of_iAnd user w_jFrom task t_iTo be allocated user set W_r，iDeleting, and jumping to step S514;

s510, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting and continuously traversing the taskSet W of users to be allocated of ti_r，iThe (j + 1) th user, and simultaneously jumping to the step S507;

s511, if the task t_iAssigned subscriber identity flag_iTrue, i.e. task t_iIf the user is already allocated, but no user is next allocated, jumping to step S512, otherwise jumping to step 513;

s512, task t_iAssigned to users, and assign task t_iJoining to a set T of task assignment completions_sAnd the task t_iDeleting the task from the set T, continuously traversing the (i + 1) th task in the task set T, and simultaneously jumping to the step S505;

s513, task t_iDirectly assigning task t to user without distributing task t to user_iDeleting the task set T to be distributed;

s514, continuously traversing the (i + 1) th task in the task set T to be distributed, and jumping to the step S505;

and S515, continuing the h +1 th round of user allocation, and jumping to the step S502.

As a further improvement of the present invention, the step S6 further includes:

traverse set W_rAccording to user ω_jCompletion of task t_iEvaluation obtained thereafter e_i，jBy the formula rep_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jUpdating user omega_jThe reputation value of.

As a further improvement of the present invention, the step S6 specifically includes:

s601, traversing a user set W_rJ (th) user w in (1)_j；

S602, if j < | W_rI.e. user w_jIn a user set W_rIf yes, jumping to step S603, otherwise ending the updating;

s603, the crowdsourcing platform updates the formula rep according to the credit_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jAnd user w_jEvaluation obtained e_i，jTo user w_jUpdating the reputation value of the database;

s604, continuously traversing the user set W_rThe j +1 th user, jumps to step S602.

The invention has the beneficial effects that:

the invention can not only ensure the reliability of users, the heterogeneity of users and the heterogeneity of tasks, but also improve the actual benefit of tasks and stimulate more users to finish the tasks with high quality.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

FIG. 1 is a flowchart of a method for distributing crowdsourcing tasks based on user reliability in an embodiment of the invention;

FIG. 2 is a flowchart of user screening in an embodiment of the present invention;

FIG. 3 is a flow chart of a first round of allocating users in accordance with one embodiment of the present invention;

FIG. 4 is a flow chart of allocating users from the second round to the first round in accordance with an embodiment of the present invention;

FIG. 5 is a flowchart of updating a user reputation value in accordance with an embodiment of the present invention.

Detailed Description

In order to make those skilled in the art better understand the technical solution of the present invention, the technical solution in the embodiment of the present invention will be clearly and completely described below with reference to the drawings in the embodiment of the present invention, and it is obvious that the described embodiment is only a part of the embodiment of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The invention aims to provide a crowdsourcing task allocation method based on user reliability, which punishs partial selfish users by using a reward mechanism of a credit value aiming at the condition that the task quality of a user is too low, meanwhile awards are given to the users who finish high-quality tasks, and the users who finish the tasks with high quality are preferentially considered in the task allocation of the next stage. In order to make the best effort to ensure that each task can be finished with high quality, each task is distributed to l users to do so, and then the task publisher obtains the maximum benefit. In each distribution stage, the users are distributed in l rounds, each task can be distributed to only one user in each round, and each user is distributed to at most one task in each stage. The method not only considers the previous task completion condition of the user, but also considers the number of the participators of each task, and the first round distributes the users from the task with the least participators, so as to ensure that each task can be distributed to the users as far as possible. In the process of allocating users from the second round to the first round, users are allocated from the task with the lowest user credit value in each round, so that the purpose of balancing the users allocated to each task is to ensure that each task can be completed with high quality as much as possible.

The problem model adopted in the invention is specifically as follows:

assuming that a task publisher publishes n heterogeneous tasks on a crowdsourcing platform, that is, the requirement and the geographic location of each task are different, the set T ═ T₁，t₂，...，t_nRepresents it. Each task t_iIncluding a geographic location (x)_i，y_i) Detailed description of the invention D_iAnd offer b_iAnd D is_iIncluding task t_iSensing range of, completion task t_iSkill requirements and specific content of the task. Wherein the task t_iThe geographic position and the perception range of the task mean that the task is effective only when the task is completed within a certain range in a certain place, and the task t_iThe quote of (a) refers to the highest reward the task publisher is willing to pay the user. There are m heterogeneous users on the platform, i.e. the capacity of each user is differentFor the same task, the quality of completion is different for different users, using the set W ═ W₁，w₂，...，w_mRepresents it. Each user w_jIncluding a geographic location (x)_j，y_j) Reputation value rep_jSkill set A_jAnd cost of completing the task c_j. Where the user omega_jThe geographic location of (a) refers to the location where the user is currently located; the reputation value reflects the user w_jIn the past, the higher the reputation value is, the higher the quality of the task completed by the user is, and conversely, the lower the quality of the task completed by the user is. The skill set of the user refers to what types of tasks can be completed by the user, and the cost of the user refers to resources such as CPU resources and mobile phone electricity consumed by the user for completing the tasks. In each task allocation phase, each task is allocated to l users to complete, and as long as the users are within the perception range of the task and meet the skill requirements of the task, the users participate in the allocation of the task. Within each task assignment phase, each user is assigned to at most one task. In order to ensure that each task can be distributed to users and completed with high quality as much as possible, the platform reasonably selects the users and distributes the tasks in terms of the number of the users participating in the tasks and the reliability of the users participating in the tasks.

In view of the above problem model, referring to fig. 1, a method for allocating crowdsourcing tasks based on user reliability is disclosed in an embodiment of the present invention, wherein the symbolic descriptions involved in the steps are shown in table 1.

Table 1: are specific descriptions of the symbols in the present invention

Specifically, the crowd-sourced task allocation method based on user reliability in the embodiment includes the following six steps:

s1, the task publisher publishes n heterogeneous tasks on the crowdsourcing platform, and the set T is ═ T₁，t₂，...，t_nIndicates that there are m heterogeneous users on the crowdsourcing platform, and the set W ═ W₁，w₂，...，w_mRepresents;

s2, starting task allocation, initializing related tasks and user sets, and allocating the completed task sets

Set of users assigned to tasks

Is in accordance with task t_iConditional set of users to be allocated

Is assigned to task t_iUser set of

；

S3, for each task T in the task set T to be distributed_iSelecting users meeting the conditions to join the task t_iSet of users W_r，iThe purpose of the step is to screen a part of users which do not meet the task requirement, and for the users which meet the task requirement, the platform can select proper users to complete the task according to the following steps;

s4, according to the number | W of users participating in all tasks to be distributed in the set T_r，iI (greater than 0) is arranged in ascending order (from small to large), and then each task t to be distributed is subjected to_iSet of users W_r，iThe users in the step (2) are arranged in a descending order according to the user reputation value, and the step aims to ensure that each task can be distributed to the users as far as possible and simultaneously ensure that the tasks can be finished with high quality;

s5, continuing the user allocation from the second round to the first round, in the allocation process of each round, firstly arranging the tasks in the task set T to be allocated according to the user credit values to be allocated in an ascending order, and then traversing each task in the task set T to be allocated, wherein the purpose of the step is to ensure that each task is allocated to the user with high task quality as much as possible, and each task in each round is allocated to one user;

s6, finishing task distribution and finishing the distributed task set T_s＝T_sU.T. according to the set W of users assigned to the task_rAnd (4) the answers submitted by the users, and the task publisher evaluates the users. The purpose of this step is to update the reputation value of the user according to the evaluation obtained after the user completes the task, so that the platform decides whether to select the user according to the reputation value of the user in the task allocation of the next stage.

Referring to fig. 2, step S3 in this embodiment is specifically:

s301, traversing ith task T in task set T to be distributed_i；

S302, if i < ═ T |, namely task T_iIn the task set T to be distributed, jumping to step S303, otherwise jumping to step S4;

s303, traversing jth user W in user set W_j；

S304, if j < ═ W |, i.e. user W_jIn the user set W, jumping to step S305, otherwise jumping to step S308;

s305, if the user w_jAt task t_iAnd satisfies task t_iIf so, jumping to step S306, otherwise, jumping to step S307;

s306, conforming to the task t_iRequested user w_jJoining to a user set W_r，iPerforming the following steps;

s307, continuously traversing the j +1 th user in the user set W, and jumping to the step S304, wherein the purpose of the step is to do no matter the user omega_jWhether to meet task t_iThe request of (2) continues to traverse the (j + 1) th user in the user set W. (ii) a

S308, conforming to the task t_iAnd (4) all the required users are traversed, the (i + 1) th task in the task set T to be distributed is continuously traversed, and the step S302 is skipped.

In step S4, the first round of user assignment is started from the task in the to-be-assigned task set T with the smallest number of users.

Referring to fig. 3, step S4 in this embodiment is specifically:

s401, for each task in the task set to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the number of the tasks is null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S402;

s402, all tasks in the task set T to be distributed are determined according to the number | W of users participating in_r，iI (greater than 0) is arranged in an ascending order (from small to large), so that users are distributed from the task with the least number of participating users, and each task can be distributed to the users as far as possible;

s403, for each task t to be distributed_iSet of users W_r，iThe users in the system are arranged in descending order according to the reputation value so as to distribute the user with the highest reputation value for each task;

s404, traversing the ith task T in the task set T to be distributed_iInitiating task t_iAssigned subscriber identity flag_iThis flag is used to determine task t_iWhether it has been assigned to a user;

s405, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S406, otherwise jumping to step S5;

s406, traversing task t_iSet of users W_r，iJ (th) user w in (1)_j；

S407, if j < ═ W_r，iI.e. user omega_jIn a user set W_r，iIf yes, go to step S408, otherwise go to step S412;

s408, if the user w_jIf the task is not allocated in the stage, jumping to step S409, otherwise jumping to step S410;

s409, processing the task t_iIs assigned to user w_jFlag, flag_i＝true，x_i，j1 denotes the task t_iIs assigned to user w_jHold user w_jJoining a set of users W assigned to a task_rAnd assigned to task t_iSet of users W_iAnd user w_jFrom task t_iTo be allocated user set W_r，iDeleting, and jumping to step S412;

s410, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting;

s411, continuously traversing the user set W_r，iThe j +1 th user in (1) jumps to step S407. The purpose of this step is to slave task t_iTo be allocated user set W_r，iFinding a user that is not assigned to the task;

s412, continuously traversing the (i + 1) th task in the task set T to be distributed, and jumping to the step S405.

As shown in fig. 4, step S5 in this embodiment specifically includes:

s501, starting the h-th round of user allocation, wherein the initial value of h is 2;

s502, for each task in the task set T to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the data are all null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S503;

s503, if h < ═ l, that is, task allocation in this stage has not ended yet, jumping to step S504, otherwise jumping to S6;

s504, for all tasks in the task set T to be distributed, arranging the tasks according to the distributed user reputation values in an ascending order, and traversing the ith task T in the task set T to be distributed_iThe aim is to ensure that the task which is distributed to the low-quality users in the previous round is distributed to the high-quality users in the round as much as possible;

s505, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S506, otherwise jumping to step S515;

s506, traversing task t_iSet of users W_r，iJ in (1)A user w_j；

S507, if j < ═ W_r，iI.e. user w_jIn a user set W_r，iIf yes, jumping to step S508, otherwise jumping to step S511;

s508, if the user w_jIf no task is allocated in this stage, go to step S509, otherwise go to step S510;

s509, task t_iIs assigned to user w_j，x_i，j1 denotes the task t_iIs assigned to user w_jHold user w_jJoining a set of users W assigned to a task_rAnd assigned to task t_iUser W of_iAnd user omega_jFrom task t_iTo be allocated user set W_r，iDeleting, and jumping to step S514;

s510, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting and continuously traversing the task t_iTo be allocated user set W_r，iThe (j + 1) th user, and simultaneously jumping to the step S507;

s511, if the task t_iAssigned subscriber identity flag_iTrue, i.e. task t_iIf the user is already allocated, but no user is next allocated, jumping to step S512, otherwise jumping to step 513;

s512, task t_iAssigned to users, and assign task t_iJoining to a set T of task assignment completions_sAnd the task t_iDeleting the task from the set T, continuously traversing the (i + 1) th task in the task set T, and simultaneously jumping to the step S505;

s513, task t_iDirectly assigning task t to user without distributing task t to user_iDeleting the task set T to be distributed;

s514, continuously traversing the (i + 1) th task in the task set T to be distributed, and jumping to the step S505;

and S515, continuing the h +1 th round of user allocation, and jumping to the step S502.

Steps in this embodimentStep S6 further includes: traverse set W_rAccording to user w_jCompletion of task t_iEvaluation obtained thereafter e_i，jBy the formula rep_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jUpdating user w_jSo that the platform decides whether to select the user according to the reputation value of the user in the task allocation of the next stage.

As shown in fig. 5, step S6 in this embodiment is specifically:

s601, traversing a user set W_rThe jth user ω in (1)_j；

S602, if j < | W_rI.e. user w_jIn a user set W_rIf yes, jumping to step S603, otherwise ending the updating;

s603, the crowdsourcing platform updates the formula rep according to the credit_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jAnd user w_jEvaluation obtained e_i，jTo user w_jUpdating the reputation value of the database;

s604, continuously traversing the user set W_rThe j +1 th user, jumps to step S602.

According to the technical scheme, the reliable task allocation method is provided under the conditions that the number of the task participants is small and the selfish characteristic exists in the user. Wherein:

in each task allocation stage, each task is allocated to l users to be completed, the users allocate the tasks in l rounds, each task can be allocated to only one user in each round, and each task is allocated to l users through the allocation in l rounds;

in each task allocation stage, firstly, arranging all tasks to be allocated in an ascending order (from small to large) according to the number of users participating in allocation, and then, arranging all tasks to be allocated in a descending order according to credit values of the users participating in allocation;

the first round of task allocation is to allocate users from the task with the least number of users participating in allocation (the aim is to ensure that the tasks with the least number of users participating in allocation are also allocated to the users as far as possible), and each task in each round can be allocated to only one user;

the assignment of tasks from the second round to the l round is as follows: firstly, arranging all tasks to be distributed in an ascending order according to the distributed user credit values, and distributing users from the task with the minimum value; if the task has no distributable users, deleting the task from the task set to be distributed; in each task allocation stage, once a user is allocated to a task, the user is deleted from a user set to be allocated, and the user cannot be allocated to other tasks in the stage;

and finally, the user submits the task answers to the task publisher, and the task publisher evaluates the user according to the answers submitted by the user. And the platform updates the reputation values of all the users distributed to the tasks according to the evaluation of the task publisher on the users. In the next task allocation phase, all users can participate in the allocation of tasks again.

In conclusion, the invention can not only ensure the reliability of users, the heterogeneity of users and the heterogeneity of tasks, but also improve the actual benefit of tasks and stimulate more users to finish the tasks with high quality.

It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.

Furthermore, it should be understood that although the present description refers to embodiments, not every embodiment may contain only a single embodiment, and such description is for clarity only, and those skilled in the art should integrate the description, and the embodiments may be combined as appropriate to form other embodiments understood by those skilled in the art.

Claims (3)

1. A crowd-sourced task allocation method based on user reliability, the method comprising:

s1, the task publisher publishes n heterogeneous tasks on the crowdsourcing platform, and the set T is ═ T₁，t₂，...，t_nIndicates that there are m heterogeneous users on the crowdsourcing platform, and the set W ═ W₁，w₂，...，w_mRepresents;

s2, starting task allocation, initializing related tasks and user sets, and allocating the completed task sets

User collection assigned to tasks

Conforming to task t_iConditional set of users to be allocated

Assigned to task t_iUser set of

S3, for each task T in the task set T to be distributed_iSelecting users meeting the conditions to join the task t_iSet of users W_r，iPerforming the following steps;

s4, according to the number | W of users participating in all tasks to be distributed in the set T_r，iI is arranged in ascending order, and then each task t to be distributed is_iSet of users W_r，iThe users in the system are arranged in descending order according to the user reputation values;

s5, continuing the user allocation from the second round to the first round, and in the allocation process of each round, firstly arranging the tasks in the task set T to be allocated according to the ascending order of the user credit values to be allocated, and then traversing each task in the task set T to be allocated;

s6, finishing task distribution and finishing the distributed task set T_s＝T_sUT, set of users W according to assignment to tasks_rThe answers submitted by the users, and the task publisher evaluates the users; the step S3 specifically includes:

s301, traversing ith task T in task set T to be distributed_i；

S302, if i < ═ T |, namely task T_iIn the task set T to be distributed, jumping to step S303, otherwise jumping to step S4;

s303, traversing jth user W in user set W_j；

S304, if j < ═ W |, i.e. user W_jIn the user set W, jumping to step S305, otherwise jumping to step S308;

s305, if the user w_jAt task t_iAnd satisfies task t_iIf so, jumping to step S306, otherwise, jumping to step S307;

s306, conforming to the task t_iRequested user w_jJoining to a user set W_r，iPerforming the following steps;

s307, continuously traversing the j +1 th user in the user set W, and jumping to the step S304;

s308, conforming to the task t_iThe required users are completely traversed, the (i + 1) th task in the task set T to be distributed is continuously traversed, and the step S302 is skipped; the step S4 further includes:

starting first round user allocation from the task with the minimum user number in the task set T to be allocated; the step S4 specifically includes:

s401, for each task in the task set to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the number of the tasks is null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S402;

s402, all tasks in the task set T to be distributed are determined according to the number | W of users participating in_r，iI is arranged in ascending order;

s403, for each task t to be distributed_iSet of users W_r，iThe users in (1) are arranged in descending order according to the reputation value;

s404, traversing the ith task T in the task set T to be distributed_iInitiating task t_iAssigned subscriber identity flag_iThis flag is used to determine task t_iWhether it has been assigned to a user;

s405, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S406, otherwise jumping to step S5;

s406, traversing task t_iSet of users W_r，iJ (th) user w in (1)_j；

S407, if j < ═ W_r，iI.e. user omega_jIn a user set W_r，iIf yes, go to step S408, otherwise go to step S412;

s408, if the user w_jIf the task is not allocated in the stage, jumping to step S409, otherwise jumping to step S410;

s409, processing the task t_iIs assigned to user w_jFlag, flag_i＝true，x_i，j1 denotes the task t_iIs assigned to user w_jHold user w_jJoining a set of users W assigned to a task_rAnd assigned to task t_iSet of users W_iAnd user w_jFrom task t_iTo be allocated user set W_r，iDeleting while jumping to step S411;

s410, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting;

s411, continuously traversing the user set W_r，iThe (j + 1) th user jumps to step S407;

s412, task t_iA user is already allocated in the round of allocation, the (i + 1) th task in the task set T to be allocated is continuously traversed, and the step S405 is skipped; the step S5 specifically includes:

s501, starting the h-th round of user allocation, wherein the initial value of h is 2;

s502, for each task in the task set T to be distributed, if the task requirement is met, the user set W to be distributed_r，iIf the data are all null, that is, no user meets the requirement of the task, the distribution is finished, and the step is skipped to step S6, otherwise, the step is skipped to step S503;

s503, if h < l, namely the task allocation in the stage is not finished, jumping to step S504, otherwise jumping to S6, wherein l is the number of users allocated to each task;

s504, for all tasks in the task set T to be distributed, arranging the tasks according to the distributed user reputation values in an ascending order, and traversing the ith task T in the task set T to be distributed_i；

S505, if i < | T |, namely task T_iIn the task set T to be distributed, jumping to step S506, otherwise jumping to step S515;

s506, traversing task t_iSet of users W_r，iJ (th) user w in (1)_j；

S507, if j < ═ W_r，iI.e. user w_jIn a user set W_r，iIf yes, jumping to step S508, otherwise jumping to step S511;

s508, if the user w_jIf no task is allocated in this stage, go to step S509, otherwise go to step S510;

s509, task t_iIs assigned to user w_j，x_i，j1 denotes the task t_iIs assigned to user w_jHold user w_jJoining a set of users W assigned to a task_rAnd assigned to task t_iUser W of_iAnd user w_jFrom task t_iTo be allocated user set W_r，iDeleting, and jumping to step S514;

s510, user w_jHas been assigned to a task, user w_jFrom task t_iTo be allocated user set W_r，iDeleting and continuously traversing the task t_iTo be allocated user set W_r，iThe (j + 1) th user, and simultaneously jumping to the step S507;

s511, if the task t_iAssigned subscriber identity flag_iTrue, i.e. task t_iIf the user is already allocated, but no user is next allocated, jumping to step S512, otherwise jumping to step 513;

s512, task t_iAssigned to users, and assign task t_iJoining to a set T of task assignment completions_sAnd the task t_iDeleting the task from the set T, continuously traversing the (i + 1) th task in the task set T, and simultaneously jumping to the step S505;

s513, task t_iDirectly assigning task t to user without distributing task t to user_iDeleting the task set T to be distributed;

s514, continuously traversing the (i + 1) th task in the task set T to be distributed, and jumping to the step S505;

and S515, continuing the h +1 th round of user allocation, and jumping to the step S502.

2. The method for crowd-sourced task allocation based on user reliability as claimed in claim 1, wherein the step S6 further comprises:

traverse set W_rAccording to user w_jCompletion of task t_iEvaluation obtained thereafter e_i，jBy the formula rep_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jUpdating user w_jAlpha is a weight coefficient of the reputation value.

3. The method for distributing crowdsourcing tasks based on user reliability as claimed in claim 2, wherein the step S6 specifically comprises:

s601, traversing a user set W_rThe jth user ω in (1)_j；

S602, if j < | W_rI.e. user w_jIn a user set W_rIf yes, jumping to step S603, otherwise ending the updating;

s603, the crowdsourcing platform updates the formula rep according to the credit_r，j＝αrep_r-1，j+(1-α)2e_i，jrep_r-1，jAnd user w_jEvaluation obtained e_i，jTo user w_jUpdating the reputation value of the database;

s604, continuously traversing the user set W_rThe j +1 th user, jumps to step S602.

Images