Promotion task processing method and device, storage medium and electronic device

Abstract

The present disclosure provides a promotion task processing method, a promotion task processing device, a computer-readable storage medium and an electronic device, and relates to the field of computer technology. The promotion task processing method includes: obtaining a task to be promoted; using promotion parameters, determining a promoter subset from a promoter set that makes the cost of executing the task to be promoted the lowest; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the promoter set; and assigning the task to be promoted to the promoters in the promoter subset. The present disclosure implements a solution for completing the task to be promoted at the lowest cost based on the promoter's historical promotion records, and solves the problem that promoters with higher costs occupy too much promotion costs in the process of completing the promotion task.

Description

Background Art

[0002] With the continuous development of Internet technology, the information provided by online platforms to users is becoming more and more abundant, and more and more companies or individuals choose to promote their company brands, products or live broadcast rooms through Internet platforms.

[0003] The existing methods of promoting and publicizing promotional tasks are mostly to select a promoter to complete the promotion task based on the target promotion volume of the promotion task, such as advertising on a certain Internet platform; in addition, promotional tasks can also be published and freely promoted by multiple promoters, and finally corresponding rewards are given according to the promotion volume of multiple promoters.

[0004] However, the existing technology is unable to determine a set of promotion task processing solutions with the lowest cost based on the promotion capabilities of each promoter.

[0005] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0006] The purpose of the present disclosure is to provide a promotion task processing method, a promotion task processing device, a computer-readable storage medium and an electronic device, thereby at least to a certain extent overcoming the problem that promoters with higher costs occupy too much promotion costs during the promotion task processing process due to the limitations and defects of related technologies.

[0007] According to a first aspect of the present disclosure, there is provided a method for processing promotion tasks, comprising: obtaining tasks to be promoted; using promotion parameters to determine a subset of promoters from a set of promoters that minimizes the cost of executing the tasks to be promoted; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the set of promoters; and allocating the tasks to be promoted to promoters in the subset of promoters.

[0008] Optionally, the promotion task processing method further includes: obtaining the promotion cost required for each promoter in the promoter set to promote different numbers of objects based on the historical promotion records of each promoter in the promoter set; and obtaining the promotion parameters based on the promotion cost.

[0009] Optionally, using the promotion parameters, a subset of promoters that has the lowest cost for executing the task to be promoted is determined from the promoter set, including: determining a state transfer equation for the task to be promoted based on the promotion parameters; wherein the state transfer equation is an equation for calculating the lowest cost; determining an allocation plan for completing the task to be promoted at the lowest cost based on the state transfer equation; and determining a subset of promoters based on the allocation plan.

[0010] Optionally, assigning the task to be promoted to promoters in the promoter subset includes: decomposing the task to be promoted into a plurality of subtasks according to the assignment plan; wherein the subtasks include promotion costs and promotion quantities; and assigning the plurality of subtasks to corresponding promoters.

[0011] Optionally, after the promotion task is assigned to a promoter in the promoter subset, the promotion task processing method includes: determining the promotion result corresponding to the promoter based on the promoter's task execution data; and determining the reward corresponding to the promotion result based on the promotion result, so as to send the reward to the promoter.

[0012] Optionally, after allocating the to-be-promoted tasks to promoters in the promoter subset, the promotion task processing method further includes: sending a task stop notification to the promoter so that the promoter stops the task promotion operation.

[0013] Optionally, after completing the task to be promoted, the promotion task processing method also includes: recording the promotion record of the completed task to be promoted corresponding to the promoter, so as to update the historical promotion record and obtain the updated historical promotion record; according to the updated historical promotion record, updating the promotion parameters and obtaining the updated promotion parameters.

[0014] According to a second aspect of the present disclosure, a promotion task processing device is provided, including: a task acquisition module, a task determination module, and a task allocation module.

[0015] Specifically, the task acquisition module can be used to acquire tasks to be promoted; the task determination module can be used to use promotion parameters to determine a subset of promoters from a set of promoters that has the lowest cost for executing the tasks to be promoted; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the set of promoters; and the task allocation module can be used to allocate tasks to be promoted to promoters in the subset of promoters.

[0016] Optionally, the task determination module may be configured to execute: obtaining the promotion cost required for each promoter in the promoter set to promote different numbers of objects according to the historical promotion record of each promoter in the promoter set; and obtaining the promotion parameter according to the promotion cost.

[0017] Optionally, the task determination module can be configured to perform: determining a state transfer equation for the task to be promoted based on promotion parameters; wherein the state transfer equation is an equation for calculating the minimum cost; determining an allocation plan for completing the task to be promoted at the lowest cost based on the state transfer equation; and determining a subset of promoters based on the allocation plan.

[0018] Optionally, the task allocation module may be configured to execute: according to the allocation plan, decomposing the task to be promoted into a plurality of subtasks; wherein the subtasks include the promotion cost and the promotion quantity; and allocating the plurality of subtasks to corresponding promoters.

[0019] Optionally, the task assignment module may be configured to perform: determining a promotion result corresponding to the promoter based on the promoter's task execution data; and determining a reward corresponding to the promotion result based on the promotion result, so as to send the reward to the promoter.

[0020] Optionally, the task assignment module may be configured to execute: sending a task stop notification to the promoter so that the promoter stops the task promotion operation.

[0021] Optionally, the task determination module may be configured to execute: recording promotion records corresponding to promoters that have completed tasks to be promoted, so as to update historical promotion records and obtain updated historical promotion records; and updating promotion parameters according to the updated historical promotion records and obtain updated promotion parameters.

[0022] According to a third aspect of the present disclosure, a storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, any one of the above-mentioned promotion task processing methods is implemented.

[0023] According to a fourth aspect of the present disclosure, there is provided an electronic device, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute any one of the above-mentioned promotion task processing methods by executing the executable instructions.

[0024] In the technical solutions provided by some embodiments of the present disclosure, the tasks to be promoted are first obtained, and then the promotion parameters are used to determine the promoter subset from the promoter set that makes the execution cost of the tasks to be promoted the lowest; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the promoter set; and finally the tasks to be promoted are assigned to the promoters in the promoter subset. The present disclosure implements a solution for completing the tasks to be promoted at the lowest cost based on the promoter's historical promotion records, and can assign the tasks to be promoted to promoters with lower required costs, thus solving the problem that promoters with higher costs occupy too much promotion costs during the promotion task processing process.

[0025] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present disclosure, and together with the specification, are used to explain the principles of the present disclosure. Obviously, the drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. In the drawings:

[0027] Figure 1 A flowchart of a promotion task processing method according to an exemplary embodiment of the present disclosure is schematically shown;

[0028] Figure 2 A schematic diagram schematically illustrates a promoter collection according to an exemplary embodiment of the present disclosure;

[0029] Figure 3 A schematic diagram schematically illustrates promotion parameters according to an exemplary embodiment of the present disclosure;

[0030] Figure 4 A schematic diagram of solving a problem using a dynamic programming algorithm according to an exemplary embodiment of the present disclosure is schematically shown;

[0031] Figure 5 A schematic diagram schematically shows a method for implementing a promotion task processing method according to an exemplary embodiment of the present disclosure;

[0032] Figure 6 The overall flow chart of the method for implementing promotion task processing according to an exemplary embodiment of the present disclosure is schematically shown;

[0033] Figure 7 A technical flow chart of promotion task processing according to an exemplary embodiment of the present disclosure is schematically shown;

[0034] Figure 8 A block diagram of a promotion task processing device according to an exemplary embodiment of the present disclosure is schematically shown;

[0035] Fig. 9 A block diagram of an electronic device according to an exemplary embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0036] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as being limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present disclosure will be more comprehensive and complete, and the concepts of the example embodiments are fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present disclosure.

[0037] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and thus their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0038] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the steps. For example, some steps may be decomposed, while some steps may be combined or partially combined, so the actual execution order may change according to the actual situation.

[0039] At present, most of the ways to promote promotional information are to select a promoter to complete the promotion task according to the target promotion volume of the promotion task, such as advertising on a certain Internet platform; in addition, promotion tasks can also be released and freely promoted by multiple promoters, and finally corresponding rewards are given according to the promotion volume of multiple promoters. However, the existing promotion task processing methods have many defects.

[0040] For example, if the promotion goal is to promote 1 million traffic, the cost of promoting 400,000 traffic through Company A is 20, the cost of promoting 1 million traffic through Company A is 80, the cost of promoting 600,000 traffic through Company B is 30, and the cost of promoting 1 million traffic through Company B is 90. The existing technology usually simply compares the total cost required to promote 1 million traffic between Company A and Company B, and finally chooses to spend 80 to promote 1 million traffic through Company A to complete this promotion task, while ignoring the use of a combination of the two to handle the promotion task. It is impossible to choose a promotion plan with a lower cost. For another example, during a promotion, when a user receives a promotion task, carefully makes a promotion video / article and promotes it, the overall goal of the promotion has been achieved and the promotion is terminated, then the promoter cannot get the reward, resulting in customer complaints. In addition, this promotion method cannot effectively control the promotion activities. When an emergency occurs, the promotion activities cannot be stopped in time, which leads to serious consequences.

[0041] In view of this, the present disclosure proposes a promotion task processing method.

[0042] Figure 1 The flowchart of the promotion task processing method of the exemplary embodiment of the present disclosure is schematically shown. In the promotion task processing method proposed in the present disclosure, the device for acquiring and processing tasks can be a server, a computer, a smart phone, etc. Figure 1, the promotion task processing method may include the following steps:

[0043] S12. Obtain the tasks to be promoted.

[0044] In the exemplary embodiment of the present disclosure, the task to be promoted is a promotion task waiting to be executed. The promotion task can be a target number of people for promotion of one or more promotional contents, or a target promotion flow rate for one or more promotional contents. The promotional contents can be the promotion of a company brand, a product, or a live broadcast room. The specific promotional contents are not limited in the present disclosure. The target number of people for promotion is the number of people to whom the promotional content is planned to be promoted, and the target promotion flow rate is the flow rate to which the promotional content is planned to be promoted. For example, the task to be promoted can be to promote a live broadcast room to 100,000 people within 3 days.

[0045] S14. Using the promotion parameters, determine from the promoter set a promoter subset that minimizes the cost of executing the task to be promoted; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the promoter set.

[0046] In an exemplary embodiment of the present disclosure, the promotion parameters are calculated based on the historical promotion records of each promoter in the promoter set. The historical promotion records are records containing the corresponding relationship between the number of promoters and the promotion cost of each promoter. The promoter set is a set of promoters that can be used to perform promotion tasks. Promoters can be people, or platforms that can be used to perform promotion tasks, such as TV stations, application software, and web pages. The promoter subset is a part of the promoters selected from the promoter set to complete the promotion task. The cost of performing the task to be promoted refers to the time cost, that is, the time required to complete the task to be promoted. The promoter subset with the lowest cost is a part of the promoters selected from the promoter set to complete the task to be promoted, wherein the selected part of the promoters consumes the least time to complete the task to be promoted. It should be noted that the cost in the present disclosure can be not only the time cost, but also the price cost such as points, virtual currency, and money, that is, the lowest cost can also be the lowest monetary cost.

[0047] In an exemplary embodiment of the present disclosure, Figure 2 A schematic diagram schematically shows a promoter collection according to an exemplary embodiment of the present disclosure, with reference to Figure 2 , the promoter set can be a set of promoters such as promoter A, promoter B, promoter C, etc.

[0048] In an exemplary embodiment of the present disclosure, the promotion parameters are calculated based on the historical promotion records of each promoter in the promoter set. The historical promotion records are record tables containing the correspondence between the number of promoters and the promotion costs of each promoter. Table 1 is a promotion record of promoter A.

[0049] Table 1

[0050] Number of Promoters 1 2 3 4 5 6 Promotion Cost 1 1 2 3 4 5

[0051] As shown in Table 1, the number of promoters refers to the number of people to whom promoter A promoted the promotional content, and the promotion cost refers to the total cost that promoter A needs to pay when promoting the corresponding number of people. In this promotion record, it is recorded that when promoter A promotes one person, the total promotion cost used is 1, when promoting two people, the total promotion cost used is 1, when promoting three people, the total promotion cost used is 2, and so on. Because usually, when we want to promote an advertisement, we often don’t need to pay any cost to promote the advertisement to a few people, such as our family, good friends, etc., but when we need to expand the promotion scope, we need to pay certain resources to promote the advertisement to more people. Therefore, the promotion cost required for promoting one person and promoting two people in the table is the same. It should be noted that the numbers in the table are only listed for the convenience of description. The actual situation may be different from the numbers in the table. The promotion cost can be a time cost, for example, it takes 1 hour to promote one person, 1 hour to promote two people, and 2 hours to promote three people. It can also be points, virtual currency, money, etc.

[0052] In an exemplary embodiment of the present disclosure, the historical promotion records may include the promotion records of each promoter during each promotion process. When the amount of data is large, it may also be set to include a certain number of promotion records. For example, it may be set to include the promotion records of 100 promotion processes of each promoter.

[0053] In an exemplary embodiment of the present disclosure, historical promotion records may also be saved in an array format. Table 2 is a table for saving promoter historical promotion records in an array format.

[0054] Table 2

[0055]

[0056] As shown in Table 2, taking the second promotion record [1,2,2,3,6,7] of promoter C as an example, the first number "1" in the array represents the total cost required to promote one person, and so on, the fifth number "6" represents the total cost required to promote five people.

[0057] In an exemplary embodiment of the present disclosure, the promotion cost required for each promoter in the promoter set to promote different numbers of objects is obtained according to the historical promotion records of each promoter in the promoter set; and the promotion parameter is obtained according to the promotion cost. The object can be a user or traffic, etc., which is not limited in the present disclosure.

[0058] In an exemplary embodiment of the present disclosure, taking the calculation of the promotion cost of promoter A as an example, promoter A's four promotion records are shown in Table 2, which are [1,1,2,3,4,5], [1,2,3], [1,2,3,4,5,6,7], and [1,3,4,6]. The average promotion cost of promoter A in these four promotion processes is calculated from the first person promoted to the maximum number of people promoted. For example, the average promotion cost of promoter A promoting one person is (1+1+1+1)÷4=1, the average cost of promoting two people is (1+2+2+3)÷4=2, and the average cost of promoting three people is (2+3+3+4)÷4=3. The promotion parameters of promoter A can be calculated in sequence as [1,2,3,···]. The same method can be used to obtain the promotion parameters of promoters such as promoter B and promoter C, and the set of promotion parameters of each promoter is the final required promotion parameters.

[0059] Figure 3 Schematically shows a schematic diagram of promotion parameters according to an exemplary embodiment of the present disclosure. Figure 3 As shown, the promotion parameters include the average cost required for each promoter to promote each additional user starting from the first user.

[0060] In an exemplary embodiment of the present disclosure, the promotion parameters are used to assign the task to be promoted to one or more promoters in a promoter set, including: determining the promoter required to complete the task to be promoted at the lowest cost from the promoter set based on the promotion parameters; if the number of promoters required is one, assigning the task to be promoted to a promoter in the promoter set corresponding to the required promoter; if the number of promoters required is multiple, assigning the task to be promoted to multiple promoters in the promoter set corresponding to the required promoters.

[0061] In an exemplary embodiment of the present disclosure, if only one promoter is needed to complete the task to be promoted at the lowest cost, the task to be promoted is assigned to the promoter; if multiple promoters are needed to complete the task to be promoted at the lowest cost, the task to be promoted is assigned to the multiple promoters.

[0062] In an exemplary embodiment of the present disclosure, the number of promoters required to complete the task to be promoted at the lowest cost is determined from a set of promoters based on the promotion parameters, including: determining the state transfer equation of the task to be promoted based on the promotion parameters; wherein the state transfer equation is an equation for calculating the lowest cost; determining an allocation plan for completing the task to be promoted at the lowest cost based on the state transfer equation; and determining the number of promoters based on the allocation plan.

[0063] In an exemplary embodiment of the present disclosure, the state transition equation is that the state of the current stage in dynamic programming is often the result of the state of the previous stage and the decision of the previous stage. If the state and decision of the Kth stage are given, the state of the K+1th stage is completely determined. Through the state transition equation, an allocation plan for completing the tasks to be promoted at the lowest cost can be obtained, where the content of the allocation plan includes which promoters to assign the tasks to be promoted, how many tasks to assign to each promoter, and how much cost to assign to each promoter. The knapsack problem in the dynamic programming algorithm conforms to the task promotion scenario in the present disclosure. The idea of ​​solving the problem is divided into four steps, refer to Figure 4 , Figure 4 The figure schematically shows a schematic diagram of solving a problem by using a dynamic programming algorithm according to an exemplary embodiment of the present disclosure.

[0064] like Figure 4 As shown, the state determination stage 41 refers to decomposing the total problem into sub-problems by confirming the last step. In the scenario of task promotion in the present disclosure, assuming that n people need to be promoted, it can be decomposed into the cost of n-1 people and the cost of the nth person, and so on and so forth, it can be decomposed into the costs of the 1st, 2nd, 3rd...nth people; the transfer equation determination stage 43 is to obtain the state transfer equation f[i][v]=min{f[i-1][v],f[i-1][v-Ci]+Wi} through the above state confirmation stage, that is, to obtain the function of minimum cost; the start and boundary conditions 45 are to determine that the cost of the last promoted user cannot exceed the total cost. This problem can be ignored in actual scenarios (because the cost of a single user is very low); the calculation sequence 47 adopts the memorandum mode starting from f(0), and the specific calculation method is recursive.

[0065] S16. Allocate the tasks to be promoted to promoters in the promoter subset.

[0066] In an exemplary embodiment of the present disclosure, a method for allocating tasks to be promoted to promoters in a promoter subset may be to decompose the tasks to be promoted into multiple subtasks according to an allocation scheme; wherein the subtasks include promotion costs and promotion quantities; and the multiple subtasks are allocated to corresponding promoters. The contents of the subtasks include which promoters the tasks to be promoted are allocated to, how many tasks are allocated to each promoter, and how much cost is allocated to each promoter.

[0067] In an exemplary embodiment of the present disclosure, the task to be promoted may be to promote a live broadcast room to 100,000 people within 3 days. The allocation scheme may be to let promoter A promote 30,000 people within 2 days, promoter B promote 40,000 people within 3 days, and promoter C promote 30,000 people within 3 days. The task to be promoted is decomposed into 3 subtasks, each of which corresponds to a promoter.

[0068] In an exemplary embodiment of the present disclosure, the task to be promoted may also be to use 600,000 yuan to promote a live broadcast room to 100,000 people. In this case, the allocation scheme may be to allocate 150,000 yuan of cost to promoter A to promote 30,000 people, 200,000 yuan of cost to promoter B to promote 30,000 people, and 250,000 yuan of cost to promoter C to promote 40,000 people. The task to be promoted is decomposed into 3 subtasks, each of which corresponds to a promoter.

[0069] In an exemplary embodiment of the present disclosure, after the promotion task is assigned to one or more promoters in a promoter set, the promotion task processing method includes: determining the promotion result corresponding to the promoter based on the promoter's task completion status; and determining the reward corresponding to the promotion result based on the promotion result, so as to send the reward to the promoter.

[0070] In an exemplary embodiment of the present disclosure, after the task to be promoted is assigned to a promoter in a promoter subset, the promotion result corresponding to the promoter can be determined based on the promoter's task execution data; based on the promotion result, a reward corresponding to the promotion result is determined so that the reward can be sent to the promoter. Task execution data is data generated by the promoter performing the task, which can record the promoter's task completion status, for example, the number of people promoted by promoter A when performing the promotion task, the time consumed, the cost used, etc.

[0071] In an exemplary embodiment of the present disclosure, according to the completion of the promoter's tasks, if the promoter completes all the assigned tasks, a larger reward can be sent to the promoter, and if the promoter does not complete all the assigned tasks, a smaller reward can be sent to the promoter. This method of sending rewards can promote the promoter to complete the task to a certain extent. The reward sent can be money or virtual items such as points.

[0072] In an exemplary embodiment of the present disclosure, after allocating the to-be-promoted task to one or more promoters in the promoter set, the promotion task processing method further includes: sending a task stop notification to the promoter so that the promoter stops the task promotion operation.

[0073] In an exemplary embodiment of the present disclosure, during the process of the promoter performing the promotion task, a notification to stop the promotion task can be sent to the promoter, so that the promoter can stop the promotion task. This method can immediately stop the promotion task in some emergency situations, so that the number of people or traffic limit of the promotion can be controlled.

[0074] In an exemplary embodiment of the present disclosure, after completing the task to be promoted, the promotion task processing method further includes: recording the current promotion record corresponding to the promoter so as to update the historical promotion record and obtain an updated historical promotion record; and updating the promotion parameters according to the updated historical promotion record to obtain an updated promotion parameter.

[0075] In the exemplary embodiment of the present disclosure, the system automatically analyzes which promoter the traffic source belongs to. After a promotion is completed, the traffic situation is classified and counted according to the promoter, and written into the historical promotion record table. As the amount of data in the historical promotion record table increases, the use of promotion parameters to allocate tasks will be more accurate, thereby achieving a benign closed-loop iteration of the system.

[0076] In an exemplary embodiment of the present disclosure, a promotion activity organized by a company is taken as an example to further illustrate the promotion task processing method proposed in the present disclosure.

[0077] In a promotion, the original promotion target is 800,000 traffic, and there are 6,000 promoters available to promote the promotion, which can promote 200,000-1.2 million traffic.

[0078] Since the activity server can handle limited traffic, if the traffic at the same time exceeds a certain value (such as more than 800,000 traffic), the server will crash or fail to work properly. Therefore, it is very important to ensure that the promotion traffic is within 800,000.

[0079] Because it is impossible to determine how many tasks should be assigned to each promoter to ensure that the promotion traffic is controlled within 800,000 traffic, for the sake of safety, the promotion target can only be set at 400,000 traffic. However, the actual promotion traffic may be 480,000, far lower than the target promotion traffic of 800,000 traffic, thus causing economic losses.

[0080] In the exemplary embodiment of the present disclosure, the actual promotion task can be set more accurately according to the target promotion flow by configuring the promotion center, the model calculation engine, the promotion capability model, and the task allocation module. Among them, the promotion center is used to allocate tasks and control the start and stop of promotion tasks, the model calculation engine is used to calculate the promotion capability model, the promotion capability model is used to calculate how to allocate tasks, and the promotion parameters are stored in it, and the task allocation module is used to allocate tasks to promoters.

[0081] In the exemplary embodiment of the present disclosure, referring to Figure 5, Figure 5 A schematic diagram of a method for implementing a promotion task processing method according to an exemplary embodiment of the present disclosure is schematically shown. Figure 5 As shown, step 1 inputs the historical operation records of each promoter into the model calculation engine, step 2 calculates the promotion capability model through the model calculation engine, wherein the data stored in the promotion capability model is the promotion parameter, in step 3 the promotion center calls the promotion capability model, completes step 4, and obtains the lowest cost task allocation plan, step 5 allocates the promotion task to the designated promoter according to the task allocation plan, and promotes according to the task, in step 6, the promotion center can terminate the task promotion according to the specific situation to deal with emergencies, in step 7, the promotion record of the designated promoter is saved in the historical operation record according to the task completion status, the system automatically analyzes which promoter the traffic source belongs to, when a promotion is completed, the traffic situation is statistically classified according to the promoter, and written into the historical promotion record table, as the amount of data in the historical promotion record table increases, the promotion capability model will be more accurate, thereby achieving a benign closed-loop iteration of the system.

[0082] In the exemplary embodiment of the present disclosure, a complete promotion task processing process includes 5 stages, referring to Figure 6 , Figure 6 The overall flow chart of the method for implementing the promotion task processing according to the exemplary embodiment of the present disclosure is schematically shown. Figure 6 As shown, the overall process includes the stage of generating the distribution promotion capability model 61, the stage of the promotion center confirming the demand and conducting dynamic planning 63, the stage of the promoter receiving the task according to the allocation result and conducting the promotion 65, the stage of the promotion center intervening 67, and the stage of recording the promotion results 69.

[0083] In the exemplary embodiment of the present disclosure, the promotion capability model is the promotion parameter. The model calculation engine obtains the promotion cost required for each promoter in the promoter set to promote different numbers of objects based on the historical promotion records of each promoter in the promoter set; and obtains the promotion parameter based on the promotion cost. The object can be a user or traffic, etc., which is not limited in the present disclosure.

[0084] In an exemplary embodiment of the present disclosure, the model generation process in the generalization capability model generation stage 61 may include the following five steps.

[0085] Step 1: Query all historical promotion records through the model calculation engine;

[0086] Step 2: Classify the promotion records according to promoters;

[0087] Step 3: For each promoter, find the average cost of promoting the first user in each promotion history, and use it as the average cost of promoting the first user by the promoter. Similarly, find the average cost of promoting each user from the first to the maximum number of promoted users by the promoter.

[0088] Step 4: According to step 3, process the historical promotion records of each promoter in turn;

[0089] Step 5: Get a two-dimensional matrix, which is the same as the promotion parameter, that is, the promotion capability model.

[0090] In the exemplary embodiment of the present disclosure, the calculation of the promotion cost of promoter A is taken as an example to illustrate the generation process of the model in the promotion capability model generation stage 61. The four promotion records of promoter A are shown in Table 2, which are [1,1,2,3,4,5], [1,2,3], [1,2,3,4,5,6,7], and [1,3,4,6]. The average promotion cost of promoter A in these four promotion processes is calculated from the first person promoted to the maximum number of people promoted. For example, the average promotion cost of promoter A promoting the first person is (1+1+1+1)÷4=1, and the average cost of promoting the second person is (1+2+2+3)÷4=2. The promotion parameters of promoter A can be obtained by calculation. The same method can be used to obtain the promotion parameters of promoters such as promoters B and promoters C. The set of promotion parameters of each promoter is the final required promotion parameters. The promotion capability model determines the minimum cost allocation plan based on the promotion parameters.

[0091] In an exemplary embodiment of the present disclosure, the process of the promotion center confirming the demand and performing the dynamic planning stage 63 may include the following four steps.

[0092] Step 1: When the promotion center receives a promotion task, it confirms the promotion budget (cost) and the number of promotion targets;

[0093] Step 2: The promotion center uses a dynamic programming algorithm to plan the lowest-cost promotion task allocation plan based on the promotion capability model;

[0094] Step 3: The dynamic programming algorithm focuses on three factors: who is assigned to, how many task goals are assigned to him, and how much cost is assigned to him;

[0095] Step 4: The dynamic programming algorithm outputs the results according to the above factors. For example, the output result may be that promoter A is allocated to promote 38 people at a cost of 50, promoter B is allocated to promote 13 people at a cost of 15, and promoter C is allocated to promote 20 people at a cost of 35.

[0096] In step 2, the promotion center uses a dynamic programming algorithm to plan the lowest-cost promotion task allocation plan based on the promotion capability model. Figure 4 ,like Figure 4 As shown, the state determination stage 41 refers to decomposing the total problem into sub-problems by confirming the last step. In the scenario of task promotion in the present disclosure, assuming that n people need to be promoted, it can be decomposed into the cost of n-1 people and the cost of the nth person, and so on and so forth, it can be decomposed into the costs of the 1st, 2nd, 3rd...nth people; the transfer equation determination stage 43 is to obtain the state transfer equation f[i][v]=min{f[i-1][v],f[i-1][v-Ci]+Wi} through the above state confirmation stage, that is, to obtain the function of minimum cost; the start and boundary conditions 45 are to determine that the cost of the last promoted user cannot exceed the total cost. This problem can be ignored in actual scenarios (because the cost of a single user is very low); the calculation sequence 47 adopts the memorandum mode starting from f(0), and the specific calculation method is recursive.

[0097] In an exemplary embodiment of the present disclosure, the promoter may receive tasks according to the allocation results and carry out the promotion stage 65, which may include the following five steps.

[0098] Step 1: The promoter first queries the task allocation module of the promotion center to see if there is any promotion task assigned to him / her;

[0099] Step 2: If there is no process result, if there is a promotion task assigned to you, browse your promotion task list;

[0100] Step 3: The promoter selects a promotion task that suits him / her and receives it on the system. The promotion task will be subject to time limits, promotion target requirements, and promotion costs (which are promotion rewards for the promoter);

[0101] Step 4: Promoters carry out promotion according to the task requirements and introduce traffic for the overall promotion task;

[0102] Step 5: The system automatically confirms the source of traffic, and automatically issues rewards to the promoter if it is confirmed that the promoter has completed the task.

[0103] In the exemplary embodiment of the present disclosure, referring to Figure 7 , Figure 7 The technical flow chart of promotion task processing according to an exemplary embodiment of the present disclosure is schematically shown as follows: Figure 7As shown, jimdb is a memory-centric key-value database. The promoter calls the start promotion interface (step 1), the activity engine writes the data to the jimdb cache (step 4), and asynchronously starts the promotion storage (step 5). The promotion information is stored in the jimdb cache and the MySQL database at the same time; when the helper clicks the promoter link, the helper interface is called (step 2), the activity engine retrieves the jimdb cache (step 4), if there is corresponding promotion information, the promotion information is extracted, and the helper result is also written to jimdb (step 4), and asynchronous storage (step 5) and asynchronous events (step 6) are executed at the same time. Asynchronous events are subsequent events of promotion reaching the target, such as issuing virtual item rewards (step 9), WeChat push target message (step 10), and following the store (step 11). Promoters and helpers sign in regularly (step 3) and call the sign-in interface to maintain the daily activity of users. This function will directly trigger the sending reward (step 9) in the asynchronous event (step 6) to issue a small reward. Through the scheduled task, the database data (step 5) and the jimdb cache data (step 4) are checked for consistency (step 7) to avoid data inconsistency problems; if the data inconsistency problem is triggered, the bottom logic will be executed (step 8), the entire function will be locked, and then the data will be read from the database and written into the jimdb cache. After confirming that the data is consistent, it will be unlocked and the service will continue to be provided.

[0104] In the exemplary embodiment of the present disclosure, the promotion center intervention stage 67 is used for the promotion center to intervene in the promotion task urgently, and terminate all promotion tasks in progress, for emergency avoidance. When the promoter performs the promotion task, he needs to query the status control module of the promotion center first. If the verification status is on, the promotion is allowed, and if the verification status is off, the promotion is prohibited. Therefore, when the promotion center status is off, all promotions are terminated to ensure that the traffic limit is controllable.

[0105] In the exemplary embodiment of the present disclosure, the promotion result recording stage 69 automatically analyzes which promoter the traffic source belongs to through the system. After a promotion is completed, the traffic situation is counted according to the promoter classification and written into the historical promotion record table. As the amount of data in the historical promotion record table increases, the promotion capability model will become more accurate, thereby achieving a benign closed-loop iteration of the system.

[0106] In the exemplary embodiment of the present disclosure, the promotion task processing method proposed in the present disclosure can be used to reduce the promotion cost on the one hand, solving the problem of excessive promotion cost occupation by promoters with higher costs. Based on the historical promotion records of each promoter, the cost of promoting each user by the promoter is calculated, thereby obtaining the cost required for the promoter to promote to n users, that is, the promotion capacity. The promotion capacity model of each promoter is aggregated, and the dynamic programming algorithm is used to calculate which promoters are designated and how many promotion tasks are assigned to each promoter during a promotion, so that the total cost is the lowest. On the other hand, social traffic can be controlled more accurately, solving the mutually exclusive contradiction between goal achievement and customer complaints caused by the uncontrollable social traffic. Based on the dynamic programming algorithm, the above-mentioned promotion capacity model is dynamically allocated, so that the achievable traffic can be calculated at the beginning of task allocation, and the threshold of the promotion center can be set accordingly, so that each promoter can obtain the expected benefits while completing the overall promotion goal and avoid customer complaints.

[0107] It should be noted that although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0108] Furthermore, this example implementation also provides a promotion task processing device.

[0109] Figure 8 The block diagram of the promotion task processing device according to the exemplary embodiment of the present disclosure is schematically shown. Figure 8 According to an exemplary embodiment of the present disclosure, the promotion task processing device 8 may include a task acquisition module 81 , a task determination module 83 , and a task allocation module 85 .

[0110] Specifically, the task acquisition module 81 can be used to acquire tasks to be promoted; the task determination module 83 can be used to use promotion parameters to determine a subset of promoters from a set of promoters that has the lowest cost for executing the tasks to be promoted; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the promoter set; the task allocation module 85 can be used to allocate tasks to be promoted to promoters in the subset of promoters.

[0111] According to an exemplary embodiment of the present disclosure, the task determination module 83 may be configured to execute: obtaining the promotion cost required for each promoter in the promoter set to promote different numbers of objects based on the historical promotion records of each promoter in the promoter set; and obtaining promotion parameters based on the promotion cost.

[0112] According to an exemplary embodiment of the present disclosure, the task determination module 83 can be configured to perform: determining the state transfer equation of the task to be promoted based on the promotion parameters; wherein the state transfer equation is an equation for calculating the minimum cost; determining an allocation plan for completing the task to be promoted at the lowest cost based on the state transfer equation; and determining a subset of promoters based on the allocation plan.

[0113] According to an exemplary embodiment of the present disclosure, the task assignment module 85 may be configured to execute: decomposing the task to be promoted into multiple subtasks according to the assignment plan; wherein the subtasks include promotion costs and promotion quantities; and assigning the multiple subtasks to corresponding promoters.

[0114] According to an exemplary embodiment of the present disclosure, the task assignment module 85 may be configured to execute: determining a promotion result corresponding to the promoter based on the promoter's task execution data; and determining a reward corresponding to the promotion result based on the promotion result so as to send the reward to the promoter.

[0115] According to an exemplary embodiment of the present disclosure, the task assignment module 85 may be configured to execute: sending a task stop notification to the promoter so that the promoter stops the task promotion operation.

[0116] According to an exemplary embodiment of the present disclosure, the task determination module 83 can be configured to perform: recording the promotion records corresponding to the promoters who have completed the tasks to be promoted, so as to update the historical promotion records and obtain updated historical promotion records; and updating the promotion parameters according to the updated historical promotion records and obtain updated promotion parameters.

