CN111612520B - Resource processing method, device, server and storage medium - Google Patents

Resource processing method, device, server and storage medium Download PDF

Info

Publication number
CN111612520B
CN111612520B CN202010307404.0A CN202010307404A CN111612520B CN 111612520 B CN111612520 B CN 111612520B CN 202010307404 A CN202010307404 A CN 202010307404A CN 111612520 B CN111612520 B CN 111612520B
Authority
CN
China
Prior art keywords
virtual
virtual resource
account
resource allocation
resources
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.)
Active
Application number
CN202010307404.0A
Other languages
Chinese (zh)
Other versions
CN111612520A (en
Inventor
李洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuba Co Ltd
Original Assignee
Wuba Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuba Co Ltd filed Critical Wuba Co Ltd
Priority to CN202010307404.0A priority Critical patent/CN111612520B/en
Publication of CN111612520A publication Critical patent/CN111612520A/en
Application granted granted Critical
Publication of CN111612520B publication Critical patent/CN111612520B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0236—Incentive or reward received by requiring registration or ID from user
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0208—Trade or exchange of goods or services in exchange for incentives or rewards
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0211—Determining the effectiveness of discounts or incentives

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a resource processing method, a device, a server and a storage medium, wherein the method comprises the following steps: when a virtual resource allocation request sent by a target account aiming at a target resource allocation event is received, acquiring a parameter N, the number M of times of virtual resource allocation of the target account which is participated in the target resource allocation event and the remaining duration T of the virtual resource allocation validity period of the target resource allocation event, wherein N is the lower limit value of the number of times of virtual resource allocation which is needed to be participated in by the account when the virtual resource in the account can be converted into an actual resource; according to M, T and N, calculating the probability P M+1 that the target account can be allocated to the virtual resource when participating in virtual resource allocation for the (M+1) th time, and allocating a random number S M+1 to the target account; if S M+1≤PM+1, determining the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation; the target account is allocated X M+1 virtual resources.

Description

Resource processing method, device, server and storage medium
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and apparatus for processing resources, a server, and a storage medium.
Background
With the development of network technology, network service providers often allocate virtual resources to users to increase the liveness and viscosity of the users. In the prior art, most of the virtual resource allocation methods provided by network service providers for users are allocated according to the first-come principle, and the users participating in the later cannot obtain the virtual resources provided by the network service providers, so that the resource allocation efficiency of the whole virtual resource allocation process is lower.
Disclosure of Invention
The embodiment of the invention provides a resource processing method, a device, a server and a storage medium, which are used for solving the technical problem of low resource allocation efficiency in the prior art.
According to a first aspect of the present invention, there is disclosed a resource processing method, the method comprising:
When a virtual resource allocation request sent by a target account aiming at a target resource allocation event is received, acquiring a parameter N, the number of times M that the target account has participated in virtual resource allocation of the target resource allocation event and the remaining duration T of the virtual resource allocation validity period of the target resource allocation event, wherein N is the lower limit value of the number of times that the account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources;
According to M, T and N, calculating probability P M+1 that the target account can be allocated to the virtual resource when participating in virtual resource allocation for the M+1th time, and allocating a random number S M+1 to the target account, wherein S M+1 is a random number corresponding to the target account when participating in virtual resource allocation for the M+1th time, S M+1 E [0,1];
If S M+1≤PM+1, determining the number X M+1 of virtual resources which can be allocated to the target account when the M+1st time participates in virtual resource allocation;
And allocating the virtual resources with the quantity of X M+1 for the target account.
Optionally, as an embodiment, the calculating, according to M, T and N, the probability P M+1 that the target account may be allocated to the virtual resource when participating in the virtual resource allocation for the (m+1) th time includes:
And calculating the probability P M+1 = (N-M)/T that the target account can be allocated to the virtual resource when participating in virtual resource allocation for the (M+1) th time.
Optionally, as an embodiment, the determining the number X M+1 of virtual resources that the target account can allocate when participating in the allocation of virtual resources for the (m+1) th time includes:
Obtaining a virtual resource value interval corresponding to the M+1th time of participation of the account in virtual resource allocation from a preset relation table, wherein a plurality of mapping relations are recorded in the preset relation table, and each mapping relation comprises the corresponding relation between the number of times of participation of the account in virtual resource allocation and the virtual resource value interval;
And randomly selecting a value from the obtained virtual resource value interval, and determining the selected value as the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation.
Optionally, as an embodiment, after the step of allocating the virtual resource of the X M+1 number to the target account, the method further includes:
Determining whether the number of times that the target account has participated in virtual resource allocation reaches N-1;
If the number of times that the target account participates in virtual resource allocation reaches N-1, calculating the number X N of virtual resources which can be allocated to the target account when the target account participates in virtual resource allocation for the Nth time;
if X 1+,…,+XM+1+XN is more than or equal to Y, calculating the probability Z that the target account can convert the virtual resources obtained by allocation into actual resources after participating in N times of virtual resource allocation, and allocating a random number Q for the target account, wherein X i is the number of virtual resources allocated to the target account when participating in the virtual resource allocation for the ith time, i is more than or equal to 1 and less than or equal to M+1, Y is the lower limit value of the number of virtual resources in the account when converting the virtual resources in the account into the actual resources, and Q is the random number corresponding to the target account after participating in N times of virtual resource allocation, Q E [0,1];
And if Q is less than or equal to Z, after the target account participates in N times of virtual resource allocation, converting the virtual resource allocated in the target account into an actual resource.
Optionally, as an embodiment, the calculating the probability Z that the target account may convert the allocated virtual resource into the actual resource after participating in N virtual resource allocations includes:
Acquiring the number R of first-stage candidate accounts participating in the target resource allocation event and the budget investment total S of actual resources; on the day of the nth participation of the target account in virtual resource allocation, the number of times that the first-stage candidate account participates in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y;
According to R, S and Y, calculating the probability z=s/(r×y) that the target account can convert the virtual resource obtained by allocation into the actual resource after participating in N virtual resource allocations.
Optionally, as an embodiment, the method further includes:
Determining a second level candidate account to participate in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in virtual resource allocation;
and if the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y, intercepting virtual resource conversion exceeding Y.
Optionally, as an embodiment, after the target account participates in N virtual resource allocations, converting the virtual resource allocated in the target account into an actual resource includes:
If X 1+,…,+XM+1+XN is greater than Y, allocating Y- (X 1+,…,+XM+1) virtual resources for the target account when the target account actually participates in the N-th virtual resource allocation;
and converting the virtual resources allocated to the target account into actual resources.
Optionally, as an embodiment, the target resource allocation event is an APP operation event, the virtual resource is a virtual prize in the APP operation event, the virtual prize includes a red packet or a point, the actual resource is an actual prize in the APP operation event, and the actual prize includes cash or a real object.
According to a second aspect of the present invention, there is disclosed a resource processing apparatus, the apparatus comprising:
the first acquisition module is used for acquiring a parameter N, the number M of times that the target account has participated in virtual resource allocation of the target resource allocation event and the remaining duration T of the virtual resource allocation validity period of the target resource allocation event when receiving a virtual resource allocation request sent by the target account for the target resource allocation event, wherein N is a lower limit value of the number of times that the target account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources;
the first calculating module is configured to calculate, according to the M, T and the N, a probability P M+1 that the target account can be allocated to the virtual resource when the (m+1) -th time participates in the virtual resource allocation;
The first allocation module is configured to allocate a random number S M+1 to the target account, where S M+1 is a random number corresponding to the target account when the (m+1) -th time participates in virtual resource allocation, S M+1 e [0,1];
A first determining module, configured to determine, in the case of S M+1≤PM+1, a number of virtual resources X M+1 that the target account can allocate when participating in virtual resource allocation for the (m+1) -th time;
And the second allocation module is used for allocating the virtual resources with the quantity of X M+1 for the target account.
Optionally, as an embodiment, the first computing module includes:
and the first calculation submodule is used for calculating the probability P M+1 = (N-M)/T that the target account can be allocated to the virtual resource when the M+1st time participates in the allocation of the virtual resource.
Optionally, as an embodiment, the first determining module includes:
The first obtaining submodule is used for obtaining a virtual resource numerical value interval corresponding to the M+1th time of participation in virtual resource allocation of an account from a preset relation table under the condition of S M+1≤PM+1, wherein a plurality of mapping relations are recorded in the preset relation table, and each mapping relation comprises the corresponding relation between the number of times of participation in virtual resource allocation of the account and the virtual resource numerical value interval;
And the determining submodule is used for randomly selecting a value from the obtained virtual resource value interval and determining the selected value as the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation.
Optionally, as an embodiment, the apparatus further includes:
The second determining module is used for determining whether the number of times that the target account has participated in virtual resource allocation reaches N-1 after the second allocating module allocates the X M+1 number of virtual resources for the target account;
The second calculation module is used for calculating the number X N of virtual resources which can be allocated to the target account when the N-th virtual resource allocation is participated in under the condition that the number of times of the target account which is participated in the virtual resource allocation reaches N-1;
The third calculation module is used for calculating the probability Z that the virtual resources obtained by allocation can be converted into actual resources after the target account participates in N times of virtual resource allocation under the condition that X 1+,…,+XM+1+XN is more than or equal to Y, wherein X i is the number of virtual resources allocated to the target account when the target account participates in the virtual resource allocation for the ith time, i is more than or equal to 1 and less than or equal to M+1, and Y is the lower limit value of the number of virtual resources in an account when the virtual resources in the account can be converted into actual resources;
The third allocation module is used for allocating a random number Q for the target account, wherein Q is a random number corresponding to the target account after participating in N times of virtual resource allocation, and Q epsilon [0,1];
and the conversion module is used for converting the virtual resources distributed in the target account into actual resources after the target account participates in N times of virtual resource distribution under the condition that Q is less than or equal to Z.
Optionally, as an embodiment, the third computing module includes:
The second acquisition submodule is used for acquiring the number R of the first-stage candidate accounts participating in the target resource allocation event and the budget investment total S of the actual resources under the condition that X 1+,…,+XM+1+XN is more than or equal to Y; on the day of the nth participation of the target account in virtual resource allocation, the number of times that the first-stage candidate account participates in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y;
And the second calculation sub-module is used for calculating the probability Z=S/(R×Y) that the target account can convert the allocated virtual resources into actual resources after participating in N times of virtual resource allocation according to R, S and Y.
Optionally, as an embodiment, the apparatus further includes:
A third determining module, configured to determine a second level candidate account participating in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in virtual resource allocation;
And the interception module is used for intercepting virtual resource conversion exceeding Y under the condition that the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y.
Optionally, as an embodiment, the conversion module includes:
An allocation submodule, configured to allocate, when X 1+,…,+XM+1+XN > Y, a virtual resource of Y- (X 1+,…,+XM+1) number to the target account when the target account actually participates in nth virtual resource allocation;
And the conversion sub-module is used for converting the virtual resources distributed by the target account into actual resources.
Optionally, as an embodiment, the target resource allocation event is an APP operation event, the virtual resource is a virtual prize in the APP operation event, the virtual prize includes a red packet or a point, the actual resource is an actual prize in the APP operation event, and the actual prize includes cash or a real object.
According to a third aspect of the present invention, there is disclosed a server comprising: a memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor, implements the steps of the resource processing method of the first aspect.
According to a fourth aspect of the present invention, a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the resource processing method of the first aspect is disclosed.
In the embodiment of the invention, when receiving the virtual resource allocation request sent by the target account, the virtual resource can be allocated to the target account according to the lower limit value N of the number of times the virtual resource allocation is required to be participated in by the account when the virtual resource in one account can be converted into the actual resource, the number of times M of the target account which is participated in the virtual resource allocation and the residual duration T of the virtual resource allocation validity period, so that the user has a probability of obtaining the virtual resource at any time in the virtual resource allocation validity period, thereby improving the resource allocation efficiency.
Drawings
FIG. 1 is a flow chart of a resource processing method of one embodiment of the invention;
FIG. 2 is a flow chart of a resource processing method of another embodiment of the present invention;
FIG. 3 is an application scenario diagram of a resource processing method of one embodiment of the present invention;
fig. 4 is a schematic diagram of a resource processing device according to an embodiment of the present invention.
Detailed Description
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description.
It should be noted that, for simplicity of description, the method embodiments are shown as a series of acts, but it should be understood by those skilled in the art that the embodiments are not limited by the order of acts, as some steps may occur in other orders or concurrently in accordance with the embodiments. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred embodiments, and that the acts are not necessarily required by the embodiments of the invention.
With the development of network technology, network service providers often allocate virtual resources to users to increase the liveness and viscosity of the users. In the prior art, most of the virtual resource allocation methods provided by network service providers for users are allocated according to the first-come principle, and the users participating in the later cannot obtain the virtual resources provided by the network service providers, so that the resource allocation efficiency of the whole virtual resource allocation process is lower.
In order to solve the technical problems, the embodiment of the invention provides a resource processing method, a device, a server and a storage medium.
For ease of understanding, some concepts involved in embodiments of the invention are first described below.
The target resource allocation event may include two phases: the virtual resource allocation phase (also referred to as an "allocation phase") and the virtual resource transition to the actual resource phase (also referred to as an "extraction phase").
For an account participating in a target resource allocation event, the account firstly enters a virtual resource allocation stage, in the virtual resource allocation stage, whether the account is qualified for the allocated virtual resources is mainly calculated, and if the account is qualified for the allocated virtual resources, a certain number of virtual resources are allocated into the account; if the number of times that the account participates in virtual resource allocation in the virtual resource allocation stage reaches a certain number (denoted by 'N' in the embodiment of the invention) and the accumulated number of virtual resources in the account reaches a certain value (denoted by 'Y' in the embodiment of the invention), the account can enter a stage that virtual resources are converted into actual resources; in the stage of converting virtual resources into actual resources, whether the account is qualified for converting the virtual resources in the account into the actual resources is mainly calculated, and if the account is qualified for converting the virtual resources in the account into the actual resources, the virtual resources in the account are converted into the actual resources.
The resource processing method provided by the embodiment of the invention is described next.
The virtual resource processing method in the embodiment shown in fig. 1 takes virtual resource allocation of an account as an example, and describes a virtual resource allocation stage of a target resource allocation event; the virtual resource processing method of the embodiment shown in fig. 2 also takes the conversion of virtual resources of one account into actual resources as an example, and describes the stage of converting virtual resources of a target resource allocation event into actual resources.
FIG. 1 is a flow chart of a resource processing method performed by a server, as shown in FIG. 1, according to one embodiment of the invention, which may include the steps of: step 101, step 102, step 103 and step 104, wherein,
In step 101, when a virtual resource allocation request sent by a target account for a target resource allocation event is received, a parameter N, the number of times M that the target account has participated in virtual resource allocation of the target resource allocation event, and a remaining duration T of a virtual resource allocation validity period of the target resource allocation event are obtained, where N is a lower limit value of the number of times that the target account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources.
In the embodiment of the invention, an account can enter a virtual resource conversion stage from a virtual resource allocation stage to an actual resource stage, and two preconditions are required to be satisfied: one precondition is that the number of times the account participates in virtual resource allocation reaches N, and the other precondition is that the number of virtual resources that the account cumulatively allocates in the virtual resource allocation stage reaches a value Y, that is, the account needs to participate in virtual resource allocation at least N times, and the number of virtual resources that are cumulated in the account is at least Y, so that the virtual resource can be converted from the virtual resource allocation stage into the actual resource stage.
In the embodiment of the invention, considering the timeliness of the target resource allocation event, the account can be allocated with virtual resources only by participating in virtual resource allocation in the validity period and can participate outside the validity period without being allocated with virtual resources by configuring the validity period for the virtual resource allocation stage.
In the embodiment of the invention, M is the number of times that the target account has participated in virtual resource allocation in the virtual resource allocation stage of the target resource allocation event.
In the embodiment of the present invention, the purpose of acquiring parameters N, M and T is to: based on N, M and T, a specific calculation is made as to whether the target account qualifies for the assigned virtual resource, step 102.
In step 102, according to M, T and N, a probability P M+1 that the target account can be allocated to the virtual resource when participating in the allocation of the virtual resource for the (m+1) th time is calculated, and a random number S M+1 is allocated to the target account, where S M+1 is a random number corresponding to the target account when participating in the allocation of the virtual resource for the (m+1) th time, S M+1 e [0,1].
In the embodiment of the invention, the larger the value of P M+1, the larger the probability that S M+1 falls into (0, P M+1), which indicates that the probability that the target account can be allocated to the virtual resource is also larger.
In one embodiment of the present invention, the step 102 may specifically include the following steps:
And calculating the probability P M+1 = (N-M)/T that the target account can be allocated to the virtual resource when participating in the virtual resource allocation for the (M+1) th time.
In one example, N is set to 3, and the validity period of the virtual resource allocation stage is set to 7, then when the target account participates in virtual resource allocation for 1 st time on day 1, m=0 and t=7 can be obtained, and P 1 = (3-0)/7=3/7=0.428 is calculated; when the target account participates in virtual resource allocation for the 2 nd time on the 2 nd day, M=1 and T=6 can be obtained, and P 2 = (3-1)/6=1/3=0.333 is calculated; when the target account participates in virtual resource allocation for the 3 rd time on the 3 rd day, m=2 and t=5 can be obtained, and P 3 = (3-2)/5=1/5=0.2 is calculated.
Therefore, through the calculation mode, for the account which participates in virtual resource allocation in the early stage, the probability of being converted into the actual resource stage by the virtual resource can be naturally reduced along with time, but after the account is participated for many times, the account can be converted into the actual resource stage by the virtual resource; for the account which later participates in virtual resource allocation, as long as the remaining time is enough in the valid period of the virtual resource allocation stage, the probability still exists to acquire the virtual resource, and finally the virtual resource is converted into the actual resource stage.
In step 103, if S M+1≤PM+1, the number of virtual resources X M+1 that the target account can allocate when participating in the virtual resource allocation for the (m+1) -th time is determined.
In the embodiment of the present invention, if S M+1≤PM+1 indicates that the target account is qualified for the allocated virtual resource, at this time, how many virtual resources are allocated to the target account is further calculated.
In one embodiment of the present invention, the step 103 may specifically include the following steps (not shown in the figure): step 1031, and step 1032, wherein,
In step 1031, a virtual resource value interval corresponding to the (m+1) th time of participation of the account in the virtual resource allocation is obtained from a preset relationship table, wherein a plurality of mapping relationships are recorded in the preset relationship table, and each mapping relationship comprises a corresponding relationship between the number of times of participation of the account in the virtual resource allocation and the virtual resource value interval.
In one example, a preset relationship table is shown in table 1, where 3 mapping relationships are recorded in the relationship table, and the mapping relationships are respectively as follows: the method comprises a mapping relation 1, a mapping relation 2 and a mapping relation 3, wherein the mapping relation 1 comprises a corresponding relation between account participation 1-time virtual resource allocation and virtual resource numerical intervals [0,50], the mapping relation 2 comprises a corresponding relation between account participation 2-time virtual resource allocation and virtual resource numerical intervals [0,30], and the mapping relation 3 comprises a corresponding relation between account participation 3-time virtual resource allocation and virtual resource numerical intervals [0,10 ].
TABLE 1
In step 1032, a value is randomly selected from the obtained virtual resource value interval, and the selected value is determined as the number of virtual resources X M+1 that the target account can allocate when participating in the virtual resource allocation for the (m+1) -th time.
In step 104, a target account is allocated X M+1 of virtual resources.
As can be seen from the foregoing embodiments, in this embodiment, when receiving a virtual resource allocation request sent by a target account, virtual resources may be allocated to the target account according to a lower limit value N of the number of times that the virtual resource in one account needs to participate in virtual resource allocation when the virtual resource in the account may be converted into an actual resource, the number of times M that the target account has participated in virtual resource allocation, and a remaining duration T of a virtual resource allocation validity period, so that, as long as the virtual resource allocation validity period is within, a user has a chance to obtain the virtual resource when participating in allocation at any time, thereby improving resource allocation efficiency.
Fig. 2 is a flowchart of a resource processing method performed by a server according to another embodiment of the present invention, and as shown in fig. 2, the method may include the steps of: step 201, step 202, step 203, step 204, step 205, step 206 and step 207, wherein,
In step 201, when receiving a virtual resource allocation request sent by a target account for a target resource allocation event, a parameter N, the number of times M that the target account has participated in virtual resource allocation of the target resource allocation event, and a remaining duration T of a virtual resource allocation validity period of the target resource allocation event are obtained, where N is a lower limit value of the number of times that the target account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources.
In step 202, according to M, T and N, a probability P M+1 that the target account can be allocated to the virtual resource when participating in the allocation of the virtual resource for the (m+1) th time is calculated, and a random number S M+1 is allocated to the target account, where S M+1 is the random number corresponding to the target account when participating in the allocation of the virtual resource for the (m+1) th time, S M+1 e [0,1].
In step 203, if S M+1≤PM+1, the number of virtual resources X M+1 that the target account can allocate when participating in the virtual resource allocation for the (m+1) th time is determined.
In step 204, X M+1 of the virtual resources are allocated to the target account.
Steps 201 to 204 in the embodiment of the present invention are similar to steps 101 to 104 in the embodiment shown in fig. 1, and are not repeated here, and details are described in the embodiment shown in fig. 1.
In step 205, it is determined whether the number of times the target account has participated in the virtual resource allocation reaches N-1, and if so, the number of virtual resources X N that the target account can allocate when the N-th time of participated in the virtual resource allocation is calculated.
In the embodiment of the invention, whether the number of times that the target account has participated in virtual resource allocation reaches N-1 or not can be determined by comparing the sizes of M+1 and N-1, and if M+1=N-1, the number of times that the target account has participated in virtual resource allocation reaches N-1 is determined.
In the embodiment of the invention, one precondition that one account can enter the virtual resource to be converted into the actual resource stage from the virtual resource allocation stage is that: the number of times that the account participates in virtual resource allocation reaches N times, so that when the number of times that the target account participates in virtual resource allocation reaches N-1 times in the virtual resource allocation stage, whether the virtual resource can enter into the actual resource stage or not can be estimated when the target account participates in virtual resource allocation next time (namely, the Nth time).
In the embodiment of the invention, when the virtual resource can be converted into the actual resource stage when the target account is estimated to participate in the virtual resource allocation next time (namely, the nth time), the calculation mode of the number X N,XN of the virtual resources which can be allocated when the target account participates in the virtual resource allocation for the nth time can be firstly simulated and calculated and is similar to the calculation mode of X M+1; and then, the virtual resource quantity X 1,…,XM+1 (the virtual resource quantity actually distributed in the virtual resource distribution stage) distributed by the target account in the 1 st to M+1 th virtual resource distribution is summed with the virtual resource quantity X N (which is not distributed in practice) obtained by simulation calculation, and if the summation result reaches Y, the target account meets the two preconditions that the virtual resource is converted into the actual resource stage from the virtual resource distribution stage, namely, the target account has the qualification of entering the virtual resource into the actual resource stage after participating in N virtual resource distribution.
In step 206, if X 1+,…,+XM+1+XN is greater than or equal to Y, calculating the probability Z that the target account can convert the virtual resources obtained by allocation into actual resources after participating in N times of virtual resource allocation, and allocating a random number Q to the target account, wherein X i is the number of virtual resources allocated to the target account when participating in the virtual resource allocation for the ith time, i is greater than or equal to 1 and less than or equal to M+1, Y is the lower limit value of the number of virtual resources in the account when converting the virtual resources in the account into actual resources, and Q is the random number corresponding to the target account after participating in N times of virtual resource allocation; q.epsilon.0, 1.
In the embodiment of the invention, if M+1=N-1 and X 1+,…,+XM+1+XN is larger than or equal to Y, the target account is qualified to enter the stage of converting the virtual resource into the actual resource after participating in N times of virtual resource allocation. However, it should be noted that, it is not required that an account is qualified for the period of converting virtual resources into actual resources, but rather that the account is qualified for converting virtual resources in an account into actual resources, that is, after the account is in the period of converting virtual resources into actual resources, it is further required to determine whether the account is qualified for converting virtual resources in an account into actual resources.
In the embodiment of the invention, when determining whether an account is qualified for converting the virtual resource in the account into the actual resource, the determination can be made by calculating Z and comparing the sizes of Z and Q, and if Q is less than or equal to Z, the determination indicates that the account is qualified for converting the virtual resource in the account into the actual resource.
In the embodiment of the invention, the larger the value of Z, the larger the probability that Q falls into (0, Z) is, which indicates that the probability that the virtual resource distributed in the target account can be converted into the actual resource is also the larger.
In one embodiment of the present invention, the step 206 may specifically include the following steps (not shown in the figure): step 2061, and step 2062, wherein,
In step 2061, the number R of first level candidate accounts participating in the target resource allocation event and the budget investment total S of the actual resources are obtained; on the nth time of the target account participating in virtual resource allocation, the number of times that the first-stage candidate account has participated in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y.
In the embodiment of the invention, the first-level candidate account refers to an account which has the qualification of entering a stage of converting virtual resources into actual resources.
In step 2062, according to R, S and Y, the probability z=s/(r×y) that the target account may convert the allocated virtual resources into actual resources after N virtual resource allocations are engaged is calculated.
In step 207, if Q is less than or equal to Z, after the target account participates in N virtual resource allocations, the virtual resource allocated in the target account is converted into an actual resource.
In the embodiment of the invention, if Q is less than or equal to Z, the condition that the target account has the qualification of converting the virtual resources in the account into the actual resources is indicated, at the moment, how much virtual resources are obtained by the target account after the target account is actually involved in N times of virtual resource allocation is further calculated, and then the virtual resources obtained by the allocation in the account are converted into the actual resources.
In one embodiment of the present invention, the step 207 may specifically include the following steps (not shown in the figure): step 2071 and step 2072, wherein,
In step 2071, if X 1+,…,+XM+1+XN > Y, then Y- (X 1+,…,+XM+1) number of virtual resources are allocated to the target account when the target account actually participates in the N-th virtual resource allocation.
If X 1+,…,+XM+1+XN > Y, it indicates that if the virtual resource is allocated to the target account according to the estimated result (i.e., X N), the total amount of the virtual resource allocated after N allocation participants is greater than the lower limit value of the number of resources for converting the incoming virtual resource into the actual resource, in this case, the converted actual resource may exceed the budget investment total amount of the actual resource when the multiple accounts perform the resource conversion.
In view of the above problems, in the embodiment of the present invention, when a target user participates in nth virtual resource allocation, virtual resources are not allocated for a target account according to a prediction result (i.e., X N), but are allocated for a target account according to Y- (X 1+,…,+XM+1), so that virtual resources finally allocated for a single account are controlled to be within a certain range, and further converted actual resources are ensured to be within a certain range.
In step 2072, the virtual resources allocated by the target account are converted into actual resources.
In the embodiment of the invention, after the target account participates in N times of virtual resource allocation, the number of virtual resources allocated in the account is Y, and the virtual resources with the number of Y are converted into actual resources.
As can be seen from the foregoing embodiments, in this embodiment, when receiving a virtual resource allocation request sent by a target account, virtual resources may be allocated to the target account according to a lower limit value N of the number of times that the virtual resource in one account needs to participate in virtual resource allocation when the virtual resource in the account may be converted into an actual resource, the number of times M that the target account has participated in virtual resource allocation, and a remaining duration T of a virtual resource allocation validity period, so that, as long as the virtual resource allocation validity period is within, a user has a chance to obtain the virtual resource when participating in allocation at any time, thereby improving resource allocation efficiency. In addition, when the virtual resource in the target account is converted into the actual resource, the convertible actual resource can be ensured not to exceed the budget total investment of the actual resource.
In another embodiment provided by the present invention, virtual resource conversion exceeding the budget total amount can be intercepted to avoid exceeding the budget total amount of the actual resources, and at this time, the resource processing method in the embodiment of the present invention may further add the following steps based on the embodiment shown in fig. 2:
Determining a second level candidate account to participate in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in the virtual resource allocation; and if the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y, intercepting the virtual resource conversion exceeding Y.
In the embodiment of the invention, the second-level candidate account refers to an account which has the qualification of converting virtual resources in the account into actual resources.
For ease of understanding, accounts participating in a target resource allocation event will be described in connection with the scenario diagram shown in FIG. 3, wherein, as shown in FIG. 3, accounts 1 through D are full accounts participating in a virtual resource allocation phase of the target resource allocation event, accounts 1 through 4 are accounts eligible to enter a virtual resource phase to be an actual resource phase (i.e., first level candidate accounts), and accounts 1 through 3 are accounts eligible to be a virtual resource phase to be an actual resource phase (i.e., second level candidate accounts).
In a specific application scenario provided by the invention, the resource processing method provided by the invention can be applied to an APP operation scenario, in this case, the target resource allocation event can be an APP operation event, the virtual resource can be a virtual prize in the APP operation event, the virtual prize can comprise a red packet or an integral, the actual resource can be an actual prize in the APP operation event, and the actual prize can comprise cash or a real object.
In the embodiment of the present invention, the APP operation event may include two phases: a distribution stage and an extraction stage, wherein the distribution stage refers to a stage of a period of a allocable rewards, and in the stage, accounts participate in distributing the allocable rewards (namely virtual resources) which can be in the forms of points, red packets and the like, and other real objects or cash rewards (namely actual resources) can be exchanged when reaching a certain value, and the allocation stage is generally divided into a plurality of rounds; the extraction stage refers to another stage of the allocable rewards period, and the obtained rewards can be exchanged for real objects, cash and the like, and generally enter the extraction stage after being allocated for a plurality of times; the participation allocation means that when the account actively participates in the operation activity, a certain probability is obtained for rewarding allocation; acquiring rewards refers to judging that an account successfully acquires rewards through probability calculation after the account participates in distribution.
It can be seen that the resource processing method provided by the invention is applied to the APP operation scene, and the following effects can be achieved: in the operation period, the user has probability of obtaining rewards when participating in distribution at any time, so that the user perceives relative fairness; the extractable rewards do not exceed the budget limit; from the perspective of all users, the total rewarding value distributed by all users is far larger than the budget amount input, so that the limited economic input is amplified by a plurality of times, and the effect of user participation under operation is improved.
Fig. 4 is a schematic structural diagram of a resource processing device according to an embodiment of the present invention, which is applied to a server, as shown in fig. 4, the resource processing device 400 may include: a first acquisition module 401, a first calculation module 402, a first allocation module 403, a first determination module 404, and a second allocation module 405, wherein,
A first obtaining module 401, configured to obtain, when a virtual resource allocation request sent by a target account for a target resource allocation event is received, a parameter N, a number of times M that the target account has participated in virtual resource allocation of the target resource allocation event, and a remaining duration T of a virtual resource allocation validity period of the target resource allocation event, where N is a lower limit value of a number of times that the target account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources;
A first calculation module 402, configured to calculate, according to the M, T and N, a probability P M+1 that the target account may be allocated to a virtual resource when participating in virtual resource allocation for the (m+1) -th time;
a first allocation module 403, configured to allocate a random number S M+1 to the target account, where S M+1 is a random number corresponding to the target account when the m+1st time participates in virtual resource allocation, S M+1 e [0,1];
A first determining module 404, configured to determine, in the case of S M+1≤PM+1, a number of virtual resources X M+1 that the target account can allocate when participating in virtual resource allocation for the (m+1) -th time;
And a second allocation module 405, configured to allocate the virtual resources of the X M+1 number to the target account.
As can be seen from the foregoing embodiments, in this embodiment, when receiving a virtual resource allocation request sent by a target account, virtual resources may be allocated to the target account according to a lower limit value N of the number of times that the virtual resource in one account needs to participate in virtual resource allocation when the virtual resource in the account may be converted into an actual resource, the number of times M that the target account has participated in virtual resource allocation, and a remaining duration T of a virtual resource allocation validity period, so that, as long as the virtual resource allocation validity period is within, a user has a chance to obtain the virtual resource when participating in allocation at any time, thereby improving resource allocation efficiency.
Alternatively, as an embodiment, the first computing module 402 may include:
and the first calculation submodule is used for calculating the probability P M+1 = (N-M)/T that the target account can be allocated to the virtual resource when the M+1st time participates in the allocation of the virtual resource.
Optionally, as an embodiment, the first determining module 404 may include:
The first obtaining submodule is used for obtaining a virtual resource numerical value interval corresponding to the M+1th time of participation in virtual resource allocation of an account from a preset relation table under the condition of S M+1≤PM+1, wherein a plurality of mapping relations are recorded in the preset relation table, and each mapping relation comprises the corresponding relation between the number of times of participation in virtual resource allocation of the account and the virtual resource numerical value interval;
And the determining submodule is used for randomly selecting a value from the obtained virtual resource value interval and determining the selected value as the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation.
Optionally, as an embodiment, the resource processing device 400 may further include:
A second determining module, configured to determine, after the second allocating module 405 allocates the X M+1 number of virtual resources to the target account, whether the number of times that the target account has participated in virtual resource allocation reaches N-1;
The second calculation module is used for calculating the number X N of virtual resources which can be allocated to the target account when the N-th virtual resource allocation is participated in under the condition that the number of times of the target account which is participated in the virtual resource allocation reaches N-1;
The third calculation module is used for calculating the probability Z that the virtual resources obtained by allocation can be converted into actual resources after the target account participates in N times of virtual resource allocation under the condition that X 1+,…,+XM+1+XN is more than or equal to Y, wherein X i is the number of virtual resources allocated to the target account when the target account participates in the virtual resource allocation for the ith time, i is more than or equal to 1 and less than or equal to M+1, and Y is the lower limit value of the number of virtual resources in an account when the virtual resources in the account can be converted into actual resources;
The third allocation module is used for allocating a random number Q for the target account, wherein Q is a random number corresponding to the target account after participating in N times of virtual resource allocation, and Q epsilon [0,1];
and the conversion module is used for converting the virtual resources distributed in the target account into actual resources after the target account participates in N times of virtual resource distribution under the condition that Q is less than or equal to Z.
Optionally, as an embodiment, the third computing module may include:
The second acquisition submodule is used for acquiring the number R of the first-stage candidate accounts participating in the target resource allocation event and the budget investment total S of the actual resources under the condition that X 1+,…,+XM+1+XN is more than or equal to Y; on the day of the nth participation of the target account in virtual resource allocation, the number of times that the first-stage candidate account participates in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y;
And the second calculation sub-module is used for calculating the probability Z=S/(R×Y) that the target account can convert the allocated virtual resources into actual resources after participating in N times of virtual resource allocation according to R, S and Y.
Optionally, as an embodiment, the resource processing device 400 may further include:
A third determining module, configured to determine a second level candidate account participating in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in virtual resource allocation;
And the interception module is used for intercepting virtual resource conversion exceeding Y under the condition that the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y.
Alternatively, as an embodiment, the conversion module may include:
An allocation submodule, configured to allocate, when X 1+,…,+XM+1+XN > Y, a virtual resource of Y- (X 1+,…,+XM+1) number to the target account when the target account actually participates in nth virtual resource allocation;
And the conversion sub-module is used for converting the virtual resources distributed by the target account into actual resources.
Optionally, as an embodiment, the target resource allocation event is an APP operation event, the virtual resource is a virtual prize in the APP operation event, the virtual prize includes a red packet or a point, the actual resource is an actual prize in the APP operation event, and the actual prize includes cash or a real object.
For the device embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference is made to the description of the method embodiments for relevant points.
According to an embodiment of the present invention, there is also provided a server including: a memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor performs the steps of the resource processing method as described in any one of the embodiments above.
According to an embodiment of the present invention, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the resource processing method according to any of the embodiments described above.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
It will be apparent to those skilled in the art that embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the invention may take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or terminal device that comprises the element.
The above detailed description of the resource processing method, device, server and storage medium provided by the present invention applies specific examples to illustrate the principles and embodiments of the present invention, and the above examples are only used to help understand the method and core ideas of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.

Claims (14)

1. A method of resource processing, the method comprising:
When a virtual resource allocation request sent by a target account aiming at a target resource allocation event is received, acquiring a parameter N, the number of times M that the target account has participated in virtual resource allocation of the target resource allocation event and the remaining duration T of the virtual resource allocation validity period of the target resource allocation event, wherein N is the lower limit value of the number of times that the account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources;
According to M, T and N, calculating the probability that the target account can be allocated to the virtual resource when participating in virtual resource allocation for the M+1st time, namely, P M+1：PM+1 = (N-M)/T;
Distributing a random number S M+1 to the target account, wherein S M+1 is a random number corresponding to the target account when the M+1st time participates in virtual resource distribution, and S M+1 epsilon [0,1];
If S M+1≤PM+1, determining the number X M+1 of virtual resources which can be allocated to the target account when the M+1st time participates in virtual resource allocation; the virtual resource quantity X M+1 is a value randomly selected from a virtual resource value interval corresponding to the M+1st time of participation in virtual resource allocation obtained from a preset relation table;
allocating the X M+1 number of virtual resources for the target account;
Determining whether the number of times that the target account has participated in virtual resource allocation reaches N-1; if the number of times that the target account participates in virtual resource allocation reaches N-1, calculating the number X N of virtual resources which can be allocated to the target account when the target account participates in virtual resource allocation for the Nth time; if X 1+,…,+XM+1+XN is more than or equal to Y, judging that the target account can enter a stage of converting virtual resources into actual resources;
Calculating the probability Z that the target account can convert the virtual resources obtained by allocation into actual resources after participating in N times of virtual resource allocation, and allocating a random number Q to the target account, wherein X i is the number of virtual resources allocated to the target account when participating in the virtual resource allocation for the ith time, i is more than or equal to 1 and less than or equal to M+1, Y is the lower limit value of the number of virtual resources in the account when converting the virtual resources in the account into the actual resources, and Q is the random number corresponding to the target account after participating in N times of virtual resource allocation, and Q is E [0,1];
If Q is less than or equal to Z, judging that the target account has the qualification of converting virtual resources in the account into actual resources, and converting the virtual resources distributed in the target account into the actual resources after the target account participates in N times of virtual resource distribution;
The Nth virtual resource is allocated to the target account which has the qualification of converting the virtual resource in the account into the actual resource, so that the number of the virtual resources allocated in the target account is Y; and Y is the lower limit value of the number of the virtual resources in the account when the virtual resources in the account can be converted into the actual resources.
2. The method of claim 1, wherein the determining the number of virtual resources X M+1 that the target account can allocate when participating in the virtual resource allocation for the m+1st time comprises:
Obtaining a virtual resource value interval corresponding to the M+1th time of participation of the account in virtual resource allocation from a preset relation table, wherein a plurality of mapping relations are recorded in the preset relation table, and each mapping relation comprises the corresponding relation between the number of times of participation of the account in virtual resource allocation and the virtual resource value interval;
And randomly selecting a value from the obtained virtual resource value interval, and determining the selected value as the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation.
3. The method according to claim 1, wherein calculating the probability Z that the target account can convert the allocated virtual resource into an actual resource after participating in N virtual resource allocations includes:
Acquiring the number R of first-stage candidate accounts participating in the target resource allocation event and the budget investment total S of actual resources; on the day of the nth participation of the target account in virtual resource allocation, the number of times that the first-stage candidate account participates in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y;
According to R, S and Y, calculating the probability z=s/(r×y) that the target account can convert the virtual resource obtained by allocation into the actual resource after participating in N virtual resource allocations.
4. A method according to claim 3, characterized in that the method further comprises:
Determining a second level candidate account to participate in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in virtual resource allocation;
and if the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y, intercepting virtual resource conversion exceeding Y.
5. The method according to claim 1, wherein the converting the virtual resource allocated in the target account into the actual resource after the target account participates in N virtual resource allocations includes:
If X 1+,…,+XM+1+XN is more than Y, allocating Y- (X 1+,…,+XM+1) virtual resources for the target account when the target account actually participates in N-th virtual resource allocation;
and converting the virtual resources allocated to the target account into actual resources.
6. The method of any one of claims 1 to 5, wherein the target resource allocation event is an APP operation event, the virtual resource is a virtual prize in the APP operation event, the virtual prize comprises a red pack or a credit, the actual resource is an actual prize in the APP operation event, and the actual prize comprises cash or a physical object.
7. A resource processing apparatus, the apparatus comprising:
the first acquisition module is used for acquiring a parameter N, the number M of times that the target account has participated in virtual resource allocation of the target resource allocation event and the remaining duration T of the virtual resource allocation validity period of the target resource allocation event when receiving a virtual resource allocation request sent by the target account for the target resource allocation event, wherein N is a lower limit value of the number of times that the target account needs to participate in virtual resource allocation when virtual resources in the account can be converted into actual resources;
the first calculation module is configured to calculate, according to the M, T and N, a probability P M+1：PM+1 = (N-M)/T that the target account may be allocated to the virtual resource when the m+1st time participates in virtual resource allocation;
The first allocation module is configured to allocate a random number S M+1 to the target account, where S M+1 is a random number corresponding to the target account when the (m+1) -th time participates in virtual resource allocation, S M+1 e [0,1];
A first determining module, configured to determine, in the case of S M+1≤PM+1, a number of virtual resources X M+1 that the target account can allocate when participating in virtual resource allocation for the (m+1) -th time; the virtual resource quantity X M+1 is a value randomly selected from a virtual resource value interval corresponding to the M+1st time of participation in virtual resource allocation obtained from a preset relation table;
the second allocation module is used for allocating the virtual resources with the quantity of X M+1 to the target account;
The second determining module is used for determining whether the number of times that the target account has participated in virtual resource allocation reaches N-1 after the second allocating module allocates the X M+1 number of virtual resources for the target account;
The second calculation module is used for calculating the number X N of virtual resources which can be allocated to the target account when the N-th virtual resource allocation is participated in under the condition that the number of times of the target account which is participated in the virtual resource allocation reaches N-1;
the third calculation module is used for judging that the target account can enter a stage of converting virtual resources into actual resources under the condition that X 1+,…,+XM+1+XN is more than or equal to Y, and calculating the probability Z that the target account can convert the virtual resources obtained by allocation into the actual resources after participating in N times of virtual resource allocation, wherein X i is the number of virtual resources allocated to the target account when participating in the virtual resource allocation for the ith time, i is more than or equal to 1 and less than or equal to M+1, and Y is the lower limit value of the number of virtual resources in an account when converting the virtual resources in the account into the actual resources;
The third allocation module is used for allocating a random number Q for the target account, wherein Q is a random number corresponding to the target account after participating in N times of virtual resource allocation, and Q epsilon [0,1];
The conversion module is used for judging that the target account has the qualification of converting virtual resources in the account into actual resources under the condition that Q is less than or equal to Z, and converting the virtual resources distributed in the target account into the actual resources after the target account participates in N times of virtual resource distribution;
The fourth allocation module is used for allocating the Nth virtual resource to the target account which has the qualification of converting the virtual resource in the account into the actual resource, so that the number of the virtual resources allocated in the target account is Y; and Y is the lower limit value of the number of the virtual resources in the account when the virtual resources in the account can be converted into the actual resources.
8. The apparatus of claim 7, wherein the first determining module comprises:
The first obtaining submodule is used for obtaining a virtual resource numerical value interval corresponding to the M+1th time of participation in virtual resource allocation of an account from a preset relation table under the condition of S M+1≤PM+1, wherein a plurality of mapping relations are recorded in the preset relation table, and each mapping relation comprises the corresponding relation between the number of times of participation in virtual resource allocation of the account and the virtual resource numerical value interval;
And the determining submodule is used for randomly selecting a value from the obtained virtual resource value interval and determining the selected value as the number X M+1 of the virtual resources which can be allocated to the target account when the M+1st time participates in the virtual resource allocation.
9. The apparatus of claim 7, wherein the third computing module comprises:
The second acquisition submodule is used for acquiring the number R of the first-stage candidate accounts participating in the target resource allocation event and the budget investment total S of the actual resources under the condition that X 1+,…,+XM+1+XN is more than or equal to Y; on the day of the nth participation of the target account in virtual resource allocation, the number of times that the first-stage candidate account participates in virtual resource allocation reaches N, and the number of virtual resources obtained by allocation reaches Y;
And the second calculation sub-module is used for calculating the probability Z=S/(R×Y) that the target account can convert the allocated virtual resources into actual resources after participating in N times of virtual resource allocation according to R, S and Y.
10. The apparatus of claim 9, wherein the apparatus further comprises:
A third determining module, configured to determine a second level candidate account participating in the target resource allocation event; the second-level candidate account is an account which can convert the virtual resource into the actual resource on the nth time of the target account participating in virtual resource allocation;
And the interception module is used for intercepting virtual resource conversion exceeding Y under the condition that the actual resources corresponding to the virtual resource sum of the second-stage candidate accounts exceed Y.
11. The apparatus of claim 7, wherein the conversion module comprises:
An allocation submodule, configured to allocate, when X 1+,…,+XM+1+XN > Y, a virtual resource of Y- (X 1+,…,+XM+1) number to the target account when the target account actually participates in nth virtual resource allocation;
And the conversion sub-module is used for converting the virtual resources distributed by the target account into actual resources.
12. The apparatus of any one of claims 7 to 11, wherein the target resource allocation event is an APP operation event, the virtual resource is a virtual prize in the APP operation event, the virtual prize comprises a red pack or a credit, the actual resource is an actual prize in the APP operation event, and the actual prize comprises cash or a physical object.
13. A server, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor, implements the steps of the resource processing method according to any of claims 1 to 6.
14. A computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, implements the steps of the resource processing method according to any of claims 1 to 6.
CN202010307404.0A 2020-04-17 2020-04-17 Resource processing method, device, server and storage medium Active CN111612520B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010307404.0A CN111612520B (en) 2020-04-17 2020-04-17 Resource processing method, device, server and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010307404.0A CN111612520B (en) 2020-04-17 2020-04-17 Resource processing method, device, server and storage medium

Publications (2)

Publication Number Publication Date
CN111612520A CN111612520A (en) 2020-09-01
CN111612520B true CN111612520B (en) 2024-07-05

Family

ID=72199642

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010307404.0A Active CN111612520B (en) 2020-04-17 2020-04-17 Resource processing method, device, server and storage medium

Country Status (1)

Country Link
CN (1) CN111612520B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112508641A (en) * 2020-12-01 2021-03-16 数字广东网络建设有限公司 Method and device for distributing articles, computer equipment and storage medium
CN116431347B (en) * 2023-04-14 2024-03-26 北京达佳互联信息技术有限公司 Method, device, electronic equipment and storage medium for resource processing

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109615434A (en) * 2018-12-14 2019-04-12 中国平安人寿保险股份有限公司 A kind of method, apparatus, electronic equipment and storage medium promoting user activity

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140279320A1 (en) * 2013-03-15 2014-09-18 Bracket Computing, Inc. Allocating and pricing virtual resources
CN105511959B (en) * 2014-10-16 2021-03-19 腾讯科技（深圳）有限公司 Virtual resource allocation method and device
CN105577722B (en) * 2014-10-16 2020-12-18 腾讯科技（深圳）有限公司 Point exchange method and device
CN107302488B (en) * 2016-04-14 2021-07-09 创新先进技术有限公司 Virtual article distribution method, system and server
CN109034892B (en) * 2018-07-19 2023-04-25 腾讯科技（深圳）有限公司 Resource allocation method, device, computer readable storage medium and computer equipment
CN109544209A (en) * 2018-10-22 2019-03-29 中国平安人寿保险股份有限公司 Virtual interests bonusing method, device and computer equipment and storage medium
CN110175860B (en) * 2019-04-09 2023-06-23 创新先进技术有限公司 Virtual resource allocation method and device
CN110599323B (en) * 2019-09-24 2024-02-20 腾讯科技（深圳）有限公司 Resource processing method and processing equipment

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109615434A (en) * 2018-12-14 2019-04-12 中国平安人寿保险股份有限公司 A kind of method, apparatus, electronic equipment and storage medium promoting user activity

Also Published As

Publication number Publication date
CN111612520A (en) 2020-09-01

Similar Documents

Publication Publication Date Title
CN111612520B (en) Resource processing method, device, server and storage medium
CN108268317B (en) Resource allocation method and device
CN103699445A (en) Task scheduling method, device and system
CN107026900B (en) Shooting task allocation method and device
CN108154298B (en) Distribution task allocation method and device, electronic equipment and computer storage medium
CN107360117B (en) Data processing method, device and system
CN110636388A (en) Service request distribution method, system, electronic equipment and storage medium
CN110233866B (en) Load balancing method and load balancer
CN108520329B (en) Accurate automatic allocation method and device for second-hand house clients based on broker portrait
CN111539613A (en) Case distribution method and device
CN113347249B (en) Operation loading method, device and equipment
CN111769984B (en) Method for adding nodes in block chain network and block chain system
CN111988388B (en) Flow distribution method, device, electronic equipment and storage medium
CN111951000A (en) Payment request processing method and device
CN111401772A (en) Customer service request distribution method, device and equipment
CN111651274A (en) Business distribution method based on micro-service architecture and related device
CN111124672A (en) Data distribution method based on Redis cluster and related equipment
CN110807578A (en) Service order distribution method and device
CN116150067A (en) Bandwidth adjustment method, device, electronic equipment and storage medium
CN115586957A (en) Task scheduling system, method and device and electronic equipment
CN109636389A (en) Block chain goes out determination method, apparatus, equipment and the storage medium of block time
CN106920083B (en) Service implementation method, payment method and device
CN116248907A (en) Method for determining exposure room and related equipment
CN114153399B (en) Data storage method, device, control device and medium of storage system
CN117130784A (en) Resource allocation method, device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant