CN110688215A - Virtual resource allocation method, server, and computer-readable storage medium - Google Patents
Virtual resource allocation method, server, and computer-readable storage medium Download PDFInfo
- Publication number
- CN110688215A CN110688215A CN201910784332.6A CN201910784332A CN110688215A CN 110688215 A CN110688215 A CN 110688215A CN 201910784332 A CN201910784332 A CN 201910784332A CN 110688215 A CN110688215 A CN 110688215A
- Authority
- CN
- China
- Prior art keywords
- user
- information
- similarity
- quota
- virtual 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000004044 response Effects 0.000 claims description 15
- 238000012163 sequencing technique Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims 1
- 238000004891 communication Methods 0.000 abstract description 4
- 230000003993 interaction Effects 0.000 description 5
- 230000000977 initiatory effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000002349 favourable effect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000006872 improvement Effects 0.000 description 3
- 239000003999 initiator Substances 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 240000007817 Olea europaea Species 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
Abstract
The embodiment of the invention relates to the technical field of communication, and discloses a virtual resource allocation method, a server and a computer readable storage medium. In the present invention, the method for allocating virtual resources includes: when receiving the distribution information of the virtual resources sent by a first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located; acquiring information of a third user corresponding to a third user responding to the pickup information in each second user; acquiring the similarity between a first user and a third user according to the information of the first user and the information of the third user corresponding to the first user; and distributing the quota of the virtual resources drawn by the third user according to the acquired similarity, so that the personalized distribution of the virtual resources can be realized.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a virtual resource allocation method, a server, and a computer-readable storage medium.
Background
Along with the popularization of internet consumption, the electronic red packet replaces the traditional physical red packet in many fields to become an important communication tool among users, and the users can increase communication and interaction among each other through the red packet.
However, the inventors found that at least the following problems exist in the related art: under the scene of multi-user red packet robbing, there are two situations, namely, the amounts of the red packets robbed by a plurality of users are the same, or the amounts of the red packets robbed by each user are completely random, so that the individual distribution of the red packets is difficult to realize.
Disclosure of Invention
An object of embodiments of the present invention is to provide a method, a server, and a computer-readable storage medium for allocating virtual resources, so that personalized allocation of virtual resources can be achieved.
In order to solve the above technical problem, an embodiment of the present invention provides a method for allocating virtual resources, including: when receiving the distribution information of the virtual resources sent by a first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located; acquiring information of a third user corresponding to a third user responding to the pickup information in each second user; acquiring the similarity between a first user and a third user according to the information of the first user and the information of the third user corresponding to the first user; and distributing the quota of the virtual resources drawn by the third user according to the acquired similarity.
An embodiment of the present invention further provides a server, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the above-described method of allocating virtual resources.
The embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program, wherein the computer program is configured to implement the above-mentioned virtual resource allocation method when executed by a processor.
Compared with the prior art, the embodiment of the invention sends the pickup information of the virtual resources to each second user end in the current group where the first user end is located when receiving the distribution information of the virtual resources sent by the first user end, so that each second user corresponding to each second user end can check the pickup information of the virtual resources. And acquiring information of a third user corresponding to the third user responding to the pickup information in each second user, so that the information of the third user responding to the pickup information in all the second users capable of viewing the pickup information of the virtual resources can be acquired. And according to the information of the first user and the information of the third user corresponding to the first user side, acquiring the similarity between the first user and the third user, wherein the acquired similarity is favorable for well representing the correlation degree between the user sending the virtual resources and the user receiving the virtual resources. And allocating the quota of the virtual resource acquired by the third user according to the acquired similarity, namely the quota of the virtual resource allocated by the third user depends on the similarity between the third user and the first user, so that the invisible contact between the users is favorably and fully utilized, and the personalized allocation of the virtual resource sent by the first user is realized.
In addition, the obtaining the similarity between the first user and the third user according to the information of the first user and the information of the third user corresponding to the first user includes: acquiring the similarity between the first user and the third user according to any one or combination of the following items: and the access time overlapping rate, the preference overlapping rate and the geographic distance of the first user and the third user are close to each other. The method and the device provide different dimensions which can well represent the similarity between the users, namely the time overlapping rate, the preference overlapping rate and the geographic distance similarity degree, and are beneficial to accurately acquiring the similarity between the first user and the third user.
In addition, the similarity between the first user and the third user is obtained through the following formula:
s(u,v)＝δD*D(u,v)+δT*T(u,v)+δG*G(u,v)
wherein s (u, v) is a similarity between the first user and the third user, D (u, v) is a similarity between geographic distances of the first user and the third user, T (u, v) is an access time overlapping rate of the first user and the third user, G (u, v) is a preference overlapping rate of the first user and the third user, and δD+δT+δGN, which is the number of second ues in the current group. The specific calculation formula of the similarity between the first user and the third user is provided, and the similarity between the first user and the third user can be conveniently and accurately obtained.
In addition, the geographic distance D (u, v) between the first user and the third user is specifically obtained by the following formula:
wherein L (u, v) is a geographic distance between the first user and the third user, LmaxAnd respectively obtaining the maximum distance between the n second users corresponding to the n second user terminals and the n geographic distances of the first user. A calculation formula of the geographic distance similarity degree is provided, and the geographic distance similarity degree of the first user and the third user is conveniently and accurately measured.
In addition, after the obtaining of the information of the third user corresponding to the third user responding to the pickup information in each of the second users, the method further includes: according to the sequence of the response time of the pickup information, sequencing all third users responding to the pickup information; wherein, the more advanced the response time, the more advanced the ranking; the allocating the quota of the virtual resources drawn by the third user according to the obtained similarity specifically comprises: and sequentially distributing the acquired quota of the virtual resources to each third user after sequencing according to the acquired similarity. And the virtual resources to be picked up are sequentially distributed to the third users according to the sequence of the response time, so that the enthusiasm of the users in responding to the picked-up information is favorably improved.
In addition, the allocating the quota of the virtual resource that each third user draws in turn according to the obtained similarity, the single resource quota and the remaining quota of the current virtual resource specifically comprises: calculating the quota of the virtual resources acquired by each third user through the following formula:
wherein s (u, v) is a similarity between the first user and the third user, and the s (u, v) is a similarity between the first user and the third user
Is the single resource limit, the
To pair the
And rounding the calculation result, wherein w is the residual amount of the current virtual resource, and M is the total amount of the virtual resource. The method provides a specific formula for calculating the quota of the virtual resource received by each third user, and is favorable for reasonably distributing the quota of the virtual resource received by each third user according to the similarity between each third user and the first user, the quota of the single resource and the residual quota of the current virtual resource.
In addition, the current group where the first user terminal is located is: in the live broadcast room to which the first user terminal is currently connected, each second user terminal in the current group is: and currently connecting each user side of the live broadcast room. That is to say, the first user can send the pickup information of the virtual resource in the live broadcast room through the first user side, and each second user side connected with the live broadcast room can receive the pickup information, so that the user watching the live broadcast in the live broadcast room can interact by sending the pickup information of the virtual resource, the atmosphere of the live broadcast room is activated, and the user can be used as an initiator of the pickup information of the virtual resource, and the social participation degree of the user is favorably improved.
In addition, after the allocating the quota of the virtual resource retrieved by the third user, the method further includes: and sending push information to the first user side and/or the third user side so that a user corresponding to the user side receiving the push information selects whether to add a friend or not according to the push information, wherein the push information comprises information of a third user getting the virtual resource. The method for adding the friends through the sending and receiving of the virtual resources is provided, and the use experience of the user is improved.
Drawings
One or more embodiments are illustrated by the corresponding figures in the drawings, which are not meant to be limiting.
Fig. 1 is a flowchart of an allocation method of virtual resources according to a first embodiment of the present invention;
fig. 2 is a flowchart of an allocation method of virtual resources according to a second embodiment of the present invention;
fig. 3 is a flowchart of an allocation method of virtual resources according to a third embodiment of the present invention;
fig. 4 is a schematic configuration diagram of a server according to a fourth embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present invention, and the embodiments may be mutually incorporated and referred to without contradiction.
The first embodiment of the invention relates to a virtual resource allocation method, which is applied to a server. The virtual resource can be an electronic red envelope, a gift, a coupon and the like which present the virtual existence of others. The following describes implementation details of the virtual resource allocation method according to the present embodiment in detail, and the following is only provided for easy understanding and is not necessary for implementing the present embodiment.
A flowchart of a virtual resource allocation method in this embodiment may be as shown in fig. 1, and specifically includes:
step 101: and when receiving the distribution information of the virtual resources sent by the first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located.
The first user side, the second user side, and the third user side mentioned in step 102 may be terminal devices such as a mobile phone and a tablet computer. The first user side may correspond to a first user, for example, the first user side may be a mobile phone used by the first user, a similar second user side corresponds to a second user, and a third user side corresponds to a third user. Specifically, the first user side is a user side that sends allocation information of the virtual resource, for example, a mobile phone used by the first user that sends the electronic red packet. The second user side is a user side in the current group where the first user side is located, for example, the second user side can be a mobile phone used by a second user in the current group who has an opportunity to receive the electronic red packet sent by the mobile phone of the first user.
In addition, the current group may be a group formed by the user terminals currently connected to the same server. In an example, the server may be a qq platform or a wechat platform, the current group may be a qq group or a wechat group where a first user sending the electronic red packet is located, and each second user in the current group is a user corresponding to each second user in the qq group or the wechat group. In another example, the server may be a live broadcast platform, the current group may be a live broadcast room to which the first user terminal is connected, and the second user terminals are the user terminals connected to the live broadcast room. It can be understood that the first user terminal initiates an electronic red packet for one of the second user terminals in the current group. In the present embodiment, the current group is only qq group, wechat group, and live broadcast room, but the present invention is not limited to this.
Specifically, step 101 may be understood as that the first user uses the first user to send the distribution information of the electronic red packet to the server, and after receiving the distribution information of the electronic red packet, the server sends the pickup information of the electronic red packet to each second user in the current group where the first user is located. In one example, the current group is a wechat group, and step 101 may be understood that a user in the wechat group sends a group red packet in the wechat group, and all people in the wechat group can check the pickup information of the electronic red packet through their own mobile phones. In another example, the current group is a live broadcast room, and step 101 may be understood that a user in the live broadcast room sends a red envelope available for multiple people to pick up in the live broadcast room, and all users watching the live broadcast in the live broadcast room can check the pick-up information of the red envelope through their own mobile phones. In a specific implementation, a first user can call an electronic red packet sending page through an electronic red packet sending entry, the amount of red packets, the time duration for red packet robbing and the like are set in the sending page, then the pickup information of the electronic red packets is sent to each second user end in a current group where the first user end is located, and each second user can grab the red packets within the valid period of the electronic red packets, namely the time duration for red packet robbing. It should be noted that the above examples are merely illustrative for easy understanding, and do not limit the technical solutions of the present invention.
Step 102: and acquiring information of a third user corresponding to a third user end responding to the obtained information in each second user end.
Specifically, the third user end responding to the information pickup can be understood as a user end used by the user who robs the red envelope, such as a mobile phone used by the user who robs the red envelope, that is, the user end which robs the red envelope in each second user end is called the third user end. In a specific implementation, after sending the pickup information of the electronic red packet to each second user end, the server may detect whether each second user end responds to the pickup information, for example, may detect whether an icon of the electronic red packet displayed on a screen of each second user end is clicked, and use the user end with the clicked icon of the electronic red packet in each second user end as a third user end responding to the pickup information, so that the server may obtain information of a third user corresponding to the third user end.
The information of the third user may be the age, sex, geographical location, visit time, preference information, etc. of the third user. To facilitate understanding of the information of the third user, the following takes the third user as a user in the live broadcast room as an example, and specifically describes the information of the user: the age of the third user may be a real age used by the user when registering the live broadcasting platform where the live broadcasting room is located, or may be a registered age of the user, and the registered age may be counted from a time when the user registers the live broadcasting platform. The gender of the third user may also be obtained from registration information of the user when registering the live platform. The geographical location of the third user may be obtained by a positioning function in the third user terminal used by the third user. The access time of the third user may be a common time period for the user to access the live broadcast room, that is, enter the live broadcast room to watch live broadcast, and it can be understood that the live broadcast platform, that is, the server, may record the watching browsing record of the third user, so as to obtain the access time according to the watching browsing record. The preference information of the third user may be live content that the user pays attention to, is interested in, and is watched frequently, and may be specifically obtained by analyzing, by the server, the viewing browsing record.
Step 103: and acquiring the similarity between the first user and the third user according to the information of the first user and the information of the third user corresponding to the first user.
Specifically, the information of the first user corresponding to the first user is obtained in a manner similar to that of the information of the third user, and is not repeated here to avoid repetition. The following describes the obtaining of the similarity between the first user and the third user:
in one example, the similarity between the first user and the third user may be obtained according to any one or a combination of the following: the access time overlapping rate, the preference overlapping rate and the geographic distance of the first user and the third user are close.
The access time overlapping rate may be an overlapping rate of common access time periods of the first user and the third user, and may be specifically calculated by the following formula:
wherein T (u, v) is the access time overlapping rate of the first user u and the third user v, TiIs the common access time period, t, of the first user ujIs the common access period for the third user v.
The preference overlapping rate may be a preference cosine similarity between the first user and the third user, and the cosine similarity may be calculated by: the fondness of the users is taken as a point in an n-dimensional coordinate system, a straight line (vector) is formed by connecting the point with the origin of the coordinate system, the similarity value between the two users is the cosine value of the included angle between the two straight lines (vectors), the smaller the included angle is, the more similar the two users are, and the larger the included angle is, the smaller the similarity of the two users is.
The geographic distance closeness can be calculated by the following formula:
wherein D (u, v) is the geographic distance between the first user u and the third user v, L (u, v) is the geographic distance between the first user and the third user,Lmaxthe maximum distance between the n second users corresponding to the n second user terminals and the n geographic distances of the first user is respectively, where n is the number of the second user terminals in the current group, for example, n may be the number of users currently watching a live broadcast in a live broadcast room. It is understood that the larger D (u, v) represents the closer the geographical distance between the first user u and the third user v, the higher the similarity between the first user u and the third user v can be considered.
It should be noted that, in this embodiment, only three user dimensions, that is, a time overlapping rate, a preference overlapping rate, and a geographic distance proximity degree, are provided for measuring the similarity between users, but the user dimensions that can be used for measuring the similarity between users in a specific implementation are not limited to the three user dimensions. For example, the similarity between the users can also be measured by the sizes of the age gaps of the first user and the third user, and it can be understood that the larger the age gap is, the smaller the similarity between the users is, and the smaller the age gap is, the greater the similarity between the users is. In addition, the gender information of the first user and the third user can be used as a user dimension for measuring the similarity between the users. According to actual needs, the similarity between users of the same gender may be set to be high, and the similarity between users of different genders may also be set to be high, which is not specifically limited in this embodiment. In another example, the similarity between the first user and the third user may be calculated directly according to the following formula:
s(u，v)＝δD*D(u，v)+δT*T(u，v)+δG*G(u，v)
wherein s (u, v) is the similarity between the first user u and the third user v, D (u, v) is the geographic distance similarity between the first user u and the third user v, T (u, v) is the access time overlapping rate of the first user u and the third user v, G (u, v) is the preference overlapping rate of the first user u and the third user v, and deltaD、δT、δGAre the coefficients of D (u, v), T (u, v), G (u, v), respectively, and δD+δT+δG＝n，δD、δT、δGThe respective sizes can be carried out according to actual needsIt is set that this embodiment is not specifically limited to this, and n is the number of second ues in the current group. It should be noted that, in the present embodiment, the similarity is calculated by the above formula as an example, but the formula for calculating the similarity in a specific implementation is not limited thereto.
Taking an application scenario of initiating an electronic red envelope in a live broadcast room as an example, step 103 may be understood as that the first user initiates the electronic red envelope in the live broadcast room by using the first terminal, and the server obtains similarities between the first user and each third user who receives the electronic red envelope.
Step 104: and distributing the quota of the virtual resources drawn by the third user according to the acquired similarity.
Specifically, the server may allocate the obtained quota of the virtual resource to each third user according to the total quota of the virtual resource and the obtained similarity between the first user and each third user when the first user sends the allocation information of the virtual resource. When the server allocates the quota of the virtual resource, the server may allocate a relatively high quota of the virtual resource to a third user with high similarity to the first user, and allocate a relatively low quota of the virtual resource to a third user with low similarity to the first user.
Also taking an application scenario of initiating an electronic red envelope in a live broadcast as an example, step 104 can be understood as: and the server allocates the fetched money of the red envelope for each third user according to the similarity between each third user getting the red envelope and the first user sending the red envelope in the live broadcast room, wherein the money of the red envelope allocated by the third user with high similarity is relatively more, and the money of the red envelope allocated by the third user with low similarity is relatively less. After the distribution is finished, the amount of money on the account corresponding to the first user sending the red packet is reduced, and the amount of money on the account corresponding to the third user distributed to the amount of money in the live broadcast room is increased.
It can be understood that the red packet ending situation can be divided into two types: one is that the total amount of the red envelope issued by the user is used up. The other is that the time for robbing the red packet is limited, for example, when the user sends the red packet, the time duration for robbing the red packet is set to t seconds, then the user can rob the red packet within t seconds after the red packet is sent out, otherwise, the red packet is expired. In addition, the overdue red envelope can be provided with a color identifier, the red envelope robbing user can not click to robbe the red envelope, and the residual unallocated money in the red envelope can be returned to the user account with the red envelope.
The above examples in the present embodiment are only for convenience of understanding, and do not limit the technical aspects of the present invention.
Compared with the prior art, in the embodiment, when receiving the allocation information of the virtual resource sent by the first user, the virtual resource pickup information is sent to each second user in the current group where the first user is located, so that each second user corresponding to each second user can view the virtual resource pickup information. And acquiring information of a third user corresponding to the third user responding to the pickup information in each second user, so that the information of the third user responding to the pickup information in all the second users capable of viewing the pickup information of the virtual resources can be acquired. And according to the information of the first user and the information of the third user corresponding to the first user side, acquiring the similarity between the first user and the third user, wherein the acquired similarity is favorable for well representing the correlation degree between the user sending the virtual resources and the user receiving the virtual resources. And allocating the quota of the virtual resource acquired by the third user according to the acquired similarity, namely the quota of the virtual resource allocated by the third user depends on the similarity between the third user and the first user, so that the invisible contact between the users is favorably and fully utilized, and the personalized allocation of the virtual resource sent by the first user is realized.
A second embodiment of the present invention relates to a method for allocating virtual resources, and is a further improvement of the first embodiment, and the main improvement is that: after the information of the third user corresponding to the third user responding to the pickup information in each second user is acquired, the method further comprises the following steps: according to the sequence of the response time of the pickup information, sequencing all third users responding to the pickup information; according to the obtained similarity, the allocation of the quota of the virtual resource picked up by the third user is specifically as follows: and sequentially distributing the acquired quota of the virtual resources to each third user after sequencing according to the acquired similarity. The following describes implementation details of the virtual resource allocation method according to the present embodiment in detail, and the following is only provided for easy understanding and is not necessary for implementing the present embodiment.
A flowchart of the virtual resource allocation method in this embodiment may be as shown in fig. 2, and specifically includes:
step 201: and when receiving the distribution information of the virtual resources sent by the first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located.
Step 202: and acquiring information of a third user corresponding to a third user end responding to the obtained information in each second user end.
Step 203: and acquiring the similarity between the first user and the third user according to the information of the first user and the information of the third user corresponding to the first user.
It should be noted that steps 201 to 203 are substantially the same as steps 101 to 103 in the first embodiment, and are not repeated here to avoid repetition.
Step 204: and sequencing all the third users responding to the pickup information according to the sequence of the response time of the pickup information.
Specifically, the server may obtain response time of each third user to the pickup information, for example, when the third user clicks an icon of an electronic red packet displayed on a screen of the third user, record the time of the click, and use the recorded time of the click as the response time of the third user to the pickup information. And then, sequencing all the third users according to the recorded sequence of the response time of all the third users, wherein the earlier the response time is, the earlier the sequencing is.
It should be noted that, in the embodiment, the execution sequence of step 203 and step 204 is only an example of executing step 203 and then executing step 204, and in a specific implementation, step 204 and then executing step 203 may also be executed, which is not limited in the embodiment.
Step 205: and sequentially distributing the acquired quota of the virtual resources to each third user after sequencing according to the acquired similarity.
Specifically, before allocating the obtained virtual resource amount to each third user in sequence, the single resource amount may be obtained according to the total amount of the virtual resources and the number of the second user terminals in the current group. In one example, assuming that the total amount of virtual resources is M and the number of second clients is n, the single resource amount may be represented as M × 1/n. And then, sequentially distributing the virtual resource limit acquired by each third user according to the acquired similarity, the single resource limit and the remaining limit of the current virtual resource. The remaining amount of the current virtual resource may be understood as the amount remaining after the allocated amount is subtracted from the total amount of the virtual resource every time the amount of the virtual resource retrieved by the third user is allocated.
In one example, the quota of the virtual resource drawn by each third user is sequentially allocated according to the obtained similarity, the quota of the single resource and the remaining quota of the current virtual resource, and the quota of the virtual resource drawn by each third user can be calculated by the following formula:
wherein s (u, v) is the similarity between the first user u and the third user v,
is the amount of a single resource,
is a pair of
And (4) rounding the calculation result, wherein w is the residual amount of the current virtual resource, and M is the total amount of the virtual resource. It will be understood that the above formula is used when calculating the quota of the virtual resource drawn by the first ranked third subscriber
If the calculated amount of the virtual resource taken by the third subscriber ranked first is P, then when the amount of the virtual resource taken by the third subscriber ranked second is calculated, the amount of the virtual resource taken by the third subscriber ranked second is calculated in the above formula, and then the amounts of the virtual resources taken by the other third subscribers are calculated in sequence in the above manner.
To further facilitate understanding of the embodiment, the following description specifically illustrates an application scenario of initiating an electronic red envelope in a live broadcast room as an example: the first user can set the total amount of money for sending the red packet when initiating the red packet in the live broadcast room and limit the time for robbing the red packet. And if the set total amount of the red packages is M and the limited time for grabbing the red packages is t seconds, M is correspondingly subtracted from the account corresponding to the first user. The server performs red packet distribution on line according to the situation that the user in the live broadcast room snatches the red packet within t seconds, and the distribution process can be as follows: firstly, acquiring the total number n of current live broadcast watching users at the moment of red packet sending; secondly, calculating the quota of the single red packet as M x 1/n; then, according to the response time of the user for grabbing the red packet, the users are sorted, the sorting sequence number at the front of the response time is small, and the sorting sequence number at the back of the response time is large; then, the money amount of the red packet distributed by each user is calculated in sequence according to the sequence number of the users who rob the red packet from small to large, and the money amount of the red packet is distributed as
And updating the current balance of the red envelope every time the red envelope amount received by one user is distributed, and then calculating the red envelope amount distributed by the next user. And by analogy, calculating the amount of money allocated by all the users who rob the red envelope.
Compared with the prior art, in the present embodiment. And the virtual resources to be picked up are sequentially distributed to the third users according to the sequence of the response time, so that the enthusiasm of the users in responding to the picked-up information is favorably improved. And a specific formula for calculating the quota of the virtual resource drawn by each third user is provided, which is beneficial to reasonably distributing the quota of the virtual resource drawn by each third user according to the similarity between each third user and the first user, the quota of the single resource and the residual quota of the current virtual resource.
A third embodiment of the present invention relates to a method for allocating virtual resources, which is a further improvement of the first embodiment, and the method is mainly characterized by including, after allocating an amount of virtual resources to be taken by a third user: and sending push information to the first user side and/or the third user side so that the user corresponding to the user side receiving the push information can select whether to add the friend or not according to the push information. The following describes implementation details of the virtual resource allocation method according to the present embodiment in detail, and the following is only provided for easy understanding and is not necessary for implementing the present embodiment.
A flowchart of the virtual resource allocation method in this embodiment may be as shown in fig. 3, and specifically includes:
step 301: and when receiving the distribution information of the virtual resources sent by the first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located.
Step 302: and acquiring information of a third user corresponding to a third user end responding to the obtained information in each second user end.
Step 303: and acquiring the similarity between the first user and the third user according to the information of the first user and the information of the third user corresponding to the first user.
Step 304: and distributing the quota of the virtual resources drawn by the third user according to the acquired similarity.
It should be noted that steps 101 to 104 are substantially the same as steps 101 to 104 in the first embodiment, and are not repeated here to avoid repetition.
Step 305: and sending the push information to the first user end and/or the third user end.
Specifically, the push information sent by the server to the first user side and/or the third user side may include information of a third user who obtains the virtual resource, and may further include a quota of the virtual resource obtained by the third user. After the first user and/or the third user check the push information, whether a certain user in the push information is added as a friend can be selected, and whether attention is added or whether instant chat is started, resources are shared and the like can be determined.
In an example, it may be understood that, in order to enable the user who robs the red envelope to have an opportunity to actively pay attention to the state of the user who robs the red envelope or add a friend, the user who robs the red envelope may also actively pay attention to the state of the user who robs the red envelope or add a friend. In addition, before the red packet is sent, the user who sends the red packet can also set whether to automatically receive the attention of the user who robs the red packet, add friends and the like.
For convenience of understanding, the following specific description takes an example that a user sends a red packet in the live broadcast watching process and establishes an application scene for contacting an added friend:
when a user enters the live broadcast platform, the live broadcast platform allocates a unique ID for each user, and the user can perform operations such as recharging on an account corresponding to the live broadcast platform. The user can select to enter a certain live broadcast room on the live broadcast platform to watch live broadcast content, the live broadcast platform can distribute live broadcast codes and live broadcast stream addresses for each live broadcast room, and can record user IDs of live broadcast content currently watched in the live broadcast rooms, wherein the live broadcast codes are unique to each live broadcast room. Each live broadcast room corresponds to a user queue, and the user queue is composed of users watching live broadcast contents in the live broadcast room currently.
Suppose that a user 1 watching in a live broadcast room A initiates a red envelope event, each user in a user queue A corresponding to the live broadcast room A can rob a red envelope in the live broadcast room A, and a server distributes the amount of the red envelope taken by the user who robs the red envelope according to the similarity between the user who robs the red envelope and the user who sends the red envelope. Then, through the page of the red packet, the user ID of the red packet can be displayed to the red packet and all the users who rob the red packet; assuming that the user 2 robs the red envelope, the user 2 can check all users rob the red envelope and the amount of money, the user 2 can click the name of a certain user 3 who also robs the red envelope, pop up an interface which applies for the user 3 as a friend, the user 2 fills in application information, and sends the request to a user side corresponding to the user 3 after clicking 'sending'. Similarly, the same operation can be performed on the page of the red envelope robbed by the user with the red envelope, and all the users robbing the red envelope can apply for adding friends by selecting one key and adding friends. In addition, before the red envelope sending user sends the red envelope, it may be further set that when the amount of the red envelope robbed by the red envelope robbing user is greater than a certain preset threshold, the red envelope robbing user may automatically add the user as a friend, where the preset threshold may be set according to actual needs, and this embodiment is not specifically limited thereto.
The above scenario in the present embodiment is illustrated for convenience of understanding, and does not limit the technical solution of the present invention.
At present, most of interaction of live broadcast platforms is carried out in modes of barrage, message leaving and the like, however, interaction of the barrage and the message is carried out in a text mode, and interaction efficiency is low. Although the live platform itself will also interact with the user in a red envelope-emitting manner, the initiator of the red envelope is often the live platform, and the user itself is only the receiver of the red envelope event, so that the social participation degree of the user is also low. Compared with the prior art, the method has the advantages that the user can serve as the initiator of the red packet event, the social participation degree of the user is improved, the user who initiates the red packet can throw out 'olive branches' to all users who watch live broadcast on the same scene on line, the user participates in the red packet and the red packet, and the potential desire to participate in social contact is expressed to a certain degree. Because the red packet amount can be distributed according to the similarity between the red packet users and the red packet robbing users, and is not distributed randomly, the reference can be provided for the interaction between the users. The embodiment provides a method for selecting to add friends through the sending and receiving of virtual resources, and the use experience of users is improved.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A fourth embodiment of the invention relates to a server, as shown in fig. 4, comprising at least one processor 401; and a memory 402 communicatively coupled to the at least one processor 401; the memory 402 stores instructions executable by the at least one processor 401, and the instructions are executed by the at least one processor 401, so that the at least one processor 401 can execute the method for allocating virtual resources according to the first or second embodiment.
Where the memory 402 and the processor 401 are coupled by a bus, which may include any number of interconnected buses and bridges that couple one or more of the various circuits of the processor 401 and the memory 402 together. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor 401 may be transmitted over a wireless medium via an antenna, which may receive the data and transmit the data to the processor 401.
The processor 401 is responsible for managing the bus and general processing and may provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And memory 402 may be used to store data used by processor 401 in performing operations.
A fifth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The computer program realizes the above-described method embodiments when executed by a processor.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (11)
1. A method for allocating virtual resources, comprising:
when receiving the distribution information of the virtual resources sent by a first user terminal, sending the pickup information of the virtual resources to each second user terminal in the current group where the first user terminal is located;
acquiring information of a third user corresponding to a third user responding to the pickup information in each second user;
acquiring the similarity between a first user and a third user according to the information of the first user and the information of the third user corresponding to the first user;
and distributing the quota of the virtual resources drawn by the third user according to the acquired similarity.
2. The method according to claim 1, wherein the obtaining the similarity between the first user and the third user according to the information of the first user and the information of the third user corresponding to the first user comprises:
acquiring the similarity between the first user and the third user according to any one or combination of the following items:
and the access time overlapping rate, the preference overlapping rate and the geographic distance of the first user and the third user are close to each other.
3. The method according to claim 1, wherein the similarity between the first user and the third user is obtained by the following formula:
s(u，v)＝δD*D(u，v)+δT*T(u，v)+δG*G(u，v)
wherein s (u, v) is a similarity between the first user and the third user, D (u, v) is a similarity between geographic distances of the first user and the third user, T (u, v) is an access time overlapping rate of the first user and the third user, G (u, v) is a preference overlapping rate of the first user and the third user, and δD+δT+δGN, which is the number of second ues in the current group.
4. The method according to claim 3, wherein the proximity D (u, v) of the geographic distance between the first user and the third user is obtained by the following formula:
wherein L (u, v) is a geographic distance between the first user and the third user, LmaxAnd respectively obtaining the maximum distance between the n second users corresponding to the n second user terminals and the n geographic distances of the first user.
5. The method according to claim 1, further comprising, after the obtaining information of a third user corresponding to a third user responding to the pickup information in each of the second users, the step of:
according to the sequence of the response time of the pickup information, sequencing all third users responding to the pickup information; wherein, the more advanced the response time, the more advanced the ranking;
the allocating the quota of the virtual resources drawn by the third user according to the obtained similarity specifically comprises:
and sequentially distributing the acquired quota of the virtual resources to each third user after sequencing according to the acquired similarity.
6. The method according to claim 5, further comprising, before said sequentially allocating, according to the obtained similarity, the retrieved quota of the virtual resource to each of the sorted third users, a step of:
acquiring a single resource limit according to the total amount of the virtual resources and the number of second user terminals in the current group;
the sequentially allocating the amount of the acquired virtual resources to each of the third users which are sequenced according to the acquired similarity specifically comprises:
and sequentially distributing the quota of the virtual resource acquired by each third user according to the acquired similarity, the single resource quota and the remaining quota of the current virtual resource.
7. The method for allocating virtual resources according to claim 6, wherein the allocating the quota of the virtual resources that each third user draws in turn according to the obtained similarity, the quota of the single resource, and the remaining quota of the current virtual resource specifically comprises:
calculating the quota of the virtual resources acquired by each third user through the following formula:
wherein s (u, v) is a similarity between the first user and the third user, and the s (u, v) is a similarity between the first user and the third user
Is the single resource limit, the
To pair the
And rounding the calculation result, wherein w is the residual amount of the current virtual resource, and M is the total amount of the virtual resource.
8. The method according to claim 1, wherein the current group where the first ue is located is: in the live broadcast room to which the first user terminal is currently connected, each second user terminal in the current group is: and currently connecting each user side of the live broadcast room.
9. The method according to any one of claims 1 to 8, further comprising, after said allocating the quota of the virtual resource picked up by the third user:
and sending push information to the first user side and/or the third user side so that a user corresponding to the user side receiving the push information selects whether to add a friend or not according to the push information, wherein the push information comprises information of a third user getting the virtual resource.
10. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method of allocating virtual resources as claimed in any one of claims 1 to 9.
11. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method for allocating virtual resources of any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910784332.6A CN110688215A (en) | 2019-08-23 | 2019-08-23 | Virtual resource allocation method, server, and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910784332.6A CN110688215A (en) | 2019-08-23 | 2019-08-23 | Virtual resource allocation method, server, and computer-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110688215A true CN110688215A (en) | 2020-01-14 |
Family
ID=69108362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910784332.6A Pending CN110688215A (en) | 2019-08-23 | 2019-08-23 | Virtual resource allocation method, server, and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110688215A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343469A (en) * | 2020-02-19 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN111443846A (en) * | 2020-04-23 | 2020-07-24 | 维沃移动通信有限公司 | Red packet processing method, electronic device and storage medium |
| CN111612537A (en) * | 2020-05-20 | 2020-09-01 | 腾讯科技（深圳）有限公司 | Virtual resource obtaining method and device and electronic equipment |
| CN111611075A (en) * | 2020-05-19 | 2020-09-01 | 北京达佳互联信息技术有限公司 | Virtual resource request processing method and device, electronic equipment and storage medium |
| CN111625353A (en) * | 2020-05-18 | 2020-09-04 | 北京达佳互联信息技术有限公司 | Virtual resource distribution processing method, device, server and storage medium |
| CN111861432A (en) * | 2020-07-29 | 2020-10-30 | 北京达佳互联信息技术有限公司 | Virtual resource information updating method and device, server and storage medium |
| CN112256424A (en) * | 2020-09-22 | 2021-01-22 | 北京达佳互联信息技术有限公司 | Virtual resource processing method, device and system, electronic equipment and storage medium |
| CN114339323A (en) * | 2020-10-09 | 2022-04-12 | 武汉斗鱼鱼乐网络科技有限公司 | Method and system for distributing electronic resources, storage medium and equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106096924A (en) * | 2016-06-21 | 2016-11-09 | 阿里巴巴集团控股有限公司 | object distribution method and device |
| CN106961379A (en) * | 2016-01-08 | 2017-07-18 | 深圳市星电商科技有限公司 | resource sharing method, device and system |
| CN107276875A (en) * | 2016-04-06 | 2017-10-20 | 福州百益百利自动化科技有限公司 | Location-based red packet distribution method, system and mobile terminal |
| CN107302488A (en) * | 2016-04-14 | 2017-10-27 | 阿里巴巴集团控股有限公司 | Distribution method, system and the server of virtual objects |
| CN108305057A (en) * | 2018-01-22 | 2018-07-20 | 平安科技（深圳）有限公司 | Dispensing apparatus, method and the computer readable storage medium of electronics red packet |
| CN109242457A (en) * | 2018-09-21 | 2019-01-18 | 刘磊 | A kind of method and system for robbing red packet |
-
2019
- 2019-08-23 CN CN201910784332.6A patent/CN110688215A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106961379A (en) * | 2016-01-08 | 2017-07-18 | 深圳市星电商科技有限公司 | resource sharing method, device and system |
| CN107276875A (en) * | 2016-04-06 | 2017-10-20 | 福州百益百利自动化科技有限公司 | Location-based red packet distribution method, system and mobile terminal |
| CN107302488A (en) * | 2016-04-14 | 2017-10-27 | 阿里巴巴集团控股有限公司 | Distribution method, system and the server of virtual objects |
| CN106096924A (en) * | 2016-06-21 | 2016-11-09 | 阿里巴巴集团控股有限公司 | object distribution method and device |
| CN108305057A (en) * | 2018-01-22 | 2018-07-20 | 平安科技（深圳）有限公司 | Dispensing apparatus, method and the computer readable storage medium of electronics red packet |
| CN109242457A (en) * | 2018-09-21 | 2019-01-18 | 刘磊 | A kind of method and system for robbing red packet |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343469B (en) * | 2020-02-19 | 2021-09-28 | 腾讯科技（深圳）有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN111343469A (en) * | 2020-02-19 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN111443846A (en) * | 2020-04-23 | 2020-07-24 | 维沃移动通信有限公司 | Red packet processing method, electronic device and storage medium |
| CN111625353B (en) * | 2020-05-18 | 2024-03-12 | 北京达佳互联信息技术有限公司 | Virtual resource distribution processing method, device, server and storage medium |
| CN111625353A (en) * | 2020-05-18 | 2020-09-04 | 北京达佳互联信息技术有限公司 | Virtual resource distribution processing method, device, server and storage medium |
| CN111611075A (en) * | 2020-05-19 | 2020-09-01 | 北京达佳互联信息技术有限公司 | Virtual resource request processing method and device, electronic equipment and storage medium |
| CN111611075B (en) * | 2020-05-19 | 2024-03-05 | 北京达佳互联信息技术有限公司 | Virtual resource request processing method and device, electronic equipment and storage medium |
| CN111612537B (en) * | 2020-05-20 | 2023-11-07 | 腾讯科技（深圳）有限公司 | Virtual resource acquisition method and device and electronic equipment |
| CN111612537A (en) * | 2020-05-20 | 2020-09-01 | 腾讯科技（深圳）有限公司 | Virtual resource obtaining method and device and electronic equipment |
| CN111861432A (en) * | 2020-07-29 | 2020-10-30 | 北京达佳互联信息技术有限公司 | Virtual resource information updating method and device, server and storage medium |
| CN111861432B (en) * | 2020-07-29 | 2024-04-19 | 北京达佳互联信息技术有限公司 | Virtual resource information updating method and device, server and storage medium |
| CN112256424A (en) * | 2020-09-22 | 2021-01-22 | 北京达佳互联信息技术有限公司 | Virtual resource processing method, device and system, electronic equipment and storage medium |
| CN114339323A (en) * | 2020-10-09 | 2022-04-12 | 武汉斗鱼鱼乐网络科技有限公司 | Method and system for distributing electronic resources, storage medium and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110688215A (en) | Virtual resource allocation method, server, and computer-readable storage medium | |
| US8626818B2 (en) | System and method for generating user contexts for targeted advertising | |
| CN107679718B (en) | List allocation method, apparatus and computer-readable storage medium | |
| CN105933213B (en) | Chat message processing method, related equipment and system | |
| CN107800901B (en) | User call processing method, device, computer equipment and storage medium | |
| CN110035004B (en) | User name card sharing method, friend adding method and related device | |
| CN107833029B (en) | Resource transfer method and device, and red packet sending method and device | |
| CN106484543B (en) | Virtual article dispatching method and device and mobile terminal thereof | |
| CN108900924A (en) | The method and apparatus of commending friends in direct broadcasting room | |
| CN109685538B (en) | Resource acquisition information processing method and device and electronic equipment | |
| US20120214456A1 (en) | Methods and apparatus for transmitting data | |
| CN110288328B (en) | Virtual article sending method, virtual article receiving method, virtual article sending device, virtual article receiving equipment and storage medium | |
| CN111160976A (en) | Resource allocation method, device, electronic equipment and storage medium | |
| CN110971757B (en) | Method, device, equipment and medium for adding WeChat friends from telephone application | |
| CN108924036B (en) | Method and equipment for allocating resources and drawing resources | |
| CN104796561A (en) | Agent distribution method, CTI (Computer Telephony Integration) equipment, terminal and agent distribution system | |
| CN111641702A (en) | Heartbeat message management method and device | |
| CN113315869A (en) | Content display method and device, electronic equipment and storage medium | |
| CN111026969B (en) | Content recommendation method and device, storage medium and server | |
| CN110740088A (en) | Method, device, terminal and medium for recommending and adding social resources | |
| CN108965359B (en) | Communication method, communication device, readable medium, and electronic apparatus | |
| CN113986062A (en) | Information processing method, device and storage medium | |
| CN113220684A (en) | Data packet storage and query method, device, system and storage medium | |
| CN106789568A (en) | A kind of communication information acquisition methods and device | |
| US20140287787A1 (en) | Connection System and Method to Dynamically Create and Collect a Group of Contextual Contacts |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200114 |