CN106557891A - Mass-rent method for allocating tasks based on user dependability - Google Patents
Mass-rent method for allocating tasks based on user dependability Download PDFInfo
- Publication number
- CN106557891A CN106557891A CN201611105342.5A CN201611105342A CN106557891A CN 106557891 A CN106557891 A CN 106557891A CN 201611105342 A CN201611105342 A CN 201611105342A CN 106557891 A CN106557891 A CN 106557891A
- Authority
- CN
- China
- Prior art keywords
- user
- task
- allocated
- tasks
- skip
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063112—Skill-based matching of a person or a group to a task
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06395—Quality analysis or management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/101—Collaborative creation, e.g. joint development of products or services
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of mass-rent method for allocating tasks based on user dependability, methods described includes：S1, input user's set W and set of tasks T；S2, distribution is begun a task with, and carry out the initialization of inter-related task and user's set；S3, for each task t in set of tasks T to be allocatedi, select qualified user to add task tiUser set WR, iIn；S4, the user's distribution of the beginning first round, travel through each task in set of tasks T to be allocated；S5, continuation second take turns to user's distribution of l wheels, travel through each task t in set of tasks T to be allocatedi；S6, task distribution terminate, according to set WrMiddle user completes the quality of task, and the credit value of user is updated.The heterogeneity of the reliability that not only can ensure user of the invention, the heterogeneous and task of user, and the actual gain of task can be improved, encourage more users to complete task in high quality.
Description
Technical field
The present invention relates to computer network and communication technical field, more particularly to a kind of mass-rent based on user dependability
Method for allocating tasks.
Background technology
Mass-rent refers to the task that a company or mechanism are performed the past by employee, with freely voluntary form outside
Wrap to the way of unspecific (and typically large-scale) masses network.Personnel on mass-rent platform are divided into two classes：In platform
The personnel of upper release tasks are referred to as task publisher, and the personnel for completing task are referred to as user.Task publisher is issued on platform
Task, user obtain certain remuneration by completing task.The typical mission of mass-rent has design configuration, collection marketing program, figure
As mark and data acquisition etc..
The working method of mass-rent can help task publisher to obtain a large amount of free users, by using these users'
Wisdom solving practical problems.However, as user and task publisher have selfish characteristic and are devoted to obtaining itself benefit
Maximization, such situation cause in the result submitted to by user comprising it is a large amount of arbitrarily in addition falsenesses answer, it is final to cause
Task publisher does not obtain high-quality answer.Therefore, user how is encouraged to complete task in high quality, so as to support mission
Publisher obtains the quality of result data, becomes the important step of optimization mass-rent service.
However, the existing discussion for QoS of customer difference is existed only in simple method for allocating tasks, and
Do not provide rational incentive mechanism to attract user to participate in task.And existing research great majority are all to put forth effort on single user
Single task model, i.e. each task be assigned to only a user and go to complete, and does not take into full account the reliability of user, user
Heterogeneous and task it is heterogeneous the problems such as, i.e., for same task, the quality that different user is completed is different；And
For same user, its quality for completing different task is also different.As can be seen here, mass-rent working method and swash
The design aspect of mechanism is encouraged, defect is also there is, the actual demand of mass-rent system can not be met.
Therefore, for above-mentioned technical problem, it is necessary to set up a kind of perfect mass-rent task based on user dependability point
Method of completing the square, this method not only can ensure the reliability of user, the heterogeneity of the heterogeneous and task of user, and can be with
The actual gain of raising task, encourages more users to complete task in high quality.
The content of the invention
In view of this, it is an object of the invention to provide a kind of mass-rent method for allocating tasks based on user dependability, with
Excitation user completes task in high quality, improves task benefit.
To achieve these goals, technical scheme provided in an embodiment of the present invention is as follows：
A kind of mass-rent method for allocating tasks based on user dependability, methods described include：
S1, task publisher issue n heterogeneous task on mass-rent platform, with set T={ t1, t2..., tnRepresent,
There is m heterogeneous user on mass-rent platform, with set W={ w1, w2..., wmRepresent；
S2, distribution is begun a task with, and carry out the initialization of inter-related task and user's set, the set of tasks being assigned, it is assigned to user's set of task, meet task tiUser's set to be allocated of condition, point
It is fitted on task tiUser set；
S3, for each task t in set of tasks T to be allocatedi, select qualified user to add task tiUse
Family set WR, iIn；
S4, to all tasks to be allocated in set T according to participate in number of users | WR, i| ascending order is arranged, then each is treated point
With task tiUser set WR, iIn user according to user's credit value descending arrange；
S5, continuation second take turns to user's distribution of l wheels, in the assigning process of each wheel, first to task-set to be allocated
The task in T is closed according to the user's credit value ascending order arrangement being assigned to, then travels through each task in set of tasks T to be allocated；
S6, task distribution terminate, set of tasks T being assigneds=Ts∪ T, according to the user set W of the task that is assigned tor
Evaluation is made in the answer that middle user submits to, task publisher to user.
As a further improvement on the present invention, step S3 is specially：
S301, i-th task t traveled through in set of tasks T to be allocatedi；
If S302, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S303 is skipped to, is otherwise skipped to
Step S4；
J-th user w in S303, traverse user set Wj；
If S304, j were ＜=| W |, i.e. user wjIn user set W, then step S305 is skipped to, otherwise skip to step
S308；
If S305, user wjIn task tiSensing range in and meet task tiSkill requirement, then skip to step
S306, otherwise skips to step S307；
S306, meeting task tiThe user w of requirementjIt is added to user set WR, iIn；
S307 ,+1 user of jth continued in traverse user set W, skip to step S304；
S308, meet task tiThe user of requirement all travels through, and i-th in continuation traversal set of tasks T to be allocated+
1 task, skips to step S302.
As a further improvement on the present invention, also include in step S4：
Start first round user distribution from the minimum task of participating user number in set of tasks T to be allocated.
As a further improvement on the present invention, step S4 is specially：
S401, for each task in set of tasks to be allocated, if meeting the user to be allocated set of mission requirements
WR, iAll it is empty, that is, does not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S402；
S402, to set of tasks T to be allocated in all tasks according to participating user number | WR, i| ascending order is arranged；
S403, for each task t to be allocatediUser set WR, iIn user according to credit value descending arrange；
S404, i-th task t traveled through in set of tasks T to be allocatedi, initialization task tiDistributing user mark
flagi=false, this mark are used for judging task tiWhether user has been assigned to；
If S405, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S406 is skipped to, is otherwise skipped to
Step S5；
S406, traversal task tiUser set WR, iIn j-th user wj；
If S407, j were ＜=| WR, i|, i.e. user wjIn user set WR, iIn, then step S408 is skipped to, step is otherwise skipped to
Rapid S412；
If S408, user wjIt is unallocated within this stage then to skip to step S409 to task, otherwise skip to step
S410；
S409, task tiDistribute to user wj, mark flagi=true, xI, j=1 represents task tiDistribute to user
wj, user wjAddition has been assigned to the user set W of taskrBe assigned to task tiUser set WiIn, and user wj
From task tiUser's set W to be allocatedR, iMiddle deletion, while skipping to step S412；
S410, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion；
S411, continuation traverse user set WR, iIn+1 user of jth, skip to step S407；
S412, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S405.
As a further improvement on the present invention, step S5 is specially：
S501, beginning h wheel user's distribution, the initial value of h is 2；
S502, for each task in set of tasks T to be allocated, if meeting the user to be allocated set of mission requirements
WR, iAll it is empty, that is, does not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S503；
If S503, h be ＜=l, i.e., task distribution in this stage is not over, then skip to step S504, otherwise skip to
S6；
S504, for set of tasks T to be allocated in all tasks according to be assigned to user's credit value ascending order arrangement, time
I-th task t gone through in set of tasks T to be allocatedi；
If S505, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S506 is skipped to, is otherwise skipped to
Step S515；
S506, traversal task tiUser set WR, iIn j-th user wj；
If S507, j were ＜=| WR, i|, i.e. user wjIn user set WR, iIn, then step S508 is skipped to, step is otherwise skipped to
Rapid S511；
If S508, user ωjIt is unallocated within this stage then to skip to step S509 to task, otherwise skip to step
S510；
S509, task tiDistribute to user wj, xI, j=1 represents task tiDistribute to user ωj, user ωjAdd
It has been assigned to the user set W of taskrBe assigned to task tiUser WiIn, and user wjFrom task tiUser to be allocated
Set WR, iMiddle deletion, while skipping to step S514；
S510, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion, after
User's set W to be allocated of continuous traversal task tiR, iIn+1 user of jth, while skipping to step S507；
If S511, task tiDistributing user mark flagi=true, i.e. task tiUser is had been dispensed into, but is connect
No user that gets off can distribute, then skip to step S512, otherwise skip to step 513；
S512, task tiUser is assigned to, task tiThe set T that the task of being added to is assignedsIn, and task
tiDelete from set T, continue the i+1 task in traversal set of tasks T, while skipping to step S505；
S513, task tiIt is unallocated to user, directly task tiDelete from set of tasks T to be allocated；
S514, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S505；
S515, the user's distribution for continuing h+1 wheels, skip to step S502.
As a further improvement on the present invention, step S6 also includes：
Traversal set WrIn all users, according to user ωjComplete task tiThe evaluation e for obtaining afterwardsI, j, by formula
repR, j=α repR-1, j+(1-α)2eI, jrepR-1, jUpdate user ωjCredit value.
As a further improvement on the present invention, step S6 is specially：
S601, traverse user set WrIn j-th user wj；
If S602, j were ＜=| Wr|, i.e. user wjIn user set WrIn, then step S603 is skipped to, otherwise terminates to update；
S603, mass-rent platform are according to reputation updating formula repR, j=α repR-1, j+(1-α)2eI, jrepR-1, jWith user wjObtain
The evaluation e for obtainingI, j, to user wjCredit value be updated；
S604, continuation traverse user set WrIn+1 user of jth, skip to step S602.
The invention has the beneficial effects as follows：
The present invention not only can ensure the reliability of user, the heterogeneity of the heterogeneous and task of user, and can be with
The actual gain of raising task, encourages more users to complete task in high quality.
Description of the drawings
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
Accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments described in invention, for those of ordinary skill in the art, on the premise of not paying creative work,
Can be with according to these other accompanying drawings of accompanying drawings acquisition.
Fig. 1 be the embodiment of the invention in based on user dependability mass-rent method for allocating tasks flow chart；
Fig. 2 is the flow chart of screening user in the embodiment of the invention；
Fig. 3 is the flow chart of first round distributing user in the embodiment of the invention；
Fig. 4 is the second flow chart for taking turns to l wheel distributing users in the embodiment of the invention；
Fig. 5 is the flow chart of renewal user's credit value in the embodiment of the invention.
Specific embodiment
In order that those skilled in the art more fully understand the technical scheme in the present invention, below in conjunction with present invention enforcement
Accompanying drawing in example, is clearly and completely described to the technical scheme in the embodiment of the present invention, it is clear that described embodiment is only
Only it is a part of embodiment of the invention, rather than the embodiment of whole.Based on the embodiment in the present invention, ordinary skill people
The every other embodiment obtained under the premise of creative work is not made by member, should all belong to the scope of protection of the invention.
The purpose of the present invention is to propose to a kind of mass-rent method for allocating tasks based on user dependability, completes to appoint for user
The too low situation of business quality, using the award mechanism of credit value, the user selfish to part punishes, while completing to those
The user of high-quality task awards, and in the task distribution in next stage, pays the utmost attention to those high-quality and completes task
User.Ensure that each task can be completed in high quality to try one's best, each task is distributed to l use
Family is done, and then makes task publisher obtain greatest benefit.In each allocated phase, user divides l wheels to be allocated, each
Task can only be assigned to a user in each wheel, and each user is at most assigned to a task in each stage.The method is not
Only account for the situation that user completed task in the past, and consider the participation number of each task, the first round is from the number of participation
Minimum task starts distributing user, in order to ensure that each task can be assigned to user as far as possible.Second
Take turns in user's assigning process of l wheels, each wheel is all to start distributing user from being assigned to the minimum task of user's credit value,
Purpose is the user being assigned to for balanced each task, ensures that each task can be completed in high quality as far as possible.
The problem model adopted in the present invention is specific as follows：
Assume that, on mass-rent platform, task publisher has issued the requirement of n heterogeneous task, i.e. each task and geography
Position is different, with set T={ t1, t2..., tnRepresent.Each task tiComprising geographical position (xi, yi), specifically describe
DiWith quotation bi, and DiIncluding task tiSensing range, complete task tiSkill requirement and task particular content.Wherein appoint
Business tiGeographical position and sensing range refer to this task and complete in some place certain limit just effectively, and task
tiQuotation refer to task publisher and be ready to pay the highest remuneration of user.There is m heterogeneous user on platform, i.e. each use
The ability at family is different, and for same task, the quality that different user is completed is different, with set W={ w1,
w2..., wmRepresent.Each user wjComprising geographical position (xj, yj), credit value repj, skill collection AjWith complete task
Cost cj.Wherein user ωjGeographical position refer to the position that user is currently located；Credit value reflects user wjIt is in the past complete
Into the situation of task, credit value is higher, illustrate user complete task quality it is higher, conversely, explanation user completes the matter of task
Amount is lower.The skill collection of user refers to the task which type user can complete, and it is complete that the cost of user refers to user
The resources such as the cpu resource that consumed into task, mobile phone electricity.In each task allocated phase, each task distributes to l use
Family is gone to complete, as long as user is in the sensing range of task and meets the skill requirement of task, then user just participates in taking office
In the distribution of business.In each task allocated phase, each user is at most assigned to a task.It is every in order to ensure as far as possible
Individual task can be assigned to user and be completed in high quality, and platform will be from the participating user number of task and participating user
Two aspects of reliability are reasonably selecting user and distribute task.
Model, joins shown in Fig. 1 in view of the above problems, and one kind is disclosed in the embodiment of the invention can based on user
By the mass-rent method for allocating tasks of property, wherein shown in the symbol description ginseng table 1 being related in each step.
Table 1：Illustrate for symbol in the present invention
Specifically, the mass-rent method for allocating tasks in present embodiment based on user dependability includes following six step：
S1, task publisher issue n heterogeneous task on mass-rent platform, with set T={ t1, t2..., tnRepresent,
There is m heterogeneous user on mass-rent platform, with set W={ w1, w2..., wmRepresent；
S2, distribution is begun a task with, and carry out the initialization of inter-related task and user's set, the set of tasks being assigned, it is assigned to user's set of task, meet task tiUser's set to be allocated of condition, distribution
To task tiUser set；
S3, for each task t in set of tasks T to be allocatedi, select qualified user to add task tiUse
Family set WR, iIn, the purpose of this step is to screen out a part not meeting the user of mission requirements, for meeting mission requirements
User, platform can select suitable user to complete task according to following steps；
S4, to all tasks to be allocated in set T according to participate in number of users | WR, i| the arrangement of (be more than 0) ascending order (by it is little to
Greatly), then to each task t to be allocatediUser set WR, iIn user according to user's credit value descending arrange, this step
Purpose is to ensure that while ensureing that each task can be assigned to user as far as possible task can be completed in high quality；
S5, continuation second take turns to user's distribution of l wheels, in the assigning process of each wheel, first to task-set to be allocated
The task in T is closed according to the user's credit value ascending order arrangement being assigned to, then travels through each task in set of tasks T to be allocated,
The purpose of this step is to ensure that each task is assigned to as far as possible and completes the high user of Task Quality, each wheel each task
One user of distribution；
S6, task distribution terminate, set of tasks T being assigneds=Ts∪ T, according to the user set W of the task that is assigned tor
Evaluation is made in the answer that middle user submits to, task publisher to user.The purpose of this step is to complete to obtain after task according to user
The evaluation for obtaining updates the credit value of user, so that platform is determined according to the credit value of user in the task distribution in next stage
Whether this user is selected.
Shown in ginseng Fig. 2, step S3 in present embodiment is specially：
S301, i-th task t traveled through in set of tasks T to be allocatedi；
If S302, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S303 is skipped to, is otherwise skipped to
Step S4；
J-th user w in S303, traverse user set Wj；
If S304, j were ＜=| W |, i.e. user wjIn user set W, then step S305 is skipped to, otherwise skip to step
S308；
If S305, user wjIn task tiSensing range in and meet task tiSkill requirement, then skip to step
S306, otherwise skips to step S307；
S306, meeting task tiThe user w of requirementjIt is added to user set WR, iIn；
S307 ,+1 user of jth continued in traverse user set W, skip to step S304, the purpose of this step be no matter
User ωjWhether task t is metiRequirement ,+1 user of jth in traverse user set W will be continued.；
S308, meet task tiThe user of requirement all travels through, and i-th in continuation traversal set of tasks T to be allocated+
1 task, skips to step S302.
Wherein, it is to start first round user from the minimum task of participating user number in set of tasks T to be allocated in step S4
Distribution.
Shown in ginseng Fig. 3, step S4 in present embodiment is specially：
S401, for each task in set of tasks to be allocated, if meeting the user to be allocated set of mission requirements
WR, iAll it is empty, that is, does not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S402；
S402, to set of tasks T to be allocated in all tasks according to participating user number | WR, i| (being more than 0) ascending order arrangement
(ascending), to start distributing user from the minimum task of participating user number, ensures that each task can be divided as far as possible
It is fitted on user；
S403, for each task t to be allocatediUser set WR, iIn user according to credit value descending arrange, so as to
Distribute credit value highest user for each task；
S404, i-th task t traveled through in set of tasks T to be allocatedi, initialization task tiDistributing user mark
flagi=false, this mark are used for judging task tiWhether user has been assigned to；
If S405, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S406 is skipped to, is otherwise skipped to
Step S5；
S406, traversal task tiUser set WR, iIn j-th user wj；
If S407, j were ＜=| WR, i|, i.e. user ωjIn user set WR, iIn, then step S408 is skipped to, is otherwise skipped to
Step S412；
If S408, user wjIt is unallocated within this stage then to skip to step S409 to task, otherwise skip to step
S410；
S409, task tiDistribute to user wj, mark flagi=true, xI, j=1 represents task tiDistribute to user
wj, user wjAddition has been assigned to the user set W of taskrBe assigned to task tiUser set WiIn, and user wj
From task tiUser's set W to be allocatedR, iMiddle deletion, while skipping to step S412；
S410, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion；
S411, continuation traverse user set WR, iIn+1 user of jth, skip to step S407.The purpose of this step be from
Task tiUser's set W to be allocatedR, iIn find a unallocated user to task；
S412, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S405.
Shown in ginseng Fig. 4, step S5 in present embodiment is specially：
S501, beginning h wheel user's distribution, the initial value of h is 2；
S502, for each task in set of tasks T to be allocated, if meeting the user to be allocated set of mission requirements
WR, iAll it is empty, that is, does not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S503；
If S503, h be ＜=l, i.e., task distribution in this stage is not over, then skip to step S504, otherwise skip to
S6；
S504, for set of tasks T to be allocated in all tasks according to be assigned to user's credit value ascending order arrangement, time
I-th task t gone through in set of tasks T to be allocatedi, in order to ensure as far as possible last round of to be assigned to low quality user
Task here wheel distribution in be assigned to high-quality user；
If S505, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S506 is skipped to, is otherwise skipped to
Step S515；
S506, traversal task tiUser set WR, iIn j-th user wj；
If S507, j were ＜=| WR, i|, i.e. user wjIn user set WR, iIn, then step S508 is skipped to, step is otherwise skipped to
Rapid S511；
If S508, user wjIt is unallocated within this stage then to skip to step S509 to task, otherwise skip to step
S510；
S509, task tiDistribute to user wj, xI, j=1 represents task tiDistribute to user wj, user wjAdd
It is assigned to the user set W of taskrBe assigned to task tiUser WiIn, and user ωjFrom task tiUser to be allocated
Set WR, iMiddle deletion, while skipping to step S514；
S510, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion, after
Continuous traversal task tiUser's set W to be allocatedR, iIn+1 user of jth, while skipping to step S507；
If S511, task tiDistributing user mark flagi=true, i.e. task tiUser is had been dispensed into, but is connect
No user that gets off can distribute, then skip to step S512, otherwise skip to step 513；
S512, task tiUser is assigned to, task tiThe set T that the task of being added to is assignedsIn, and task
tiDelete from set T, continue the i+1 task in traversal set of tasks T, while skipping to step S505；
S513, task tiIt is unallocated to user, directly task tiDelete from set of tasks T to be allocated；
S514, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S505；
S515, the user's distribution for continuing h+1 wheels, skip to step S502.
Step S6 in present embodiment also includes：Traversal set WrIn all users, according to user wjComplete task ti
The evaluation e for obtaining afterwardsI, j, by formula repR, j=α repR-1, j+(1-α)2eI, jrepR-1, jUpdate user wjCredit value, to put down
Platform in the task distribution in next stage decides whether to select this user according to the credit value of user.
Shown in ginseng Fig. 5, step S6 in present embodiment is specially：
S601, traverse user set WrIn j-th user ωj；
If S602, j were ＜=| Wr|, i.e. user wjIn user set WrIn, then step S603 is skipped to, otherwise terminates to update；
S603, mass-rent platform are according to reputation updating formula repR, j=α repR-1, j+(1-α)2eI, jrepR-1, jWith user wjObtain
The evaluation e for obtainingI, j, to user wjCredit value be updated；
S604, continuation traverse user set WrIn+1 user of jth, skip to step S602.
By above-mentioned technical proposal as can be seen that the present invention is less in task participant's number, there is selfish characteristic in user
In the case of provide reliable method for allocating tasks.Wherein：
In each task allocated phase, each task is distributed to l user and is completed, and user divides l wheels to be allocated, and each is appointed
Business can only be assigned to a user in each wheel, and through the distribution of l wheels, each task is also just assigned to l user；
In each task allocated phase, first to all tasks to be allocated according to the number of users ascending order arrangement participated in the distribution
(ascending), then arranges according to the credit value descending of the user that participates in the distribution to each task to be allocated；
The first round task distribution be from the minimum task of number of users of participating in the distribution start distributing user (purpose be ensure participate in
The few task of number of users is also assigned to user as far as possible), often take turns each task and can only be assigned to a user；
It is allocated as follows from the second task of taking turns to l wheels：First to all tasks to be allocated according to the user's prestige being assigned to
Value ascending order arrangement, starts distributing user from the minimum task of value；If task does not have assignable user, task from treating point
Delete with set of tasks；In each task allocated phase, once user is assigned to task, then user from user to be allocated
Delete in set, in this stage, the user can not be redistributed to other tasks；
Finally, user submits to task publisher task answer, the answer that task publisher is submitted to according to user to
Evaluated at family.Platform can be according to task publisher to user evaluation, credit value is carried out to all users for being assigned to task
Update.In next task allocated phase, all users can be participated in the distribution of task again.
In sum, the present invention not only can ensure the reliability of user, the heterogeneity of the heterogeneous and task of user,
And the actual gain of task can be improved, encourage more users to complete task in high quality.
It is obvious to a person skilled in the art that the invention is not restricted to the details of above-mentioned one exemplary embodiment, Er Qie
In the case of spirit or essential attributes without departing substantially from the present invention, the present invention can be realized in other specific forms.Therefore, no matter
From the point of view of which point, embodiment all should be regarded as exemplary, and be nonrestrictive, the scope of the present invention is by appended power
Profit is required rather than described above is limited, it is intended that all in the implication and scope of the equivalency of claim by falling
Change is included in the present invention.Any reference in claim should not be considered as and limit involved claim.
Moreover, it will be appreciated that although this specification is been described by according to embodiment, not each embodiment is only wrapped
Containing an independent technical scheme, this narrating mode of specification is only that those skilled in the art should for clarity
Using specification as an entirety, the technical scheme in each embodiment can also Jing it is appropriately combined, form those skilled in the art
Understandable other embodiment.
Claims (7)
1. a kind of mass-rent method for allocating tasks based on user dependability, it is characterised in that methods described includes：
S1, task publisher issue n heterogeneous task on mass-rent platform, with set T={ t1, t2..., tnRepresent, mass-rent
There is m heterogeneous user on platform, with set W={ w1, w2..., wmRepresent；
S2, distribution is begun a task with, and carry out the initialization of inter-related task and user's set, the set of tasks being assignedIt is assigned to user's set of taskMeet task tiUser's set to be allocated of conditionDistribution
To task tiUser set
S3, for each task t in set of tasks T to be allocatedi, select qualified user to add task tiUser collection
Close WR, iIn；
S4, to all tasks to be allocated in set T according to participate in number of users | WR, i| ascending order is arranged, then to each to be allocated
Business tiUser set WR, iIn user according to user's credit value descending arrange；
S5, continuation second take turns to user's distribution of l wheels, in the assigning process of each wheel, first in set of tasks T to be allocated
Task according to the user's credit value ascending order arrangement being assigned to, then travel through each task in set of tasks T to be allocated；
S6, task distribution terminate, set of tasks T being assigneds=Ts∪ T, according to the user set W of the task that is assigned torMiddle use
Evaluation is made in the answer that family is submitted to, task publisher to user.
2. the mass-rent method for allocating tasks based on user dependability according to claim 1, it is characterised in that the step
S3 is specially：
S301, i-th task t traveled through in set of tasks T to be allocatedi；
If S302, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S303 is skipped to, otherwise skip to step
S4；
J-th user w in S303, traverse user set Wj；
If S304, j were ＜=| W |, i.e. user wjIn user set W, then step S305 is skipped to, otherwise skip to step S308；
If S305, user wjIn task tiSensing range in and meet task tiSkill requirement, then skip to step
S306, otherwise skips to step S307；
S306, meeting task tiThe user w of requirementjIt is added to user set WR, iIn；
S307 ,+1 user of jth continued in traverse user set W, skip to step S304；
S308, meet task tiThe user of requirement all travels through, and the i+1 continued in traversal set of tasks T to be allocated is appointed
Business, skips to step S302.
3. the mass-rent method for allocating tasks based on user dependability according to claim 1, it is characterised in that the step
Also include in S4：
Start first round user distribution from the minimum task of participating user number in set of tasks T to be allocated.
4. the mass-rent method for allocating tasks based on user dependability according to claim 3, it is characterised in that the step
S4 is specially：
S401, for each task in set of tasks to be allocated, if meeting user's set W to be allocated of mission requirementsR, iAll
For sky, that is, do not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S402；
S402, to set of tasks T to be allocated in all tasks according to participating user number | WR, i| ascending order is arranged；
S403, for each task t to be allocatediUser set WR, iIn user according to credit value descending arrange；
S404, i-th task t traveled through in set of tasks T to be allocatedi, initialization task tiDistributing user mark flagi
=false, this mark are used for judging task tiWhether user has been assigned to；
If S405, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S406 is skipped to, otherwise skip to step
S5；
S406, traversal task tiUser set WR, iIn j-th user wj；
If S407, j were ＜=| WR, i|, i.e. user wjIn user set WR, iIn, then step S408 is skipped to, step is otherwise skipped to
S412；
If S408, user wjIt is unallocated within this stage then to skip to step S409 to task, otherwise skip to step S410；
S409, task tiDistribute to user wj, mark flagi=true, xI, j=1 represents task tiDistribute to user wj,
User wjAddition has been assigned to the user set W of taskrBe assigned to task tiUser set WiIn, and user wjFrom task
tiUser's set W to be allocatedR, iMiddle deletion, while skipping to step S412；
S410, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion；
S411, continuation traverse user set WR, iIn+1 user of jth, skip to step S407；
S412, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S405.
5. the mass-rent method for allocating tasks based on user dependability according to claim 1, it is characterised in that the step
S5 is specially：
S501, beginning h wheel user's distribution, the initial value of h is 2；
S502, for each task in set of tasks T to be allocated, if meeting user's set W to be allocated of mission requirementsR, i
All it is empty, that is, does not have user to meet the requirement of task, then distribution terminates, and skips to step S6, otherwise, skips to step S503；
If S503, h be ＜=l, i.e., task distribution in this stage is not over, then skip to step S504, otherwise skip to S6；
S504, for set of tasks T to be allocated in all tasks according to the user's credit value ascending order arrangement being assigned to, traversal treats
I-th task t in distribution set of tasks Ti；
If S505, i were ＜=| T |, i.e. task tiIn set of tasks T to be allocated, then step S506 is skipped to, otherwise skip to step
S515；
S506, traversal task tiUser set WR, iIn j-th user wj；
If S507, j were ＜=| WR, i|, i.e. user wjIn user set WR, iIn, then step S508 is skipped to, step is otherwise skipped to
S511；
If S508, user wjIt is unallocated within this stage then to skip to step S509 to task, otherwise skip to step S510；
S509, task tiDistribute to user wj, xI, j=1 represents task tiDistribute to user wj, user wjAddition distributes
To the user set W of taskrBe assigned to task tiUser WiIn, and user wjFrom task tiUser to be allocated set
WR, iMiddle deletion, while skipping to step S514；
S510, user wjTask is had been dispensed into, user wjFrom task tiUser's set W to be allocatedR, iMiddle deletion, continuation time
Successive business tiUser's set W to be allocatedR, iIn+1 user of jth, while skipping to step S507；
If S511, task tiDistributing user mark flagi=true, i.e. task tiHave been dispensed into user, but next
Can distribute without user, then skip to step S512, otherwise skip to step 513；
S512, task tiUser is assigned to, task tiThe set T that the task of being added to is assignedsIn, and task tiFrom collection
Delete in closing T, continue the i+1 task in traversal set of tasks T, while skipping to step S505；
S513, task tiIt is unallocated to user, directly task tiDelete from set of tasks T to be allocated；
S514, the i+1 task continued in traversal set of tasks T to be allocated, skip to step S505；
S515, the user's distribution for continuing h+1 wheels, skip to step S502.
6. the mass-rent method for allocating tasks based on user dependability according to claim 1, it is characterised in that the step
S6 also includes：
Traversal set WrIn all users, according to user wjComplete task tiThe evaluation e for obtaining afterwardsI, j, by formula repR, j=α
repR-1, j+(1-α)2eI, jrepR-1, jUpdate user wjCredit value.
7. the mass-rent method for allocating tasks based on user dependability according to claim 6, it is characterised in that the step
S6 is specially：
S601, traverse user set WrIn j-th user wj；
If S602, j were ＜=| Wr|, i.e. user wjIn user set WrIn, then step S603 is skipped to, otherwise terminates to update；
S603, mass-rent platform are according to reputation updating formula repR, j=α repR-1, j+(1-α)2eI, jrepR-1, jWith user wjObtain
Evaluate eI, j, to user wjCredit value be updated；
S604, continuation traverse user set WrIn+1 user of jth, skip to step S602.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611105342.5A CN106557891B (en) | 2016-12-05 | 2016-12-05 | Crowdsourcing task allocation method based on user reliability |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611105342.5A CN106557891B (en) | 2016-12-05 | 2016-12-05 | Crowdsourcing task allocation method based on user reliability |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106557891A true CN106557891A (en) | 2017-04-05 |
| CN106557891B CN106557891B (en) | 2021-05-11 |
Family
ID=58446230
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611105342.5A Active CN106557891B (en) | 2016-12-05 | 2016-12-05 | Crowdsourcing task allocation method based on user reliability |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106557891B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107230044A (en) * | 2017-06-14 | 2017-10-03 | 深圳象和动漫网络有限公司 | The online collaboration data processing implementation method of Digital Media, device and storage device |
| CN107563616A (en) * | 2017-08-17 | 2018-01-09 | 上海大学 | A kind of user task distribution and the quorum-sensing system system and method for incentives strategy |
| CN108876173A (en) * | 2018-06-28 | 2018-11-23 | 魏代利 | A kind of implementation method and device of event |
| CN109101329A (en) * | 2018-07-25 | 2018-12-28 | 陕西师范大学 | The finegrained tasks distribution method and system of data are acquired by multiple mobile terminals |
| CN109146212A (en) * | 2017-06-16 | 2019-01-04 | 佛山科学技术学院 | Extensive isomorphism method for allocating tasks in crowdsourcing system |
| CN109447489A (en) * | 2018-11-02 | 2019-03-08 | 华东交通大学 | Selection method, device, electronic equipment and the storage medium of intelligent perception user |
| CN109522107A (en) * | 2018-10-25 | 2019-03-26 | 陕西师范大学 | A kind of method for allocating tasks and system towards space-time restriction |
| CN110097277A (en) * | 2019-04-28 | 2019-08-06 | 北京交通大学 | The dynamic allocation method of crowdsourcing task based on time window |
| CN111738576A (en) * | 2020-06-10 | 2020-10-02 | 中北大学 | Fair crowdsourcing work flow distribution method |
| CN114139867A (en) * | 2021-10-29 | 2022-03-04 | 陕西师范大学 | Task allocation method for collecting culture resource data through multiple mobile terminals |
| US11386299B2 (en) | 2018-11-16 | 2022-07-12 | Yandex Europe Ag | Method of completing a task |
| US11416773B2 (en) | 2019-05-27 | 2022-08-16 | Yandex Europe Ag | Method and system for determining result for task executed in crowd-sourced environment |
| US11475387B2 (en) | 2019-09-09 | 2022-10-18 | Yandex Europe Ag | Method and system for determining productivity rate of user in computer-implemented crowd-sourced environment |
| US11481650B2 (en) | 2019-11-05 | 2022-10-25 | Yandex Europe Ag | Method and system for selecting label from plurality of labels for task in crowd-sourced environment |
| US11727329B2 (en) | 2020-02-14 | 2023-08-15 | Yandex Europe Ag | Method and system for receiving label for digital task executed within crowd-sourced environment |
| US11727336B2 (en) | 2019-04-15 | 2023-08-15 | Yandex Europe Ag | Method and system for determining result for task executed in crowd-sourced environment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN105976205A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Crowdsourcing sensing method and system for quality sensitive geographical regional information |
-
2016
- 2016-12-05 CN CN201611105342.5A patent/CN106557891B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN105976205A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Crowdsourcing sensing method and system for quality sensitive geographical regional information |
Non-Patent Citations (4)
| Title |
|---|
| DEPENG DANG等: "《A Crowdsourcing Worker Quality Evaluation Algorithm on MapReduce for Big Data Applications》", 《PROCEEDINGS OF THE 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS． WASHINGTON，DC: IEEE COMPUTER SOCIETY’2015》 * |
| HANSHANG LI等: "《Dynamic Participant Recruitment of Mobile Crowd Sensing for Heterogeneous Sensing Tasks》", 《PROCEEDINGS OF THE 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS． WASHINGTON，DC: IEEE COMPUTER SOCIETY，2015:》 * |
| 李勇军等: "软件"众包"任务分配方法", 《计算机系统应用》 * |
| 芮兰兰等: "《一种面向众包的基于信誉值的激励机制》", 《电子与信息学报》 * |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107230044A (en) * | 2017-06-14 | 2017-10-03 | 深圳象和动漫网络有限公司 | The online collaboration data processing implementation method of Digital Media, device and storage device |
| CN107230044B (en) * | 2017-06-14 | 2020-12-29 | 象和文化科技(深圳)有限公司 | Method and device for realizing digital media online collaboration data processing and storage equipment |
| CN109146212A (en) * | 2017-06-16 | 2019-01-04 | 佛山科学技术学院 | Extensive isomorphism method for allocating tasks in crowdsourcing system |
| CN109146212B (en) * | 2017-06-16 | 2022-03-25 | 佛山科学技术学院 | Large-scale isomorphic task allocation method in crowdsourcing system |
| CN107563616A (en) * | 2017-08-17 | 2018-01-09 | 上海大学 | A kind of user task distribution and the quorum-sensing system system and method for incentives strategy |
| CN108876173A (en) * | 2018-06-28 | 2018-11-23 | 魏代利 | A kind of implementation method and device of event |
| CN108876173B (en) * | 2018-06-28 | 2022-04-01 | 魏代利 | Event realization method and device |
| CN109101329A (en) * | 2018-07-25 | 2018-12-28 | 陕西师范大学 | The finegrained tasks distribution method and system of data are acquired by multiple mobile terminals |
| CN109522107B (en) * | 2018-10-25 | 2020-11-20 | 陕西师范大学 | Task allocation method and system for space-time constraint |
| CN109522107A (en) * | 2018-10-25 | 2019-03-26 | 陕西师范大学 | A kind of method for allocating tasks and system towards space-time restriction |
| CN109447489B (en) * | 2018-11-02 | 2020-10-30 | 华东交通大学 | Selection method and device of crowd sensing user, electronic equipment and storage medium |
| CN109447489A (en) * | 2018-11-02 | 2019-03-08 | 华东交通大学 | Selection method, device, electronic equipment and the storage medium of intelligent perception user |
| US11386299B2 (en) | 2018-11-16 | 2022-07-12 | Yandex Europe Ag | Method of completing a task |
| US11727336B2 (en) | 2019-04-15 | 2023-08-15 | Yandex Europe Ag | Method and system for determining result for task executed in crowd-sourced environment |
| CN110097277B (en) * | 2019-04-28 | 2021-10-08 | 北京交通大学 | Time window-based crowdsourcing task dynamic allocation method |
| CN110097277A (en) * | 2019-04-28 | 2019-08-06 | 北京交通大学 | The dynamic allocation method of crowdsourcing task based on time window |
| US11416773B2 (en) | 2019-05-27 | 2022-08-16 | Yandex Europe Ag | Method and system for determining result for task executed in crowd-sourced environment |
| US11475387B2 (en) | 2019-09-09 | 2022-10-18 | Yandex Europe Ag | Method and system for determining productivity rate of user in computer-implemented crowd-sourced environment |
| US11481650B2 (en) | 2019-11-05 | 2022-10-25 | Yandex Europe Ag | Method and system for selecting label from plurality of labels for task in crowd-sourced environment |
| US11727329B2 (en) | 2020-02-14 | 2023-08-15 | Yandex Europe Ag | Method and system for receiving label for digital task executed within crowd-sourced environment |
| CN111738576B (en) * | 2020-06-10 | 2023-08-01 | 中北大学 | Fair crowdsourcing workflow distribution method |
| CN111738576A (en) * | 2020-06-10 | 2020-10-02 | 中北大学 | Fair crowdsourcing work flow distribution method |
| CN114139867A (en) * | 2021-10-29 | 2022-03-04 | 陕西师范大学 | Task allocation method for collecting culture resource data through multiple mobile terminals |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106557891B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106557891A (en) | Mass-rent method for allocating tasks based on user dependability | |
| Zheng et al. | A budget feasible incentive mechanism for weighted coverage maximization in mobile crowdsensing | |
| Torrens | Simulating sprawl | |
| CN103647671B (en) | A kind of intelligent perception network management and its system based on Gur Game | |
| Karsten et al. | Inventory pooling games for expensive, low‐demand spare parts | |
| Bélanger et al. | Weekly airline fleet assignment with homogeneity | |
| Hafezalkotob et al. | Multi-resource trade-off problem of the project contractors in a cooperative environment: Highway construction case study | |
| CN107066322B (en) | A kind of online task allocating method towards self-organizing intelligent perception system | |
| Srinivas et al. | Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach | |
| Kikuchi et al. | Trade with time zone differences: Factor market implications | |
| CN107851229A (en) | Reservation management device, reservation management method and reservation management program | |
| Majumdar | Broadband adoption, jobs and wages in the US telecommunications industry | |
| Oughton et al. | Estimating digital infrastructure investment needs to achieve universal broadband | |
| Odongo | ICT policy in Africa: a comparative study of Ghana and Kenya drawing on lessons from developed countries | |
| Chiang et al. | Guest editorial: smart data pricing for next-generation networks | |
| Mirandilla-Santos | Philippine broadband: A policy brief | |
| Rambo | Risk factors influencing the survival of strategic alliances: Evidence from Kenya | |
| Oughton et al. | What would it cost to connect the unconnected? Estimating global universal broadband infrastructure investment | |
| KR101137025B1 (en) | Method for managing subscribers based on multi-step feedback system | |
| Smallbone et al. | China: a focus on local policy | |
| Kuma | Land policy and land delivery system in Nigeria | |
| Hu et al. | Mapping China's 3G market with the strategic network paradigm | |
| Wang et al. | [Retracted] Model Construction of Urban Public Sports Service System under the Background of Information Technology | |
| Grossman Jr et al. | Optimal pricing for service facilities with self-optimizing customers | |
| Tampieri | The governance of synergies and conflicts in project management: The case of IPA project RecoURB |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |