CN110956350A - Method, device and system for distributing rewards - Google Patents
Method, device and system for distributing rewards Download PDFInfo
- Publication number
- CN110956350A CN110956350A CN201811133288.4A CN201811133288A CN110956350A CN 110956350 A CN110956350 A CN 110956350A CN 201811133288 A CN201811133288 A CN 201811133288A CN 110956350 A CN110956350 A CN 110956350A
- Authority
- CN
- China
- Prior art keywords
- reward
- subtask
- task
- execution result
- rewards
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 84
- 230000015654 memory Effects 0.000 claims description 26
- 238000012545 processing Methods 0.000 claims description 24
- 230000007246 mechanism Effects 0.000 abstract description 8
- 230000008569 process Effects 0.000 description 18
- 238000010586 diagram Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 6
- 238000002372 labelling Methods 0.000 description 6
- 239000000047 product Substances 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000001914 filtration Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006399 behavior Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Images
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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
-
- 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/105—Human resources
- G06Q10/1057—Benefits or employee welfare, e.g. insurance, holiday or retirement packages
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (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 application discloses a method, a device and a system for distributing rewards. Wherein, the method comprises the following steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask. The method and the device solve the technical problem that the reward distribution of the existing marked reward mechanism is unreasonable.
Description
Technical Field
The application relates to the field of social annotation, in particular to a method, a device and a system for distributing rewards.
Background
In the social annotation field, the same data is often annotated multiple times by means of collaborative filtering, for example, in the process of testing the same software product, multiple users may be required to process the same survey report, and a processing result of each user on the survey report is obtained. In order to improve the enthusiasm of the user, reward incentives need to be given to the user in the process of socialized marking.
The socialized labeling method generally selects the answer with the highest consistency to ensure the accuracy, and labels the data with inconsistent answers for multiple times, so as to obtain a better result by using the labeling result of multiple people. Currently, there are mainly two ways to socialize labeling:
the first method is as follows: the cost of each piece of data in the social annotation is predetermined to ensure that the cost of each piece of data is fixed. However, in the process of data annotation, data with non-uniform answers needs to be released for multiple times, and the release quantity of the data is not fixed, so that the total budget cannot be determined in advance, that is, the total cost can be determined only after the annotation is finished, and thus, the service issuer is confused.
And secondly, confirming the total budget in advance, and confirming the cost of each piece of data in the social annotation according to the distribution times of the total data. However, this method can only confirm the individual data charges after the labeling is finished.
Since the total fee or the single data fee cannot be predetermined in the above two manners, the reward obtained by each user cannot be known, and thus the user reward distribution is unreasonable.
In view of the above-mentioned unreasonable allocation of rewards of the existing annotated reward mechanism, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the invention provides a method, a device and a system for distributing rewards, which at least solve the technical problem of unreasonable reward distribution of the existing marked reward mechanism.
According to an aspect of the embodiment of the invention, a method for distributing rewards is provided, which comprises the steps of obtaining an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing the task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
According to another aspect of the embodiments of the present invention, there is also provided a method of allocating a reward, including: inputting a basic reward of each subtask and an initial total budget of rewards to be distributed; displaying a task execution result of each object executing a task to be executed and a target object, wherein the task to be executed comprises a plurality of subtasks; displaying the additional reward of each subtask determined according to the task execution result of each object and the initial total budget; and displaying the distribution result of distributing the reward for the target object according to the basic reward and the additional reward of each subtask.
According to another aspect of the embodiments of the present invention, there is also provided an apparatus for distributing a reward, including: the acquisition module is used for acquiring an initial total budget of the reward to be distributed, a basic reward of each subtask and a task execution result of each object executing the task to be executed, wherein the task to be executed comprises a plurality of subtasks; the determining module is used for determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; and the distribution module is used for distributing rewards for the target objects according to the basic rewards and the additional rewards of each subtask.
According to another aspect of the embodiments of the present invention, there is also provided a storage medium including a stored program, wherein when the program runs, a device on which the storage medium is located is controlled to perform the following steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
According to another aspect of the embodiments of the present invention, there is also provided a computer device, including a processor, configured to execute a program, where the program executes to perform the following steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
There is also provided, in accordance with another aspect of an embodiment of the present invention, a system for distributing rewards, including: a processor; and a memory coupled to the processor for providing instructions to the processor for processing the following processing steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
In the embodiment of the invention, after the initial total budget of the reward to be distributed, the basic reward of each subtask and the task execution result of each object executing the task to be executed are obtained in a mode of basic reward and extra reward, the extra reward of each subtask is determined according to the task execution result of each object and the initial total budget, and finally the reward is distributed to the target object according to the basic reward and the extra reward of each subtask. Wherein the task to be executed comprises a plurality of subtasks
In the process, the reward obtained by the target object comprises a basic reward and an extra reward, and the extra reward of the target object is related to the task execution result of the target object, so that the extra reward is distributed to each target object according to the task execution result condition of the target object, the problem of unreasonable reward distribution caused by cheating of part of users can be avoided, and the purpose of reasonably distributing the reward is achieved.
Therefore, the technical problem that the existing marked reward mechanism is unreasonable in reward distribution can be solved through the scheme provided by the application.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a block diagram of a hardware configuration of a computer terminal (or mobile device) for implementing a method of distributing rewards in accordance with an embodiment of the application;
FIG. 2 is a flow diagram of a method of distributing rewards in accordance with an embodiment of the application;
FIG. 3 is a flow diagram of an alternative method of distributing rewards in accordance with an embodiment of the application;
FIG. 4 is a flow diagram of an alternative method of distributing rewards in accordance with an embodiment of the application;
FIG. 5 is a flow diagram of a method of distributing rewards in accordance with an embodiment of the application;
FIG. 6 is a schematic diagram of an apparatus for distributing rewards, according to an embodiment of the application; and
fig. 7 is a block diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but 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 application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
First, some terms or terms appearing in the description of the embodiments of the present application are applicable to the following explanations:
the socialized marking system refers to a software system for marking and evaluating data in a crowdsourcing mode.
Crowdsourcing, refers to the way in which a company or structure outsources work tasks that have been performed by employees to an unspecified mass network in a free-voluntary manner, e.g., by way of research into the development needs of a product over the network.
Marking refers to a process of marking characters, pictures and the like on a product.
And cheating, namely performing malicious question-brushing behavior in a crowdsourcing platform by using tools or manpower in order to obtain rewards by malicious users.
And the formal topic refers to a topic which needs to be labeled by a user.
The question of burying thunder refers to a question with a known correct answer, and in the application, the question of burying thunder is used for judging whether a user marks correctly.
Example 1
There is also provided, in accordance with an embodiment of the present application, an embodiment of a method of distributing rewards, and it is noted that the steps illustrated in the flowchart of the figure may be performed in a computer system such as a set of computer executable instructions and that while a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than here.
The method provided by the first embodiment of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Fig. 1 shows a block diagram of the hardware architecture of a computer terminal (or mobile device) for implementing a method of distributing rewards. As shown in fig. 1, the computer terminal 10 (or mobile device 10) may include one or more (shown as 102a, 102b, … …, 102 n) processors 102 (the processors 102 may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 104 for storing data, and a transmission device 106 for communication functions. Besides, the method can also comprise the following steps: a display, an input/output interface (I/O interface), a Universal Serial Bus (USB) port (which may be included as one of the ports of the I/O interface), a network interface, a power source, and/or a camera. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration and is not intended to limit the structure of the electronic device. For example, the computer terminal 10 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
It should be noted that the one or more processors 102 and/or other data processing circuitry described above may be referred to generally herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part in software, hardware, firmware, or any combination thereof. Further, the data processing circuit may be a single stand-alone processing module, or incorporated in whole or in part into any of the other elements in the computer terminal 10 (or mobile device). As referred to in the embodiments of the application, the data processing circuit acts as a processor control (e.g. selection of a variable resistance termination path connected to the interface).
The memory 104 may be used to store software programs and modules of application software, such as program instructions/data storage devices corresponding to the method for distributing rewards in the embodiment of the application, and the processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, so as to implement the method for distributing rewards. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the computer terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission device 106 includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission device 106 can be a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.
The display may be, for example, a touch screen type Liquid Crystal Display (LCD) that may enable a user to interact with a user interface of the computer terminal 10 (or mobile device).
It should be noted here that in some alternative embodiments, the computer device (or mobile device) shown in fig. 1 described above may include hardware elements (including circuitry), software elements (including computer code stored on a computer-readable medium), or a combination of both hardware and software elements. It should be noted that fig. 1 is only one example of a particular specific example and is intended to illustrate the types of components that may be present in the computer device (or mobile device) described above.
In the foregoing operating environment, the present application provides a method for distributing rewards as shown in fig. 2, where the crowdsourcing platform can execute the method for distributing rewards as shown in fig. 2, and as can be seen from fig. 2, the method for distributing rewards includes:
step S202, obtaining an initial total budget of the reward to be distributed, a basic reward of each subtask and a task execution result of each object executing the task to be executed, wherein the task to be executed comprises a plurality of subtasks.
It should be noted that the subtask in step S202 may be a topic that is distributed to a plurality of objects through a crowdsourcing platform to label the plurality of objects, where each topic is a subtask, for example, the crowdsourcing platform distributes a questionnaire about the product a to terminals corresponding to the plurality of objects, where the questionnaire includes a plurality of topics, and each topic corresponds to one subtask.
Furthermore, it should be noted that the crowdsourcing platform has an input device through which a user can input a base award for each subtask, wherein the base award is a predetermined fixed award. For example, the base reward for each subtask is set to 0.01 yuan/piece, i.e., an object completing one task may receive a reward of 0.01 yuan. After the crowdsourcing platform distributes the tasks to be executed, the object receiving the tasks to be executed can check the basic reward of each subtask.
After determining the basic reward of each subtask, the user may further input, through the crowdsourcing platform, the number of tasks of the subtask to be performed, the number of times of issuance of each subtask, and the like, and the crowdsourcing platform may determine the initial total budget according to the basic reward of each subtask, the number of tasks, and the number of times of issuance of each subtask.
In addition, the task execution result of each object includes, but is not limited to, the accuracy of labeling a second type of task by each object, the number of labels of each object labeling task, and the like, wherein the second type of task is a subtask with a fixed answer, and may be, but is not limited to, a mine-burying question.
Step S204, determining the additional reward of each subtask according to the task execution result of each object and the initial total budget.
It should be noted that, in the process of issuing the task to be executed by the crowdsourcing platform, the number of the subtasks may need to be supplemented or reduced, and therefore, in the process of issuing the task to be executed, the initial total budget needs to be adjusted. In addition, after receiving the task execution result returned by each object, the crowdsourcing platform filters the object for issuing the reward according to the task execution result of each object, screens out the target object meeting the condition, and only issues the reward to the target object, wherein the target object can be the object of which the task execution accuracy reaches the preset accuracy and the execution number of the subtasks reaches the preset number.
It is easy to note that the initial total budget is generally larger than the actual total budget, since not all objects performing the task to be performed may be rewarded. Thus, a bonus can be set for each subtask based on the difference between the initial total budget and the actual total budget.
Step S206, distributing rewards for the target objects according to the basic rewards and the additional rewards of each subtask.
It should be noted that after the basic reward and the additional reward of each subtask are obtained, the crowdsourcing platform determines the total reward amount of the target object in combination with the task execution result of the target object executing the task to be executed, and sends the total reward amount to the target object in an electronic payment mode.
In addition, it should be noted that the total amount of the rewards of the target object is related to the task execution result of the target object, for example, if the target object a executes 100 subtasks, the target object B executes 300 subtasks, and the accuracy of the target object B executing the second type of subtasks is greater than the accuracy of the target object a executing the second type of subtasks, the total amount of the rewards of the target object B is greater than the total amount of the rewards of the target object a under the condition that the basic rewards of each subtask and the additional rewards of each subtask are fixed. Therefore, the scheme provided by the application can reasonably distribute the reward for the target object.
Based on the schemes defined in the above steps S202 to S206, it can be known that, after the initial total budget to be allocated with the reward, the basic reward of each subtask, and the task execution result of each object are obtained by the way of the basic reward and the extra reward, the extra reward of each subtask is determined according to the task execution result and the initial total budget of each object, and finally, the reward is allocated to the target object according to the basic reward and the extra reward of each subtask.
It is easy to notice that the reward obtained by the target object comprises a basic reward and an additional reward, and the additional reward of the target object is related to the task execution result of the target object, so that the additional reward is distributed to each target object according to the task execution result of the target object, the problem of unreasonable reward distribution caused by cheating of part of users can be avoided, and the purpose of reasonably distributing the reward is realized.
Therefore, the technical problem that the existing marked reward mechanism is unreasonable in reward distribution can be solved through the scheme provided by the application.
It should be noted that, before obtaining a task execution result of each object executing a task to be executed, the crowdsourcing platform issues the task to be executed to the terminal corresponding to each object, and after the object receives the task to be executed, the object can check task information included in the task to be executed through the terminal, for example, the number of subtasks included in the task to be executed, the type of the subtasks, and the like, and in addition, the object can check basic rewards of each subtask through the terminal. The object may determine whether to execute the task to be executed according to the task information and the base reward of each subtask.
Further, after the object determines to execute the task to be executed, the object may send a confirmation message to the crowdsourcing platform through the terminal to notify the crowdsourcing platform that the object is about to execute the task to be executed. After the task to be executed is completed, the object sends the task execution result of the task to be executed to the crowdsourcing platform through the terminal, and the crowdsourcing platform performs statistical processing.
In the process, the crowdsourcing platform can issue the tasks to be executed in the following way, and the specific steps comprise:
step S20, acquiring the maximum issuing times of each subtask;
in step S22, the task is issued according to the maximum number of issues for each subtask.
Optionally, the number of issuance of each sub-task is not greater than the maximum number of issuance, and in the same task to be executed, the maximum number of issuance corresponding to different sub-tasks may be different, for example, the maximum number of issuance of the sub-task a is 3, the maximum number of issuance of the sub-task B is 5, the sub-task a is issued 3 times at most, and the sub-task B is issued 5 times at most.
In an alternative scheme, the task issuing according to the maximum issuing number of each subtask includes:
step S220, detecting the current issuing times of each subtask;
step S222, under the condition that the current issuing times are less than the maximum issuing times corresponding to the subtasks, acquiring a task execution result of the task to be executed;
and step S224, under the condition that the task execution result does not meet the preset condition, continuing to issue the task to be executed.
It should be noted that the preset conditions in step S224 may be, but are not limited to, that the accuracy of the second class of task executed by the object is greater than the preset accuracy, the execution number of the sub-tasks is greater than the preset number, and the number of types of execution results of the plurality of objects on the same sub-task is less than the preset number of types.
Optionally, the crowdsourcing platform randomly and mixedly issues the mine burying questions while issuing the formal questions, after obtaining the task execution result fed back by each object, the crowdsourcing platform counts the accuracy of executing the mine burying questions by each user, and if the accuracy of executing the mine burying questions by the object a is not greater than a preset accuracy, the task execution results of other subtasks executed by the object are set as invalid results, and the task execution result of the object does not have a reference value. Meanwhile, the crowdsourcing platform continues to issue subtasks with current issuing times smaller than the maximum issuing times.
Optionally, the execution results of the multiple objects on the same sub-task may be different, that is, the types of the task execution results of the multiple objects on the same sub-task may be multiple, for example, 2 results exist in the sub-task a, when 10 objects execute the sub-task a, the task execution results of 5 objects are the first result, and the task execution results of the other 5 objects are the second result, that is, the consistency of the task execution results of the sub-task a by the multiple objects does not meet the requirement, at this time, the crowdsourcing platform continues to issue the sub-task whose current issue number is smaller than the maximum issue number.
It should be noted that, before determining the extra reward of each subtask according to the task execution result of each object and the initial total budget, the crowdsourcing platform needs to determine the initial total budget corresponding to the task to be executed. Wherein the initial total budget can be obtained by any one of the following ways.
The first method is as follows: determining an initial total budget according to the maximum number of releases of the subtasks, the method may comprise the steps of:
step S30, acquiring the number of subtasks included in the task to be executed and the maximum issue number of each subtask, where for example, if the task to be executed includes 100 subtasks, the number of tasks of the task to be executed is 100.
Step S32, determining the number ratio of the first class tasks to the second class tasks, wherein the second class tasks are tasks for determining whether the object executes correctly. Optionally, the first type of task may be a formal question, and the second type of task may be a mine-burying question.
And step S34, determining an initial total budget according to the basic reward of each subtask, the number of tasks, the maximum issuing times of each subtask and the number ratio of the first type of tasks to the second type of tasks.
It should be noted that the basic rewards of each subtask may be the same or different, where, in the case that the basic rewards of each subtask are the same and the maximum number of releases is also the same, the initial total budget S may be calculated by the following formula:
in the above formula, S is the total budget, S1Reward for the base of each subtask, N is the number of tasks, M is the maximum number of issues for each subtask, N1Is the number of tasks of the first type, N2For the number of tasks of the second type,is the number ratio of the first kind of task to the second kind of task.
In addition, it should be noted that, in this manner, the maximum issue number refers to the maximum issue number of a subtask under a collaborative filtering mechanism, where collaborative filtering is a main algorithm of an e-commerce recommendation system, and the algorithm may analyze interest of an object, find a similar object of a specified object in an object group, and then integrate evaluation of the similar object on a certain task, thereby forming a prediction of the system's preference of the specified object on the task.
It is easy to note that, in the first mode, the initial total budget is calculated by using the maximum number of releases of all the subtasks as the number of releases of all the subtasks, and the existence of the second type of task with lower reference value is considered, that is, the first mode considers the initial total budget in the worst case, so that the initial total budget can meet the actual reward distribution in general.
The second method comprises the following steps: the initial total budget is determined according to the average issuing times of the subtasks, and the method can comprise the following steps:
step S40, acquiring the task number of subtasks contained in the task to be executed and the average issuing times of each subtask;
step S42, determining an initial total budget according to the number of tasks, the average number of deliveries of each subtask, and the basic rewards of each subtask.
In the second method, the initial total budget S can be obtained by the following formula:
in the above formula, S is the total budget, S1Base reward for each subtask, N being the number of tasks, MiAverage number of releases for ith subtask, N1Is the number of tasks of the first type, N2For the number of tasks of the second type,is the number ratio of the first kind of task to the second kind of task.
The method for obtaining the initial total budget is not limited to the first method and the second method, and any method capable of obtaining the initial total budget may be applied to the present application.
In addition, since the above-mentioned first and second ways take worst cases into consideration in calculating the initial total budget, for example, in the first way, the maximum number of releases is used as the number of releases of each sub-task, but the actual number of releases of all sub-tasks is not the maximum number of releases, that is, the initial total budget obtained in the first or second way is the maximum budget. Thus, in practice, there will be unallocated rewards in the initial total budget, and this portion of the rewards may be allocated to the subject as a bonus. Specifically, after determining the initial total budget, the crowdsourcing platform may determine an additional reward for each subtask according to the task execution result of each object and the initial total budget, which may include:
and step S50, obtaining the total basic budget according to the task execution result of each object. It should be noted that, during the process of issuing the task, the crowdsourcing platform may need to supplement the subtasks or reduce the number of the subtasks, and in the case that the number of the subtasks changes, there is a difference between the actual budget and the initial total budget, so that, after determining the task execution result of each object, the crowdsourcing platform obtains the actual budget (i.e., the total base budget) according to the task execution result of each object.
In step S52, a target object is determined based on the task execution result of each object. It should be noted that, because some objects may have cheating behaviors, or the execution number of the sub-tasks is smaller than the preset number, or the execution accuracy of the sub-tasks is smaller than the preset accuracy, in order to make the object that executes the task to be executed obtain fair and reasonable rewards, before the rewards are issued, the target objects meeting the reward issuing conditions need to be determined, and optionally, the target objects meeting the reward issuing conditions may be the objects whose execution number of the sub-tasks is greater than or equal to the preset number, and/or the execution accuracy of the sub-tasks is greater than or equal to the preset accuracy.
In step S54, the task execution result of the target object is determined.
Step S56, determining the bonus award for each subtask according to the initial total budget, the total base budget, and the task execution result of the target object.
Wherein the additional reward for each subtask can be obtained by the following formula:
in the above formula, S2Additional rewards for each subtask, S is the initial total budget, SmFor the total base budget, C is the number of sub-tasks to be performed for all target objects, where C can be obtained by:
in the above formula, CiThe number of subtasks performed for the ith target object, and k is the number of target objects.
After obtaining the base award and the additional award for each subtask, the crowdsourcing platform may obtain an award total for the target object based on the execution result of the target object, the base award for each subtask, and the additional award for each subtask. Wherein the total amount of the reward for the target object may satisfy the following equation:
P=Ci*(S1+S2)
in the above formula, P is the total amount of awards for the target object i, CiThe number of sub-tasks to execute for target object i.
Alternatively, the above is illustrated by the following examples. The tasks to be executed comprise 10000 subtasks, the basic reward of each subtask is 0.01, the minimum issuing number of each subtask is 3, the maximum issuing number of each subtask is 5, and the number ratio of the first type of tasks to the second type of tasks is 20:5, so that the initial total budget can be obtained to be 625 yuan according to the formula of the initial total budget. After the object returns the task execution result, the crowdsourcing platform determines that 5 objects A, B, C, D and E execute the task to be executed, wherein the execution number of the subtasks is 10000, 9000, 8000, 7000 and 1 respectively. Since the number of executions of the sub-task performed by the object E is less than the preset number (e.g., 6000), the crowdsourcing platform does not issue a reward to the object E. If the total number of all other objects satisfying the issue of the bonus are 34000, the total basic bonus is 340 yuan, and the additional bonus for each sub-task is (625- & lten & gt 340)/34000- & lten & gt 0.00838 yuan, then the total bonus amounts obtained by the objects A, B, C and D are 183.82, 165.44, 147.06 and 128.68, respectively.
In an alternative, fig. 3 shows a flow chart of the above process. Specifically, firstly, the crowdsourcing platform creates the tasks to be executed, the number of subtasks included in the tasks to be executed and the basic reward of each subtask, and then the initial total budget is calculated according to the number of the subtasks and the basic reward of each subtask. Then, the crowdsourcing platform issues the task to be executed to a terminal of an object executing the task to be executed, the object executes the task to be executed through the terminal, and feeds back a task execution result of executing the task to be executed to the crowdsourcing platform. And the crowdsourcing platform acquires the task execution result of each object and determines the total basic budget according to the task execution result. Then, the crowdsourcing platform determines an initial reward of each object according to a task execution result of each object, and takes the object with the initial reward meeting a preset condition as a target object. After the target object is determined, the crowdsourcing platform determines the additional reward of each subtask according to the task execution result of the target object executing the task to be executed, the initial total budget and the total basic budget. Finally, the crowdsourcing platform calculates the total amount of rewards for each target object according to the additional rewards for each subtask, the basic rewards for each subtask and the task execution results of each target object.
It should be noted that, in order to make the total amount of the rewards of each target object more fair and reasonable, after the rewards are allocated to the target object according to the basic rewards and the extra rewards of each subtask, the user may also adjust the initial total budget, and the crowdsourcing platform obtains the total amount of the rewards of each target object according to the adjusted initial total budget, and the specific process is shown in fig. 4, and the process includes the following steps:
step S402, acquiring the adjusted initial total budget;
step S404, determining an initial reward of each object according to the adjusted initial total budget and the task execution result of each object;
step S406, determining a target object according to the initial reward;
step S408, determining the extra reward of each subtask according to the adjusted initial total budget and the task execution result of the target object;
step S410, determining the total reward amount of the target object according to the adjusted initial total budget, the task execution result of the target object and the additional reward of each subtask.
It should be noted that, in the scheme defined in the foregoing steps S402 to S410, the bonus for each subtask is a ratio of the adjusted initial total budget to the number of tasks for all target objects to perform the subtask. In addition, the method for calculating the total amount of the reward of the target object is the same as the above, and is not described herein again.
In addition, it should be noted that, based on the above, the scheme provided by the present application not only can obtain the total budget in advance before the task is issued, so as to be convenient for a third party to use, but also can obtain the total amount of the rewards of the object executing the task by combining the basic rewards and the additional rewards, so that the reward distribution of the object is more reasonable.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method for distributing the rewards according to the above embodiments can be implemented by software plus a necessary general hardware platform, and of course, the method can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present application.
Example 2
According to an embodiment of the present application, there is further provided a method for distributing a reward, where the crowdsourcing platform in embodiment 1 may perform the method for distributing a reward of this embodiment, as shown in fig. 5, the method includes the following steps:
step S502, inputting the basic reward of each subtask and the initial total budget of the reward to be distributed.
It should be noted that the sub-task may be a topic that is distributed to the multiple objects through the crowdsourcing platform to label the multiple objects, where each topic is a sub-task, for example, the crowdsourcing platform distributes a questionnaire about the product a to terminals corresponding to the multiple objects, where the questionnaire includes multiple topics, and each topic corresponds to one sub-task.
Furthermore, it should be noted that the crowdsourcing platform has an input device through which a user can input a base award for each subtask, wherein the base award is a predetermined fixed award. The crowdsourcing platform may then determine an initial total budget based on the base reward for each subtask and the number of subtasks included in the task to be performed, at which point the user may enter the initial total budget through the crowdsourcing platform.
Step S504, a task execution result of each object and the target object are displayed.
It should be noted that, in the process of issuing the task to be executed by the crowdsourcing platform, the number of the subtasks may need to be supplemented or reduced, and therefore, in the process of issuing the task to be executed, the initial total budget needs to be adjusted. In addition, after receiving the task execution result returned by each object, the crowdsourcing platform filters the object for issuing the reward according to the task execution result of each object, screens out the target object meeting the conditions, and displays the task execution result and the target object of each object on a display screen of the crowdsourcing platform.
Step S506, displaying the additional reward of each subtask determined according to the task execution result of each object and the initial total budget.
It should be noted that the initial total budget is generally greater than the actual total budget, since not all objects performing the task to be performed may be rewarded. Thus, a bonus can be set for each subtask based on the difference between the initial total budget and the actual total budget.
Step S508, displaying the distribution result of distributing the reward for the target object according to the basic reward and the additional reward of each subtask.
It should be noted that after the basic reward and the additional reward of each subtask are obtained, the crowdsourcing platform determines the total reward amount of the target object in combination with the task execution result of the target object executing the task to be executed, and sends the total reward amount to the target object in an electronic payment mode.
In addition, it should be noted that the total amount of the rewards of the target object is related to the task execution result of the target object, for example, if the target object a executes 100 subtasks, the target object B executes 300 subtasks, and the accuracy of the target object B executing the second type of subtasks is greater than the accuracy of the target object a executing the second type of subtasks, the total amount of the rewards of the target object B is greater than the total amount of the rewards of the target object a under the condition that the basic rewards of each subtask and the additional rewards of each subtask are fixed. Therefore, the scheme provided by the application can reasonably distribute the reward for the target object.
Based on the schemes defined in the above steps S502 to S508, it can be known that, after the initial total budget to be allocated with the reward, the basic reward of each subtask, and the task execution result of each object are obtained by the way of the basic reward and the extra reward, the extra reward of each subtask is determined according to the task execution result and the initial total budget of each object, and finally, the reward is allocated to the target object according to the basic reward and the extra reward of each subtask.
It is easy to notice that the reward obtained by the target object comprises a basic reward and an additional reward, and the additional reward of the target object is related to the task execution result of the target object, so that the additional reward is distributed to each target object according to the task execution result of the target object, the problem of unreasonable reward distribution caused by cheating of part of users can be avoided, and the purpose of reasonably distributing the reward is realized.
Therefore, the technical problem that the existing marked reward mechanism is unreasonable in reward distribution can be solved through the scheme provided by the application.
In addition, it should be noted that the method for calculating the initial total budget to be allocated with the reward in steps S502 to S508 and the method for calculating the extra reward of each subtask are the same as those in embodiment 1, and are not described herein again.
Example 3
There is also provided, in accordance with an embodiment of the present application, a system for distributing rewards for implementing the method for distributing rewards, the system including: a processor and a memory.
The memory is connected with the processor and used for providing instructions for the processor to process the following processing steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
According to the method, after the initial total budget of the reward to be distributed, the basic reward of each subtask and the task execution result of each object executing the task to be executed are obtained in the mode of the basic reward and the extra reward, the extra reward of each subtask is determined according to the task execution result of each object and the initial total budget, and finally the reward is distributed to the target object according to the basic reward and the extra reward of each subtask. Wherein the task to be executed comprises a plurality of subtasks
It is easy to notice that the reward obtained by the target object comprises a basic reward and an additional reward, and the additional reward of the target object is related to the task execution result of the target object, so that the additional reward is distributed to each target object according to the task execution result of the target object, the problem of unreasonable reward distribution caused by cheating of part of users can be avoided, and the purpose of reasonably distributing the reward is realized.
Therefore, the technical problem that the existing marked reward mechanism is unreasonable in reward distribution can be solved through the scheme provided by the application.
Example 4
There is also provided, according to an embodiment of the present application, an apparatus for distributing rewards for implementing the method for distributing rewards, as shown in fig. 6, wherein the apparatus 60 includes: an acquisition module 601, a determination module 603, and an assignment module 605.
The obtaining module 601 is configured to obtain an initial total budget to be allocated with rewards, a basic reward of each subtask, and a task execution result of each object executing a task to be executed, where the task to be executed includes a plurality of subtasks; a determining module 603, configured to determine an extra reward for each sub-task according to the task execution result of each object and the initial total budget; an assigning module 605 for assigning a reward to meet the target object according to the base reward and the additional reward of each subtask.
Here, it should be noted that the acquiring module 601, the determining module 603, and the allocating module 605 correspond to steps S202 to S206 in embodiment 1, and the three modules are the same as the corresponding steps in the implementation example and application scenario, but are not limited to the disclosure in the first embodiment.
In an alternative arrangement, the means for distributing the reward further comprises: the device comprises a first acquisition module and a first release module. The first acquisition module is used for acquiring the maximum issuing times of each subtask; and the first issuing module is used for issuing the tasks according to the maximum issuing times of each subtask.
Here, it should be noted that the first acquiring module and the first issuing module correspond to steps S20 to S22 in embodiment 1, and the two modules are the same as the corresponding steps in the implementation example and the application scenario, but are not limited to the disclosure in the first embodiment.
In an alternative, the first sending module includes: the device comprises a detection module, a second acquisition module and a second issuing module. The detection module is used for detecting the current issuing times of each subtask; the second acquisition module is used for acquiring the task execution result of the task to be executed under the condition that the current issuing times are less than the maximum issuing times corresponding to the subtasks; and the second issuing module is used for continuing issuing the task to be executed under the condition that the task execution result does not meet the preset condition.
Here, it should be noted that the detection module, the second acquisition module, and the second issuing module correspond to steps S220 to S224 in embodiment 1, and the three modules are the same as the corresponding steps in the implementation example and application scenario, but are not limited to the disclosure in the first embodiment.
In an optional aspect, the obtaining module includes: the device comprises a third acquisition module, a first determination module and a second determination module. The third acquisition module is used for acquiring the task number of subtasks contained in the task to be executed and the maximum issuing times of each subtask; the first determining module is used for determining the quantity ratio of the first-class tasks to the second-class tasks, wherein the second-class tasks are tasks used for judging whether the object is executed correctly; and the second determining module is used for determining the initial total budget according to the basic reward of each subtask, the number of tasks, the maximum issuing times of each subtask and the number ratio of the first class of tasks to the second class of tasks.
Here, it should be noted that the third acquiring module, the first determining module and the second determining module correspond to steps S30 to S34 in embodiment 1, and the three modules are the same as the corresponding steps in the implementation example and application scenario, but are not limited to the disclosure in the first embodiment.
In an optional aspect, the obtaining module includes: the device comprises a fourth obtaining module and a third determining module. The fourth acquisition module is used for acquiring the task number of the subtasks contained in the task to be executed and the average issuing times of each subtask; and the third determining module is used for determining the initial total budget according to the number of the tasks, the average issuing times of each subtask and the basic reward of each subtask.
Here, it should be noted that the fourth acquiring module and the third determining module correspond to steps S40 to S42 in embodiment 1, and the two modules are the same as the corresponding steps in the implementation example and the application scenario, but are not limited to the disclosure in the first embodiment.
In an alternative, the determining module includes: the device comprises a first processing module, a fourth determining module, a fifth determining module and a sixth determining module. The first processing module is used for obtaining a total basic budget according to a task execution result of each object; the fourth determining module is used for determining the target object according to the task execution result of each object; the fifth determining module is used for determining a task execution result of the target object; and the sixth determining module is used for determining the additional reward of each subtask according to the initial total budget, the total basic budget and the task execution result of the target object.
Here, it should be noted that the first processing module, the fourth determining module, the fifth determining module and the sixth determining module correspond to steps S50 to S56 in embodiment 1, and the four modules are the same as the corresponding steps in the implementation example and application scenario, but are not limited to the disclosure in the first embodiment.
In an alternative, the assignment module includes: and a second processing module. The second processing module is used for obtaining the total reward amount of the target object according to the execution result of the target object, the basic reward of each subtask and the additional reward of each subtask.
In an alternative arrangement, the means for distributing the reward further comprises: the device comprises a fifth obtaining module, a seventh determining module, an eighth determining module, a ninth determining module and a tenth determining module. The fifth obtaining module is configured to obtain the adjusted initial total budget; a seventh determining module, configured to determine an initial reward of each object according to the adjusted initial total budget and a task execution result of each object; the eighth determining module is used for determining the target object according to the initial reward; a ninth determining module, configured to determine an extra reward for each subtask according to the adjusted initial total budget and a task execution result of the target object; and the tenth determining module is used for determining the total reward amount of the target object according to the adjusted initial total budget, the task execution result of the target object and the additional reward of each subtask.
Here, it should be noted that the fifth acquiring module, the seventh determining module, the eighth determining module, the ninth determining module and the tenth determining module correspond to steps S402 to S410 in embodiment 1, and the five modules are the same as the corresponding steps in the implementation example and the application scenario, but are not limited to the disclosure in the first embodiment.
Example 5
Embodiments of the present application may provide a computer device, which may be any one of computer devices in a computer terminal group. Optionally, in this embodiment, the computer device may also be replaced with a terminal device such as a mobile terminal.
Optionally, in this embodiment, the computer device may be located in at least one network device of a plurality of network devices of a computer network.
In this embodiment, the computer device may execute the program code of the following steps in the method of distributing a reward: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
Optionally, fig. 7 is a block diagram of a computer device according to an embodiment of the present application. As shown in fig. 7, the computer apparatus a may include: one or more processors 702 (only one of which is shown), a memory 704, and a transmission device 706.
The memory may be used to store software programs and modules, such as program instructions/modules corresponding to the method and apparatus for distributing rewards in the embodiment of the present application, and the processor executes various functional applications and data processing by running the software programs and modules stored in the memory, that is, implementing the method for distributing rewards. The memory may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory may further include memory located remotely from the processor, which may be connected to the computer device a via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The processor can call the information and application program stored in the memory through the transmission device to execute the following steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
Optionally, the processor may further execute the program code of the following steps: acquiring the maximum issuing times of each subtask; and issuing the tasks according to the maximum issuing times of each subtask.
Optionally, the processor may further execute the program code of the following steps: detecting the current issuing times of each subtask; under the condition that the current issuing times are less than the maximum issuing times corresponding to the subtasks, acquiring a task execution result of the task to be executed; and under the condition that the task execution result does not meet the preset condition, continuing to issue the task to be executed.
Optionally, the processor may further execute the program code of the following steps: acquiring the task number of subtasks contained in a task to be executed and the maximum issuing times of each subtask; determining the quantity ratio of the first-class tasks to the second-class tasks, wherein the second-class tasks are tasks for judging whether the object is executed correctly; and determining the initial total budget according to the basic reward of each subtask, the number of tasks, the maximum issuing times of each subtask and the number ratio of the first class of tasks to the second class of tasks.
Optionally, the processor may further execute the program code of the following steps: acquiring the task number of subtasks contained in a task to be executed and the average issuing times of each subtask; and determining the initial total budget according to the number of tasks, the average issuing times of each subtask and the basic reward of each subtask.
Optionally, the processor may further execute the program code of the following steps: obtaining a total basic budget according to the task execution result of each object; determining a target object according to a task execution result of each object; determining a task execution result of the target object; and determining the additional reward of each subtask according to the initial total budget, the total basic budget and the task execution result of the target object.
Optionally, the processor may further execute the program code of the following steps: the award amount of the target object is obtained according to the execution result of the target object, the base award for each subtask, and the additional award for each subtask.
Optionally, the processor may further execute the program code of the following steps: acquiring the adjusted initial total budget; determining the initial reward of each object according to the adjusted initial total budget and the task execution result of each object; determining a target object according to the initial reward; determining the extra reward of each subtask according to the adjusted initial total budget and the task execution result of the target object; and determining the total reward amount of the target object according to the adjusted initial total budget, the task execution result of the target object and the additional reward of each subtask.
Optionally, the processor may further execute the program code of the following steps: inputting a basic reward of each subtask and an initial total budget of rewards to be distributed; displaying a task execution result of each object executing a task to be executed and a target object, wherein the task to be executed comprises a plurality of subtasks; displaying the additional reward of each subtask determined according to the task execution result of each object and the initial total budget; and displaying the distribution result of distributing the reward for the target object according to the basic reward and the additional reward of each subtask.
It can be understood by those skilled in the art that the structure shown in fig. 7 is only an illustration, and the computer device may also be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, a Mobile Internet Device (MID), a PAD, and the like. Fig. 7 is a diagram illustrating a structure of the electronic device. For example, computer device A may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 7, or have a different configuration than shown in FIG. 7.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
Example 6
Embodiments of the present application also provide a storage medium. Optionally, in this embodiment, the storage medium may be configured to store program codes executed by the method for distributing rewards provided in the first embodiment.
Optionally, in this embodiment, the storage medium may be located in any one of computer terminals in a computer terminal group in a computer network, or in any one of mobile terminals in a mobile terminal group.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks; determining the extra reward of each subtask according to the task execution result of each object and the initial total budget; the target object is assigned a reward based on the base reward and the bonus reward for each subtask.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring the maximum issuing times of each subtask; and issuing the tasks according to the maximum issuing times of each subtask.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: detecting the current issuing times of each subtask; under the condition that the current issuing times are less than the maximum issuing times corresponding to the subtasks, acquiring a task execution result of the task to be executed; and under the condition that the task execution result does not meet the preset condition, continuing to issue the task to be executed.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring the task number of subtasks contained in a task to be executed and the maximum issuing times of each subtask; determining the quantity ratio of the first-class tasks to the second-class tasks, wherein the second-class tasks are tasks for judging whether the object is executed correctly; and determining the initial total budget according to the basic reward of each subtask, the number of tasks, the maximum issuing times of each subtask and the number ratio of the first class of tasks to the second class of tasks.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring the task number of subtasks contained in a task to be executed and the average issuing times of each subtask; and determining the initial total budget according to the number of tasks, the average issuing times of each subtask and the basic reward of each subtask.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: obtaining a total basic budget according to the task execution result of each object; determining a target object according to a task execution result of each object; determining a task execution result of the target object; and determining the additional reward of each subtask according to the initial total budget, the total basic budget and the task execution result of the target object.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: the award amount of the target object is obtained according to the execution result of the target object, the base award for each subtask, and the additional award for each subtask.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring the adjusted initial total budget; determining the initial reward of each object according to the adjusted initial total budget and the task execution result of each object; determining a target object according to the initial reward; determining the extra reward of each subtask according to the adjusted initial total budget and the task execution result of the target object; and determining the total reward amount of the target object according to the adjusted initial total budget, the task execution result of the target object and the additional reward of each subtask.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: inputting a basic reward of each subtask and an initial total budget of rewards to be distributed; displaying a task execution result of each object executing a task to be executed and a target object, wherein the task to be executed comprises a plurality of subtasks; displaying the additional reward of each subtask determined according to the task execution result of each object and the initial total budget; and displaying the distribution result of distributing the reward for the target object according to the basic reward and the additional reward of each subtask.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (13)
1. A method of distributing rewards, comprising:
acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks;
determining an additional reward of each subtask according to the task execution result of each object and the initial total budget;
and distributing the reward to the target object according to the basic reward and the additional reward of each subtask.
2. The method of claim 1, wherein prior to obtaining the initial total budget to be allocated the reward, the base reward for each subtask, and the task execution result for each object to execute the task to be executed, the method further comprises:
acquiring the maximum issuing times of each subtask;
and issuing the tasks according to the maximum issuing times of each subtask.
3. The method of claim 2, wherein issuing tasks according to the maximum number of issues for each subtask comprises:
detecting the current issuing times of each subtask;
under the condition that the current issuing times are less than the maximum issuing times corresponding to the subtasks, acquiring a task execution result of the task to be executed;
and under the condition that the task execution result does not meet the preset condition, continuously issuing the task to be executed.
4. The method of claim 1, wherein obtaining an initial total budget for rewards to be allocated comprises:
acquiring the task number of subtasks contained in the task to be executed and the maximum issuing times of each subtask;
determining the quantity ratio of the first-class tasks to the second-class tasks, wherein the second-class tasks are tasks for judging whether the object is executed correctly;
and determining the initial total budget according to the basic reward of each subtask, the number of tasks, the maximum issuing times of each subtask and the number ratio of the first class of tasks to the second class of tasks.
5. The method of claim 1, wherein obtaining an initial total budget for rewards to be allocated comprises:
acquiring the task number of subtasks contained in the task to be executed and the average issuing times of each subtask;
and determining the initial total budget according to the task number, the average issuing times of each subtask and the basic reward of each subtask.
6. The method according to claim 4 or 5, wherein determining the bonus prize for each subtask according to the task execution result of each object and the initial total budget comprises:
obtaining a total basic budget according to the task execution result of each object;
determining the target object according to the task execution result of each object;
determining a task execution result of the target object;
and determining the additional reward of each subtask according to the initial total budget, the total basic budget and the task execution result of the target object.
7. The method of claim 6, wherein allocating rewards for the target objects according to the base reward and the additional reward of each subtask comprises:
and obtaining the total reward amount of the target object according to the execution result of the target object, the basic reward of each subtask and the additional reward of each subtask.
8. The method of claim 1, wherein after allocating rewards for target objects according to the base rewards and the additional rewards for each subtask, the method further comprises:
acquiring the adjusted initial total budget;
determining an initial reward of each object according to the adjusted initial total budget and the task execution result of each object;
determining the target object according to the initial reward;
determining the extra reward of each subtask according to the adjusted initial total budget and the task execution result of the target object;
and determining the total reward amount of the target object according to the adjusted initial total budget, the task execution result of the target object and the additional reward of each subtask.
9. A method of distributing rewards, comprising:
inputting a basic reward of each subtask and an initial total budget of rewards to be distributed;
displaying a task execution result of each object executing a task to be executed and a target object, wherein the task to be executed comprises a plurality of subtasks;
displaying an additional reward of each subtask determined according to the task execution result of each object and the initial total budget;
and displaying distribution results of distributing the rewards for the target objects according to the basic rewards and the additional rewards of each subtask.
10. An apparatus for distributing rewards, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, and the task to be executed comprises a plurality of subtasks;
a determining module, configured to determine an extra reward for each subtask according to the task execution result of each object and the initial total budget;
and the distribution module is used for distributing rewards to the target objects according to the basic rewards and the additional rewards of each subtask.
11. A storage medium, characterized in that the storage medium includes a stored program, wherein when the program runs, a device on which the storage medium is located is controlled to execute the following steps:
acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks;
determining an additional reward of each subtask according to the task execution result of each object and the initial total budget;
and distributing the reward to the target object according to the basic reward and the additional reward of each subtask.
12. A computer device comprising a processor, wherein the processor is configured to execute a program, wherein the program when executed performs the steps of:
acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks;
determining an additional reward of each subtask according to the task execution result of each object and the initial total budget;
and distributing the reward to the target object according to the basic reward and the additional reward of each subtask.
13. A system for distributing rewards, comprising:
a processor; and
a memory coupled to the processor for providing instructions to the processor for processing the following processing steps:
acquiring an initial total budget of rewards to be distributed, a basic reward of each subtask and a task execution result of each object executing a task to be executed, wherein the task to be executed comprises a plurality of subtasks;
determining an additional reward of each subtask according to the task execution result of each object and the initial total budget;
and distributing the reward to the target object according to the basic reward and the additional reward of each subtask.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811133288.4A CN110956350A (en) | 2018-09-27 | 2018-09-27 | Method, device and system for distributing rewards |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811133288.4A CN110956350A (en) | 2018-09-27 | 2018-09-27 | Method, device and system for distributing rewards |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110956350A true CN110956350A (en) | 2020-04-03 |
Family
ID=69975142
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811133288.4A Pending CN110956350A (en) | 2018-09-27 | 2018-09-27 | Method, device and system for distributing rewards |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110956350A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112734498A (en) * | 2021-01-22 | 2021-04-30 | 腾讯科技(深圳)有限公司 | Task reward acquisition method, device, terminal and storage medium |
CN112995300A (en) * | 2021-02-07 | 2021-06-18 | 杭州复杂美科技有限公司 | Block link point reward method, equipment and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103886402A (en) * | 2012-12-20 | 2014-06-25 | 国际商业机器公司 | Method and system for automated incentive computation in crowdsourcing system |
CN106570679A (en) * | 2016-10-27 | 2017-04-19 | 南京邮电大学 | Participant capability based excitation method for crowdsourcing task of group |
CN108038729A (en) * | 2017-12-18 | 2018-05-15 | 广东欧珀移动通信有限公司 | Reward distribution method, device and server |
-
2018
- 2018-09-27 CN CN201811133288.4A patent/CN110956350A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103886402A (en) * | 2012-12-20 | 2014-06-25 | 国际商业机器公司 | Method and system for automated incentive computation in crowdsourcing system |
CN106570679A (en) * | 2016-10-27 | 2017-04-19 | 南京邮电大学 | Participant capability based excitation method for crowdsourcing task of group |
CN108038729A (en) * | 2017-12-18 | 2018-05-15 | 广东欧珀移动通信有限公司 | Reward distribution method, device and server |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112734498A (en) * | 2021-01-22 | 2021-04-30 | 腾讯科技(深圳)有限公司 | Task reward acquisition method, device, terminal and storage medium |
CN112734498B (en) * | 2021-01-22 | 2023-09-26 | 腾讯科技(深圳)有限公司 | Task rewarding acquisition method, device, terminal and storage medium |
CN112995300A (en) * | 2021-02-07 | 2021-06-18 | 杭州复杂美科技有限公司 | Block link point reward method, equipment and storage medium |
CN112995300B (en) * | 2021-02-07 | 2022-06-24 | 杭州复杂美科技有限公司 | Block link point reward method, equipment and storage medium |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111367562B (en) | Data acquisition method, device, storage medium and processor | |
CN103824217A (en) | System and method for realizing advertisement putting, effect optimization and statistics in smart phone | |
CN109377253A (en) | Advertisement placement method, device, terminal and storage medium | |
CN109948882B (en) | Task processing method based on block data structure and related equipment | |
CN103544662A (en) | Systems and methods involving interactive queuing, and related electronic apparatus | |
CN110956350A (en) | Method, device and system for distributing rewards | |
CN111768174A (en) | Activity management method, apparatus, device and medium | |
CN107895289A (en) | A kind of task dissemination method and device | |
CN111861525A (en) | Task execution method and device, electronic equipment and computer readable storage medium | |
CN110599170A (en) | Transaction information processing method and system based on block chain and storage medium | |
CN111369270B (en) | Method, device and system for distributing rewarding resources | |
CN110634031A (en) | Method, device, equipment and medium for tracking and analyzing published content | |
CN109472627B (en) | Channel provider recommendation method and device | |
KR101270284B1 (en) | Concept test system of developed product and test method using it | |
CN113778547A (en) | Object processing method and device, computer program product and processor | |
CN112836971A (en) | Quota resource determination method and device, electronic equipment and storage medium | |
CN112182394A (en) | Product recommendation method and device, electronic equipment and storage medium | |
CN110555731B (en) | Method and device for making and releasing poster and processing poster template | |
KR101471331B1 (en) | System and method for providing advertisement publicity and scholarship | |
CN108804235B (en) | Data grading method and device, storage medium and processor | |
CN113242457A (en) | Resource distribution method and device, electronic equipment and storage medium | |
CN112785445A (en) | Insurance benefit measuring and calculating method and device for life insurance product and storage medium | |
CN111178960B (en) | Advertisement resource integration platform | |
CN113590241A (en) | Display method and device of visual billboard, storage medium and electronic device | |
CN110570294A (en) | Method, device and storage medium for managing settlement |
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 |