[0117] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.

[0118] The program product for implementing the above method according to an embodiment of the present invention can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0119] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical disk, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0120] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0121] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0122] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0123] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

[0124] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0125] Refer to the following Fig. 9 An electronic device 900 according to this embodiment of the present invention will be described. Fig. 9 The electronic device 900 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0126] like Fig. 9 As shown, the electronic device 900 is in the form of a general computing device. The components of the electronic device 900 may include, but are not limited to: the at least one processing unit 910, the at least one storage unit 920, a bus 930 connecting different system components (including the storage unit 920 and the processing unit 910), and a display unit 940.

[0127] The storage unit stores program codes, which can be executed by the processing unit 910, so that the processing unit 910 executes the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification.

[0128] The storage unit 920 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 9201 and / or a cache storage unit 9202 , and may further include a read-only storage unit (ROM) 9203 .

[0129] The storage unit 920 may also include a program / utility 9204 having a set (at least one) of program modules 9205, such program modules 9205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0130] Bus 930 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0131] The electronic device 900 may also communicate with one or more external devices 1000 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 900, and / or communicate with any device that enables the electronic device 900 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 950. Furthermore, the electronic device 900 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 960. As shown, the network adapter 960 communicates with other modules of the electronic device 900 via a bus 930. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0132] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0133] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0134] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0135] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary technical means in the art that are not disclosed in the present disclosure. The specification and examples are to be considered as exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

[0136] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A promotion task processing method, characterized in that: include: Get the tasks to be promoted; Using the promotion parameters, a dynamic programming algorithm is used to determine a promoter subset from the promoter set that minimizes the cost of executing the task to be promoted; wherein the promotion parameters are obtained based on the historical promotion records of each promoter in the promoter set; Allocating the to-be-promoted tasks to promoters in the promoter subset; Wherein, using the promotion parameters, a dynamic programming algorithm is used to determine from the promoter set a promoter subset that makes the execution cost of the task to be promoted the lowest, including: determining the state transfer equation of the task to be promoted according to the promotion parameters; wherein the state transfer equation is an equation for calculating the lowest cost; according to the state transfer equation, determining an allocation scheme for completing the task to be promoted at the lowest cost, so as to determine the promoter subset; Allocating the task to be promoted to the promoter in the promoter subset includes: decomposing the task to be promoted into a plurality of subtasks according to the allocation scheme; wherein the subtasks include promoters corresponding to the subtasks, the promotion costs and the promotion quantities of the promoters; and allocating the plurality of subtasks to the corresponding promoters; The promotion task processing method also includes: According to the historical promotion records of each promoter in the promoter set, the average promotion cost required for each promoter to promote different numbers of objects is calculated, and the promotion parameters are constructed based on each average promotion cost.

2. The promotion task processing method according to claim 1, characterized in that: After allocating the to-be-promoted tasks to promoters in the promoter subset, the promotion task processing method includes: Determining the promotion result corresponding to the promoter according to the task execution data of the promoter; According to the promotion result, a reward corresponding to the promotion result is determined so as to send the reward to the promoter.

3. The promotion task processing method according to claim 1, characterized in that: After allocating the to-be-promoted tasks to promoters in the promoter subset, the promotion task processing method further includes: A task stop notification is sent to the promoter so that the promoter stops the task promotion operation.

4. The promotion task processing method according to claim 1, characterized in that: After completing the task to be promoted, the promotion task processing method further includes: Recording the promotion record corresponding to the promoter that completes the task to be promoted, so as to update the historical promotion record and obtain the updated historical promotion record; The promotion parameters are updated according to the updated historical promotion records to obtain updated promotion parameters.

5. A promotion task processing device, characterized in that: include: Task acquisition module, used to obtain tasks to be promoted; A task determination module, used to determine a promoter subset from the promoter set that has the lowest cost for executing the to-be-promoted task by using a promotion parameter and a dynamic programming algorithm; wherein the promotion parameter is obtained based on the historical promotion record of each promoter in the promoter set; A task assignment module, used for assigning the to-be-promoted tasks to promoters in the promoter subset; The task determination module is configured to execute: determining a state transfer equation of the task to be promoted according to the promotion parameter; wherein the state transfer equation is an equation for calculating the minimum cost; determining an allocation scheme for completing the task to be promoted at the minimum cost according to the state transfer equation, so as to determine the promoter subset; The task allocation module is configured to execute: according to the allocation scheme, decompose the task to be promoted into a plurality of subtasks; wherein the subtasks include promoters corresponding to the subtasks, the promotion costs and the promotion quantities of the promoters; and allocate the plurality of subtasks to the corresponding promoters; The task determination module is further configured to execute: calculating the average promotion cost required for each promoter to promote different numbers of objects according to the historical promotion records of each promoter in the promoter set, and constructing the promotion parameters based on each average promotion cost.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the promotion task processing method according to any one of claims 1 to 4 is implemented.

7. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; Wherein, the processor is configured to execute the promotion task processing method described in any one of claims 1-4 by executing the executable instructions.

Images