CN110688215A - Virtual resource allocation method, server, and computer-readable storage medium - Google Patents

Abstract

Embodiments of the present invention relate to the field of communication technologies, and disclose a virtual resource allocation method, a server, and a computer-readable storage medium. In the present invention, the above method for allocating virtual resources includes: when receiving the allocation information of the virtual resources sent by the first user terminal, sending the claim information of the virtual resources to the current group where the first user terminal is located each second user terminal in each of the second user terminals; obtain the information of the third user corresponding to the third user terminal that responds to the receiving information in each of the second user terminals; according to the information of the first user corresponding to the first user terminal and the information of the third user, obtain the similarity between the first user and the third user; according to the obtained similarity, allocate the amount of virtual resources received by the third user, so that virtual Personalized allocation of resources.

Description

Virtual resource allocation method, server and computer-readable storage medium

technical field

Embodiments of the present invention relate to the field of communications technologies, and in particular, to a method for allocating virtual resources, a server, and a computer-readable storage medium.

Background technique

With the popularity of Internet consumption, electronic red envelopes have replaced traditional physical red envelopes in many fields and become an important communication tool between users. Users can increase communication and interaction with each other by sending red envelopes.

However, the inventor found that there are at least the following problems in the related art: in the scenario of multiple users grabbing red envelopes, there are usually two situations, either the amount of the red envelopes grabbed by multiple users is the same, or the amount of red envelopes grabbed by each user is completely random. , it is difficult to realize the personalized distribution of red envelopes.

SUMMARY OF THE INVENTION

The purpose of the embodiments of the present invention is to provide a method for allocating virtual resources, a server and a computer-readable storage medium, so that individualized allocation of virtual resources can be realized.

In order to solve the above technical problem, an embodiment of the present invention provides a method for allocating virtual resources, which includes: when receiving the allocation information of the virtual resources sent by the first user terminal, sending the claim information of the virtual resources to the allocating information of the virtual resources. each second user terminal in the current group where the first user terminal is located; obtain the information of the third user corresponding to the third user terminal in each of the second user terminals in response to the receiving information; according to the The information of the first user and the information of the third user corresponding to the first user terminal, obtain the similarity between the first user and the third user; according to the obtained similarity, assign the third user The amount of virtual resources received.

Embodiments of the present invention also provide a server, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a program executable by the at least one processor The instruction is executed by the at least one processor, so that the at least one processor can execute the above-mentioned method for allocating virtual resources.

An embodiment of the present invention also provides a computer-readable storage medium storing a computer program, wherein the computer program implements the above-mentioned method for allocating virtual resources when the computer program is executed by a processor.

Compared with the prior art, in the embodiment of the present invention, when receiving the allocation information of the virtual resource sent by the first user terminal, the virtual resource claim information is sent to each first user terminal in the current group where the first user terminal is located. Two user terminals, so that each second user corresponding to each second user terminal can view the receiving information of the virtual resource. Obtain the information of the third user corresponding to the third user terminal in each second user terminal that responds to the receiving information, so that the information of the third user who responded to the receiving information from all the second users who can view the receiving information of the virtual resource can be obtained. . According to the information of the first user and the information of the third user corresponding to the first user terminal, the similarity between the first user and the third user is obtained, and the obtained similarity is beneficial to well characterize the user who sends the virtual resource and the user who receives the virtual resource the degree of correlation between users. According to the obtained similarity, the amount of virtual resources received by the third user is allocated, that is, the amount of virtual resources allocated by the third user depends on the similarity between the third user and the first user, which is conducive to making full use of the user Invisible connection between them, so as to realize the personalized allocation of virtual resources sent through the first user terminal.

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 terminal includes: according to any one of the following or a combination thereof, obtain the similarity between the first user and the third user: the overlapping rate of access time, the overlapping rate of preference, and the similarity degree of geographic distance between the first user and the third user. Different dimensions that can well characterize the similarity between users are provided, that is, the time overlap rate, the preference overlap rate, and the proximity degree of geographic distance, which is beneficial to accurately obtain the similarity between the first user and the third user.

In addition, 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, the s(u,v) is the similarity between the first user and the third user, and the D(u,v) is the geographic distance between the first user and the third user. degree, the T(u,v) is the access time overlap rate between the first user and the third user, and the G(u,v) is the time overlap between the first user and the third user The preference overlap ratio, δ _D + δ _T + δ _G =n, where n is the number of second UEs in the current group. A specific calculation formula of the similarity between the first user and the third user is provided, which facilitates the accurate acquisition of the similarity between the first user and the third user.

In addition, the geographic distance similarity D(u, v) between the first user and the third user is specifically obtained by the following formula:

Wherein, the L(u,v) is the geographic distance between the first user and the third user, and the _Lmax is the n second users corresponding to the n second users and the The largest distance among n geographic distances for the first user. A calculation formula of the proximity degree of geographical distance is provided, which facilitates accurate measurement of the proximity degree of geographical distance between the first user and the third user.

In addition, after the acquiring the information of the third user corresponding to the third user terminal in each second user terminal that responds to the receiving information, the method further includes: according to the order of the response time to the receiving information, The third users who respond to the claim information are sorted; wherein, the third user whose response time is earlier is ranked earlier; the third user is allocated according to the obtained similarity. The quota of virtual resources is specifically: according to the acquired similarity, sequentially assigning the quota of virtual resources received to each of the sorted third users. By sequentially allocating the received virtual resources to each third user according to the response time sequence, it is beneficial to improve the enthusiasm of the user when responding to the received information.

In addition, according to the acquired similarity, the single resource quota and the remaining quota of the current virtual resources, sequentially assigning the quota of the virtual resources received by the third users, specifically: calculating the quota of each virtual resource by the following formula The quota of virtual resources received by the third user:

为所述单份资源额度，所述

为对所述

的计算结果下取整，所述w为当前虚拟资源的剩余额度，所述M为所述虚拟资源的总额。提供了一种计算各第三用户领取的虚拟资源的额度的具体公式，有利于根据各第三用户与第一用户之间的相似度、单份资源额度以及当前虚拟资源的剩余额度依次对各第三用户领取的虚拟资源的额度进行合理的分配。Wherein, the s(u,v) is the similarity between the first user and the third user, and the

is the single resource quota, the

for the stated

The calculation result of is rounded down, the w is the remaining amount of the current virtual resource, and the M is the total amount of the virtual resource. A specific formula for calculating the amount of virtual resources received by each third user is provided, which is conducive to sequentially evaluating each third user and the first user according to the similarity between each third user and the first user, the amount of a single resource, and the remaining amount of the current virtual resources. The quota of virtual resources received by the third user is allocated reasonably.

In addition, the current group in which the first client is located is: the live room currently connected to the first client, and each second client in the current group is: the live room currently connected to the live room. each client. That is to say, the first user can send the claim information of virtual resources in the live room through the first client, and each second client connected to the live room can receive the claim information, so that users watching the live broadcast in the live room can send virtual resources by sending virtual resources. The resource receiving information interacts, and the atmosphere of the live broadcast room is active, and the user can act as the initiator of the virtual resource receiving information, which is beneficial to improve the user's social participation.

In addition, after allocating the amount of virtual resources received by the third user, the method further includes: sending push information to the first user terminal and/or the third user terminal for receiving the push The user corresponding to the user end of the information selects whether to add a friend according to the push information, where the push information includes information of a third user who has received the virtual resource. Provides a way of selecting and adding friends by sending and receiving virtual resources, which is beneficial to improve the user experience.

Description of drawings

One or more embodiments are exemplified by the pictures in the corresponding drawings, and these exemplified descriptions do not constitute limitations on the embodiments.

1 is a flowchart of a method for allocating virtual resources according to the first embodiment of the present invention;

2 is a flowchart of a method for allocating virtual resources according to a second embodiment of the present invention;

3 is a flowchart of a method for allocating virtual resources according to a third embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a server according to a fourth embodiment of the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the embodiments of the present invention clearer, the various embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, those of ordinary skill in the art can appreciate that, in the various embodiments of the present invention, many technical details are set forth in order for the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solutions claimed in the present application can be realized. The following divisions of the various embodiments are for the convenience of description, and should not constitute any limitation on the specific implementation of the present invention, and the various embodiments may be combined with each other and referred to each other on the premise of not contradicting each other.

The first embodiment of the present invention relates to a method for allocating virtual resources, which is applied to a server. Wherein, the virtual resources may be electronic red envelopes, gifts, coupons, etc. that are presented as virtual existences to others. The implementation details of the method for allocating virtual resources in this embodiment will be specifically described below. The following content is only provided for the convenience of understanding, and is not necessary for implementing this solution.

The flowchart of the method for allocating virtual resources in this embodiment may be as shown in FIG. 1 , and specifically includes:

Step 101: When receiving the virtual resource allocation information sent by the first user terminal, send the virtual resource claim information to each second user terminal in the current group where the first user terminal is located.

The first user terminal, the second user terminal, and the third user terminal mentioned in the following step 102 may be terminal devices such as a mobile phone and a tablet computer. The first user terminal may correspond to the first user, for example, the first user terminal may be a mobile phone used by the first user, a similar second user terminal corresponds to the second user, and the third user terminal corresponds to the third user. Specifically, the first client is the client that sends the allocation information of the virtual resource, for example, the mobile phone used by the first user who sends the electronic red envelope. The second client is the client in the current group where the first client is located, for example, the mobile phone used by the second user in the current group who has the opportunity to receive the electronic red envelope sent by the first user's mobile phone.

In addition, the current group may be a group formed by clients currently connected to the same server. In one example, the server may be the qq platform or the WeChat platform, the current group may be the qq group or the WeChat group of the first user who sent the electronic red envelope, and each second client in the current group is the above-mentioned qq The client terminal corresponding to each second user in the group or WeChat group. In another example, the server may be a live broadcast platform, the current group may be the live broadcast room connected to the first client terminal, and the second client terminal may be each client terminal connected to the above-mentioned live broadcast room. It can be understood that the first user terminal is one of the second user terminals in the current group that initiates the electronic red envelope. It should be noted that the current group in this embodiment is only an example of a qq group, a WeChat group, and a live broadcast room, but the actual application is not limited to this.

Specifically, step 101 can be understood as the first user using the first client to send the distribution information of the electronic red envelope to the server, and after receiving the distribution information of the electronic red envelope, the server sends the receiving information of the electronic red envelope to the location where the first client is located. each second client in the current group of . In an example, the current group is a WeChat group, and step 101 can be understood as a user in the WeChat group has sent a group red envelope in the WeChat group, and everyone in the WeChat group can view the electronic red envelope through the mobile phone they use receiving information. In another example, the current group is a live broadcast room, and step 101 can be understood as a user in the live broadcast room has sent a red envelope that can be claimed by multiple people in the live broadcast room, and all users watching the live broadcast in this live broadcast room can Check the red envelope collection information on your mobile phone. In the specific implementation, the first user can call up the electronic red envelope sending page through the electronic red envelope sending portal, set the red envelope amount on the sending page, limit the duration of the red envelope grab, etc., and then send the electronic red envelope receiving information to the first user terminal For each second user terminal in the current group, each second user can grab the red envelope within the validity period of the electronic red envelope, that is, within the limited time for grabbing the red envelope. It should be noted that the above examples are only examples for the convenience of understanding, and do not limit the technical solutions of the present invention.

Step 102: Acquire information of a third user corresponding to a third user terminal that responds to receiving the information in each second user terminal.

Specifically, the third user terminal that responds to receiving the information can be understood as the user terminal used by the user who grabbed the red envelope, such as the mobile phone used by the user who grabbed the red envelope, that is to say, the second user terminal is robbed of the red envelope. The user terminal to the red envelope is called the third user terminal. In a specific implementation, after the server sends the receiving information of the electronic red envelope to each second user terminal, it can detect whether each second user terminal responds to the above-mentioned receiving information, for example, can detect the electronic red envelope displayed on the screen of each second user terminal. Whether the icon is clicked, the user terminal whose icon of the electronic red envelope is clicked in each second client terminal is regarded as the third client terminal responding to receiving the information, so that the server can obtain the information of the third user corresponding to the third client terminal.

The information of the third user may be the age, gender, geographic location, access time, preference information, and the like of the third user. In order to facilitate the 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 to describe the user's information in detail: the age of the third user can be used when the user registers the live broadcast platform where the live broadcast room is located. The real age of the user can also be the registration age of the user. The registration age can be calculated from the time when the user registers with the live broadcast platform. The gender of the third user can also be obtained from the registration information of the user when registering for the live broadcast platform. The geographic location of the third user may be acquired through a positioning function in the third client used by the third user. The access time of the third user can be the common time period when the user accesses the live room, that is, enters the live room to watch the live broadcast. It can be understood that the live broadcast platform, that is, the server, can record the viewing and browsing records of the third user, so as to obtain according to the viewing and browsing records. interview time. The preference information of the third user may be the live content that the user pays attention to, is interested in, and often watches, and may be specifically obtained by the server according to the viewing and browsing records.

Step 103: Obtain 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 terminal.

Specifically, the manner of acquiring the information of the first user corresponding to the first user terminal is similar to the manner of acquiring the information of the third user, which is not repeated here to avoid repetition. The following is a detailed description of obtaining the similarity between the first user and the third user:

In an example, the similarity between the first user and the third user may be obtained according to any one of the following or a combination thereof: the visit time overlap rate, preference overlap rate, and geographic distance similarity of the first user and the third user .

The above-mentioned access time overlap rate may be the overlap rate of the common access time periods of the first user and the third user, which may be specifically calculated by the following formula:

Among them, T(u, v) is the access time overlap rate of the first user u and the third user v, t _i is the common access time period of the first user u, and t _j is the common access time period of the third user v .

The above-mentioned preference overlap rate can be the cosine similarity of the preferences of the first user and the third user, and the calculation method of the cosine similarity can be: take the user's preference as a point in the n-dimensional coordinate system, and connect this point with The origin of the coordinate system forms a straight line (vector), and the similarity value between two users is the cosine value of the angle between the two straight lines (vectors). The smaller the angle, the more similar the two users are, and the larger the angle, the more The smaller the similarity between two users.

The above-mentioned geographic distance similarity can be calculated by the following formula:

Among them, 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, and _Lmax is the n second users The maximum distance among the n geographic distances between the n second users corresponding to the terminal and the first user, n is the number of second users in the current group, for example, n can be the user currently watching the live broadcast in the live broadcast room. quantity. It can be understood that the larger D(u, v) is, the closer the geographic distance between the first user u and the third user v is, and it can be considered that the similarity between the first user u and the third user v is higher.

It should be noted that this embodiment only provides three user dimensions that can be used to measure the similarity between users, that is, the time overlap rate, the preference overlap rate, and the proximity degree of geographic distance. The user dimension used to measure the similarity between users is not limited to the above three user dimensions. For example, the similarity between users can also be measured by the size of the age gap between the first user and the third user. It can be understood that the greater the age gap, the smaller the similarity between users, and the smaller the age gap. The greater the similarity between them. In addition, the gender information of the first user and the third user may also 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 can be set to be high, and the similarity between users of different genders can 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 can be calculated directly according to the following formula:

s(u,v)=δD* _D (u,v)+δT* _T (u,v)+δG* _G (u,v)

Among them, s(u, v) is the similarity between the first user u and the third user v, D(u, v) is the geographical distance between the first user u and the third user v, and T(u, v) is the access time overlap rate of the first user u and the third user v, G(u, v) is the preference overlap rate of the first user u and the third user v, δ _D , δ _T , δ _G are D respectively (u, v), T(u, v), G(u, v) pre-coefficients, and δ _D + δ _T + δ _G =n, the respective sizes of δ _D , δ _T , δ _G can be based on actual It needs to be set, which is not specifically limited in this embodiment, and n is the number of second client terminals in the current group. It should be noted that this embodiment only takes the calculation of the similarity by the above formula as an example, but the formula for calculating the similarity in a specific implementation is not limited to this.

Taking the application scenario of initiating an electronic red envelope in the live broadcast room as an example, step 103 can be understood as: the first user uses the first terminal to initiate an electronic red envelope in the live broadcast room, and the server obtains the relationship between the first user and each third user who receives the electronic red envelope. similarity.

Step 104: Allocate the amount of virtual resources received by the third user according to the obtained similarity.

Specifically, the server may allocate virtual resources to each third user according to the total amount of virtual resources and the obtained similarity between the first user and each third user when the first client sends the allocation information of the virtual resources amount of. When allocating the quota of virtual resources, the server may allocate a relatively high quota of virtual resources to a third user with a high similarity to the first user, and allocate a relatively low virtual resource to a third user with a low similarity to the first user. amount of resources.

Also taking the application scenario of initiating an electronic red envelope in the live broadcast room as an example, step 104 can be understood as: the server, according to the similarity between the third user who received the red envelope and the first user who sent the red envelope in the live broadcast room, is each The amount of red envelopes received by the third user is allocated, the third user with high similarity is allocated a relatively large amount of red envelopes, and the third user with low similarity is allocated a relatively small amount of red envelopes. After the allocation is completed, the amount in the account corresponding to the first user who sent the red envelope decreases, and the amount in the account corresponding to the third user who is allocated the amount in the live broadcast room increases.

It is understandable that there are two situations in which the red envelopes are over: one is that the total amount of red envelopes sent by users has been exhausted. The other is that the limited time for grabbing red packets expires. For example, when the user sets the red packet grabbing time to be t seconds, the user can grab the red packet within t seconds after the red packet is issued, otherwise the red packet will expire. In addition, the expired red envelope can be set with a color mark, and users who grab the red envelope can no longer click to grab the red envelope, and the remaining unallocated amount in the red envelope will be returned to the account of the user who issued the red envelope.

It should be noted that, the above examples in this embodiment are all examples for the convenience of understanding, and do not limit the technical solutions of the present invention.

Compared with the prior art, when receiving the allocation information of the virtual resource sent by the first user terminal, the present embodiment sends the virtual resource claim information to each second user in the current group where the first user terminal is located. terminal, so that each second user corresponding to each second user terminal can view the receiving information of the virtual resource. Obtain the information of the third user corresponding to the third user terminal in each second user terminal that responds to the receiving information, so that the information of the third user who responded to the receiving information from all the second users who can view the receiving information of the virtual resource can be obtained. . According to the information of the first user and the information of the third user corresponding to the first user terminal, the similarity between the first user and the third user is obtained, and the obtained similarity is beneficial to well characterize the user who sends the virtual resource and the user who receives the virtual resource the degree of correlation between users. According to the obtained similarity, the amount of virtual resources received by the third user is allocated, that is, the amount of virtual resources allocated by the third user depends on the similarity between the third user and the first user, which is conducive to making full use of the user Invisible connection between them, so as to realize the personalized allocation of virtual resources sent through the first user terminal.

The second embodiment of the present invention relates to a method for allocating virtual resources, and the second embodiment is a further improvement of the first embodiment. After the information of the third user corresponding to the user terminal, it also includes: according to the order of the response time for receiving the information, sorting the third users who responded to the receiving information; according to the obtained similarity, allocating the virtual resources received by the third user The quota is specifically: according to the obtained similarity, the quotas of the virtual resources received are sequentially allocated to the sorted third users. The implementation details of the method for allocating virtual resources in this embodiment will be specifically described below. The following content is only provided for the convenience of understanding, and is not necessary for implementing this solution.

The flowchart of the method for allocating virtual resources in this embodiment may be as shown in FIG. 2 , and specifically includes:

Step 201: When receiving the virtual resource allocation information sent by the first user terminal, send the virtual resource claim information to each second user terminal in the current group where the first user terminal is located.

Step 202: Acquire information of a third user corresponding to a third user terminal that responds to receiving the information in each second user terminal.

Step 203: Obtain 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 terminal.

It should be noted that, steps 201 to 203 are substantially the same as steps 101 to 103 in the first embodiment, and in order to avoid repetition, they will not be repeated here.

Step 204: Rank the third users who responded to the received information according to the order of response times to the received information.

Specifically, the server can obtain the response time of each third user for receiving the information, for example, when the third user clicks the icon of the electronic red envelope displayed on the screen of the third client, the click time is recorded, and the recorded click time is used as the first click time. 3. The user's response time to receiving information. Then, according to the recorded order of the response times of the third users, the third users are sorted, and the third user whose response time is higher is ranked higher.

It should be noted that, the execution order of step 203 and step 204 in this embodiment is only to perform step 203 first and then step 204 as an example. In a specific implementation, step 204 may also be performed first and then step 203. For this, this The embodiments are not specifically limited.

Step 205 : According to the obtained similarity, sequentially assign the amount of virtual resources received to each of the sorted third users.

Specifically, before allocating the received virtual resource quota to each third user in sequence, a single resource quota may be obtained according to the total amount of virtual resources and the number of second clients in the current group. In an example, assuming that the total amount of virtual resources is M and the number of second clients is n, the single resource quota can be expressed as M*1/n. Then, according to the obtained similarity, the single resource quota and the current remaining quota of the virtual resources, the quotas of the virtual resources received by the third users are sequentially allocated. Wherein, the remaining amount of the current virtual resources can be understood as the remaining amount after deducting the assigned amount from the total amount of the virtual resources after allocating the amount of virtual resources received by a third user.

In an example, according to the obtained similarity, the quota of a single resource and the remaining quota of the current virtual resources, the quota of the virtual resources received by each third user is sequentially allocated, and the virtual resources received by each third user can be calculated by the following formula. Amount of:

为单份资源额度，

为对

的计算结果下取整，w为当前虚拟资源的剩余额度，M为虚拟资源的总额。可以理解的是，计算排在第一位的第三用户所领取的虚拟资源的额度时，采用的上述公式

中，w＝M，假设计算得到的排在第一位的第三用户所领取的虚拟资源的额度为P，那么当计算排在第二位的第三用户所领取的虚拟资源的额度时上述公式中的w＝M-P，然后按照上述的方式依次计算其他第三用户所领取的虚拟资源的额度。Among them, s(u, v) is the similarity between the first user u and the third user v,

is a single resource quota,

for right

The calculation result of is rounded down, w is the remaining amount of the current virtual resource, and M is the total amount of the virtual resource. It is understandable that when calculating the amount of virtual resources received by the third user ranked first, the above formula is used.

, w=M, assuming that the calculated amount of virtual resources received by the third user ranked first is P, then when calculating the amount of virtual resources received by the third user ranked second, the above w=MP in the formula, and then calculate the amount of virtual resources received by other third users in sequence according to the above method.

每分配完一个用户领取的红包金额都对红包的当前余额进行更新，再接着计算下一个用户分配的红包金额。以此类推，计算所有抢到红包的用户分配的金额。In order to further facilitate the understanding of this embodiment, the following takes the application scenario of initiating electronic red envelopes in the live broadcast room as an example for specific description: the first user can set the total amount of red envelopes to send when initiating red envelopes in the live broadcast room, and limit the time to grab the red envelopes. . Assuming that the set total amount of red envelopes is M, and the limited time for grabbing red envelopes is t seconds, then M is correspondingly subtracted from the account corresponding to the first user. The server distributes red envelopes online according to the situation of users grabbing red envelopes in the live broadcast room within t seconds. The distribution process can be as follows: First, at the moment when red envelopes are issued, the total number of users currently watching the live broadcast, n, is obtained; secondly, the amount of a single red envelope is calculated as M *1/n; Then, according to the response time of the user grabbing the red envelope, the users are sorted, the sequence number of the first response time is small, and the sequence number of the later time is larger; then, according to the sequence number of the users who grab the red envelope from small to large Calculate the amount of red envelopes allocated by each user in turn, and the amount of red envelopes allocated is

The current balance of the red envelope is updated after each red envelope amount received by a user is allocated, and then the red envelope amount allocated by the next user is calculated. And so on, calculate the amount allocated by all users who grab the red envelopes.

Compared with the prior art, in this embodiment. By sequentially allocating the received virtual resources to each third user according to the response time sequence, it is beneficial to improve the enthusiasm of the user when responding to the received information. In addition, a specific formula for calculating the amount of virtual resources received by each third user is provided, which is beneficial to order according to the similarity between each third user and the first user, the amount of a single resource and the remaining amount of the current virtual resource. The quota of virtual resources received by each third user is reasonably allocated.

The third embodiment of the present invention relates to a method for allocating virtual resources. This embodiment is a further improvement to the first embodiment. The main improvement lies in that after allocating the amount of virtual resources received by the third user, the method further includes: Send push information to the first user terminal and/or the third user terminal, so that the user corresponding to the user terminal that received the push information can choose whether to add a friend according to the push information. The implementation details of the method for allocating virtual resources in this embodiment will be specifically described below. The following content is only provided for the convenience of understanding, and is not necessary for implementing this solution.

The flowchart of the method for allocating virtual resources in this embodiment may be as shown in FIG. 3 , and specifically includes:

Step 301: When receiving the virtual resource allocation information sent by the first user terminal, send the virtual resource claim information to each second user terminal in the current group where the first user terminal is located.

Step 302 : Acquire information of a third user corresponding to a third user terminal that responds to receiving the information in each second user terminal.

Step 303: Obtain 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 terminal.

Step 304: Allocate the amount of virtual resources received by the third user according to the obtained similarity.

It should be noted that, steps 101 to 104 are substantially the same as steps 101 to 104 in the first embodiment, and to avoid repetition, they will not be repeated here.

Step 305: Send push information to the first client and/or the third client.

Specifically, the push information sent by the server to the first client and/or the third client may include the information of the third user who has received the virtual resource, and may also include the quota of the virtual resource received by the third user. After viewing the push information, the first user and/or the third user can choose whether to add a certain user in the push information as a friend, and can also decide whether to add a following or whether to start an instant chat, share resources, and so on.

In one example, sending push information can be understood as, in order to give the user who has grabbed the red envelope the opportunity to actively follow the status of the user who has issued the red envelope or add friends, the user who has issued the red envelope can also take the initiative to pay attention to the status of the user who has grabbed the red envelope or add friend. In addition, before sending the red envelope, the user who sends the red envelope can also set whether to automatically receive the attention of the user who grabbed the red envelope, add friends, etc.

For ease of understanding, the following is an example of an application scenario where a user sends a red envelope while watching a live broadcast and establishes a connection to add friends:

When a user enters the live broadcast platform, the live broadcast platform will assign a unique ID to each user, and the user can recharge and other operations on the account corresponding to the live broadcast platform. The user can choose to enter a live broadcast room on the live broadcast platform to watch the live content. The live broadcast platform can assign the live broadcast code and live stream address for each live broadcast room, and can also record the user ID currently watching the live broadcast content in the live broadcast room. Among them, the live code is unique to each live room. Each live room corresponds to a user queue, and the user queue is composed of users currently watching live content in the live room.

Assuming that user 1 who is watching in the live broadcast room A initiates a red envelope event, each user in the user queue A corresponding to the live broadcast room A can grab the red envelope in the live broadcast room A. The amount of red envelopes received by users who have grabbed red envelopes is allocated. Then, through the page of grabbing red envelopes, the ID of the user who grabbed the red envelope can be displayed to the users who issued the red envelope and all the users who grabbed the red envelope; assuming that user 2 grabs the red envelope, then user 2 can view all the users who have grabbed the red envelope and the amount. 2. You can click the name of a user 3 who also grabbed the red envelope, and the interface for applying to add the user 3 as a friend pops up. User 2 fills in the application information, clicks "Send", and sends the request to the user terminal corresponding to user 3. . In the same way, users who send red envelopes can also perform the same operation on the page of grabbing red envelopes. They can also choose to add friends with one click to apply for adding friends to all users who have grabbed red envelopes. In addition, before sending the red envelope, the user who sends the red envelope can also set that when the amount of the red envelope grabbed by the user who grabs the red envelope is greater than a certain preset threshold, the user who sends the red envelope can automatically add the user as a friend, wherein the preset threshold can be based on Setting is actually required, which is not specifically limited in this embodiment.

It should be noted that the above-mentioned scenario examples in this embodiment are examples for the convenience of understanding, and do not constitute a limitation on the technical solutions of the present invention.

At present, the interaction of most live broadcast platforms is carried out by means of barrage, message, etc. However, the interaction between barrage and message is carried out by means of text, and the interaction efficiency is low. Although the live broadcast platform itself will also use red envelopes to interact with users, the initiator of the red envelope is often the live broadcast platform, and the user itself is only the recipient of the red envelope event, so the degree of user social participation is also low. Compared with the prior art, the user can act as the initiator of the red envelope event, which improves the user's social participation. The user who initiates the red envelope can throw an "olive branch" to all users who watch the same live broadcast online, and the user participates in the sending of the red envelope. Red envelopes and grabbing red envelopes, to some extent, express the potential willingness to participate in social networking. Since the amount of red envelopes can be allocated according to the similarity between users who send red envelopes and users who grab red envelopes, instead of random allocation, it can provide a reference for the interaction between users. This embodiment provides a method for selecting to add friends by sending and receiving virtual resources, which is beneficial to improve the user experience.

The steps of the above various methods are divided only for the purpose of describing clearly. During implementation, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as the same logical relationship is included, they are all within the protection scope of this patent. ;Adding insignificant modifications to the algorithm or process or introducing insignificant designs, but not changing the core design of the algorithm and process are all within the scope of protection of this patent.

The fourth embodiment of the present invention relates to a server, as shown in FIG. 4 , comprising at least one processor 401; and a memory 402 connected in communication with the at least one processor 401; wherein, the memory 402 stores data that can be used by the at least one processor The instruction executed by 401 is executed by at least one processor 401, so that the at least one processor 401 can execute the method for allocating virtual resources in the first or second embodiment.

The memory 402 and the processor 401 are connected by a bus, and the bus may include any number of interconnected buses and bridges, and the bus connects one or more processors 401 and various circuits of the memory 402 together. The bus may also connect together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides the interface between the bus and the transceiver. A transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other devices over a transmission medium. The data processed by the processor 401 is transmitted on the wireless medium through the antenna, and further, the antenna also receives the data and transmits the data to the processor 401 .

Processor 401 is responsible for managing the bus and general processing, and may also provide various functions including timing, peripheral interface, voltage regulation, power management, and other control functions. The memory 402 may be used to store data used by the processor 401 when performing operations.

A fifth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The above method embodiments are implemented when the computer program is executed by the processor.

That is, those skilled in the art can understand that all or part of the steps in the method for implementing the above embodiments can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium and includes several instructions to make a device ( It may be a single chip microcomputer, a chip, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: U disk, removable hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes.

Those skilled in the art can understand that the above-mentioned embodiments are specific examples for realizing the present invention, and in practical applications, various changes in form and details can be made without departing from the spirit and the spirit of the present invention. scope.

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, L_maxAnd 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 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.

Images