Methods, systems, devices, and media for group resource matching based on social platforms

Abstract

The application discloses a social platform-based group resource matching method, system, device and medium. The group resource matching method comprises the following steps: constructing a tree structure based on the association information of each member in a group; wherein the tree structure comprises a root node representing a social platform, and a plurality of parent nodes and a plurality of child nodes representing members derived from the root node; each member in the group holds a supply resource and is preset with a resource demand, and the resource demand is configured with a tendency priority; the tendency priority is configured based on the supply resource held by at least part of the members in the group; obtaining the resource demand of each node corresponding member; based on the tree structure and the resource demand and tendency priority of each member in the group, matching resources for each member to meet the resource demand of each member by using a preset constraint condition; wherein the constraint condition is used to limit the supply resource that can be matched by each member.

Description

Technical Field

[0001] This application relates to the field of computer application technology, and in particular to a group resource matching method, group resource matching system, computer device, computer-readable storage medium, and computer program product based on a social platform. Background Technology

[0002] Currently, people's environmental awareness and conservation awareness are gradually increasing, and more and more people prefer to exchange goods for what they want through barter / barter. However, due to the limited scope of each person's work and activities, exchanges are often confined to a small area, and the variety and quality of the goods are often insufficient to meet demand, leading to failed exchanges. For example, if there are two people, A and B, who want to exchange goods, but A likes B's items while B doesn't like A's items, the exchange between A and B will fail, meaning both A and B will keep their original items.

[0003] With the development of computers and the internet, people have access to more and richer information, which has expanded the scope of barter. However, since bartering is usually based on mutual exchange and communication, participants in bartering often find it difficult to efficiently find suitable exchange partners. Summary of the Invention

[0004] In view of the shortcomings of the above-mentioned related technologies, the purpose of this application is to provide a group resource matching method, group resource matching system, computer device, computer-readable storage medium, and computer program product based on a social platform, so as to overcome the technical problem in the above-mentioned related technologies of how to quickly and efficiently obtain satisfactory matching results for exchangers when the scope of item exchange is large.

[0005] To achieve the above and other related objectives, the first aspect of this application discloses a group resource matching method based on a social platform, comprising the following steps: constructing a tree structure based on the association information of each member in the group; wherein the tree structure includes a root node representing the social platform, and multiple parent nodes and multiple child nodes derived from the root node representing the members; each member in the group holds a supply resource and a preset resource demand, and the resource demand is configured with a preference priority; the preference priority is based on the supply resources held by at least some members in the group; obtaining the resource demand of the member corresponding to each node; and matching resources for each member to meet their resource demands using preset constraints based on the tree structure and the resource demands and preference priorities of each member in the group; wherein the constraints are used to limit the supply resources that can be matched for each member.

[0006] In some embodiments disclosed in the first aspect of this application, the social platform forms groups by publishing group links, and each member of the group is a registered user on the social platform.

[0007] In some embodiments disclosed in the first aspect of this application, members of the group invite invitees to join the group as members by sharing a link on the social platform or by sending a link to a target registered user on the social platform.

[0008] In some embodiments disclosed in the first aspect of this application, the resource requirements preset by the group members include their own supply resources.

[0009] In some embodiments disclosed in the first aspect of this application, the association information of the group members includes: the relationship between the group member and its inviter as child node and parent node in the tree structure; the relationship between the group member and its invitee as parent node and child node in the tree structure; the relationship between the group member and other invitees of its inviter as sibling nodes in the tree structure; and the relationship between the group member and the invitees of its descendant nodes as ancestor nodes and descendant nodes in the tree structure.

[0010] In some embodiments disclosed in the first aspect of this application, the constraint includes: when it is determined that the group member is a child node of the root node, the supply resources matched for the group member come from the group member itself, its sibling nodes, or its descendant nodes.

[0011] In some embodiments disclosed in the first aspect of this application, the constraint includes: when it is determined that the group member is not a child node of the root node, the supply resources matched for the group member come from the group member itself, its ancestor node, or its descendant node.

[0012] In some embodiments disclosed in the first aspect of this application, the step of matching resources for each member based on the tree structure and the resource requirements of each member in the group using preset constraints to meet the resource requirements of each member includes: obtaining a matching ring to match supply resources that meet the resource requirements of each member in the matching ring.

[0013] In some embodiments disclosed in the first aspect of this application, the step of matching resources for each member based on the tree structure and the resource requirements of each member in the group using preset constraints includes: deleting the node corresponding to the matching ring from the tree structure to update the tree structure, and repeatedly obtaining the matching ring based on the updated tree structure until supply resources that meet the resource requirements of each member in the group are matched.

[0014] In some embodiments disclosed in the first aspect of this application, the step of matching supply resources to each member in the matching ring to meet their resource needs by obtaining a matching ring includes: obtaining at least one matching ring under the constraints of the constraints based on the tree structure and the resource needs of each member in the group; the matching ring includes at least one node representing a member and a directed edge connecting the node; and matching supply resources to the members in the matching ring to meet their resource needs according to the direction of the directed edge.

[0015] In some embodiments disclosed in the first aspect of this application, when it is determined that the matching ring includes only one node, the directed edge is the edge from that node to itself.

[0016] In some embodiments disclosed in the first aspect of this application, the step of obtaining at least one matching cycle under the constraints of the constraints based on the tree structure and the resource requirements of each member in the group includes: under the constraints of the constraints, in the process of matching resources for each member in turn according to their resource requirements, if it is determined that the resources that two members tend to match belong to the same node, and the two members are in the relationship of ancestor node and descendant node, the resources that they tend to match are adjusted, or the resources are matched for the owner of the resources that the same node tends to match using the cycle condition; the above steps are repeated until resources are matched for each member in the group, and at least one matching cycle is formed in the tree structure.

[0017] In some embodiments disclosed in the first aspect of this application, the step of adjusting the supply resources to be matched includes: when it is determined that the supply resources to be matched by two group members belong to the same node, and the two group members are in the relationship of ancestor node and descendant node, and the ancestor node and the same node are also in the relationship of ancestor node and descendant node, adjusting the supply resources to be matched by the descendant node, so as to match the descendant node with the supply resources held by other nodes according to the descendant node's preference priority.

[0018] In some embodiments disclosed in the first aspect of this application, the step of adjusting the supply resources to be matched includes: when it is determined that the supply resources to be matched by two group members belong to the same node, and the two group members are in the relationship of ancestor node and descendant node, and the descendant node and the same node are also in the relationship of ancestor node and descendant node, adjusting the supply resources to be matched by the ancestor node, so as to match the ancestor node with the supply resources held by other nodes according to the ancestor node's preference priority.

[0019] In some embodiments disclosed in the first aspect of this application, the step of matching supply resources for the owner of the supply resources that the same node tends to match using the ring formation condition includes: when it is determined that the supply resources that two group members tend to match belong to the same node, and the two group members are in the relationship of ancestor node and descendant node, and the same node belongs to the descendant node of the ancestor node, and the same node does not belong to the descendant node of the descendant node, matching supply resources for the owner of the supply resources that the same node tends to match according to the ring formation condition to form a matching ring including the owner.

[0020] In some embodiments disclosed in the first aspect of this application, the ringing condition includes: when the owner of the supply resources that the same node tends to match is the ancestor node of the ancestor node of the two group members, then the supply resources matched for the owner come from the ancestor node of the two group members or its ancestor node.

[0021] In some embodiments disclosed in the first aspect of this application, the ringing condition includes: when the owner of the supply resources that are tended to be matched for the same node is a descendant node of a descendant node of the two group members, then the supply resources matched for the owner come from the descendant nodes of the two group members or their descendant nodes.

[0022] In some embodiments disclosed in the first aspect of this application, the method further includes sending the supply resources matched to a group member and their owners, as well as the matchers of the supply resources held by the group member, to the group member.

[0023] A second aspect of this application discloses a group resource matching system, comprising: a construction module for constructing a tree structure based on the association information of each member in the group; wherein the tree structure includes a root node representing a social platform, and multiple parent nodes and multiple child nodes derived from the root node representing members; each member in the group holds a supply resource and a preset resource demand, and the resource demand is configured with a preference priority; the preference priority is configured based on the supply resources held by at least some members in the group; an acquisition module for acquiring the resource demand of the member corresponding to each node; and a matching module for matching resources for each member based on the tree structure and the resource demand and preference priority of each member in the group, using preset constraints to satisfy the resource demand of each member; wherein the constraints are used to limit the supply resources that can be matched for each member.

[0024] A third aspect of this application discloses a computer device, comprising: an interface device for acquiring the resource needs of each member in a group; a storage device for storing a computer program; and a processing device communicatively connected to the interface device and the storage device for running the computer program to execute the group resource matching method disclosed in the first aspect of this application.

[0025] The fourth aspect of this application discloses a computer-readable storage medium storing at least one computer program that is used to perform the group resource matching method disclosed in the first aspect of this application.

[0026] The fifth aspect of this application discloses a computer program product that, when run on a computer, causes the computer to perform a group resource matching method as disclosed in the first aspect of this application.

[0027] In summary, the group resource matching method, group resource matching system, computer device, computer-readable storage medium, and computer program product disclosed in this application, by determining the association information of each member in the group, constructing a tree structure based on the association information, and matching resources for each member based on the tree structure and the resource needs and priority preferences of each member in the group, using preset constraints to meet the resource needs of each member, can quickly and efficiently obtain satisfactory matching results for those exchanging items when there are many members in the group or when the scope of resource exchange is large. In the matching process provided by this application, if the supply resources that two group members prefer to match belong to the same node, and the nodes corresponding to the two group members are in the relationship of ancestor node and descendant node, the supply resources that they prefer to match will be adjusted, or the supply resources will be matched to the owner of the supply resources that the same node prefers to match according to the preset cycle conditions. By adjusting the matching conflict, this application can ensure that group members do not invite invitees (such as friends on the same social platform as the group members) to join the group without preference and avoid each group member from falsely reporting preferences to gain benefits. It can also achieve fast and efficient matching, that is, to generate more exchanges of resources within the group and to ensure that the results (supply resources) allocated to each group member can meet their resource needs to the greatest extent. Attached Figure Description

[0028] The specific features of the invention involved in this application are shown in the appended claims. The features and advantages of the invention can be better understood by referring to the exemplary embodiments and drawings described in detail below. A brief description of the drawings is as follows:

[0029] Figure 1 This is a schematic diagram showing the interface of a registered user clicking on the group link in one embodiment of this application.

[0030] Figure 2 The diagram shown is an interactive interface diagram of the target registered user in one embodiment of this application.

[0031] Figure 3 The diagram shown is a schematic representation of the request submission interface in one embodiment of this application.

[0032] Figure 4 This is a schematic diagram illustrating the resource requirements of group members within a group in one embodiment of this application.

[0033] Figure 5 The diagram shown is a schematic block diagram of a computer device according to one embodiment of this application.

[0034] Figure 6 The flowchart shown is a group resource matching method based on a social platform according to one embodiment of this application.

[0035] Figure 7 The diagram shown is a schematic representation of a tree structure constructed based on association information in one embodiment of this application.

[0036] Figure 8 The diagram shown is a schematic representation of a matching ring in one embodiment of this application.

[0037] Figure 9 This diagram illustrates the matching of supply resources in one embodiment of the present application before adjustments are made to the supply resources that the descendant nodes tend to match.

[0038] Figure 10 This diagram illustrates the matching of supply resources in one embodiment of the present application before adjustments are made to the supply resources that the ancestor node tends to match.

[0039] Figure 11a and 11b The diagrams shown are schematics illustrating that the supply resources that two group members tend to match belong to the same node in different embodiments of this application.

[0040] Figure 12 This application is based on Figure 4 A schematic diagram of the tree structure constructed from the association information of each member in the illustrated embodiment.

[0041] Figure 13 This application is based on Figure 4 Resource requirements in the illustrated embodiments and Figure 12 A schematic diagram of at least one matching loop obtained from the tree structure of the illustrated embodiment.

[0042] Figure 14 This application will be displayed as Figure 13 A schematic diagram of the updated tree structure obtained after the matching loop in the illustrated embodiment is deleted from the tree structure.

[0043] Figure 15 This application is based on Figure 13 A schematic diagram of the matching ring re-obtained from the tree structure in the illustrated embodiment.

[0044] Figure 16 The diagram shown is a structural block diagram of a group resource matching system according to one embodiment of this application.

[0045] Figure 17 This diagram illustrates how the number of exchanges completed using different matching methods varies with the number of members in the group.

[0046] Figure 18 This is a diagram showing how the average improvement value of different matching methods changes with the number of members in the group. Detailed Implementation

[0047] The following specific embodiments illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification.

[0048] The present application will be further described in detail below with reference to the accompanying drawings and specific embodiments. The technical solutions in the embodiments of the present application are clearly and completely described. Obviously, the described embodiments are only a part of the embodiments of the present application, not all of them. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present application. The terms "an embodiment," "implementation," or similar wording used throughout this specification mean that a specific feature, structure, or characteristic described together with an implementation is included in at least one embodiment of the present application. Therefore, throughout the entire specification, the phrases "in an embodiment," "in an implementation," and similar wording may (but do not necessarily) refer to the same implementation.

[0049] As described in the background section, in existing technologies, bartering is generally based on mutual exchange and communication. Therefore, when the scope of the exchange is large, i.e., when there are many participants, each participant needs to communicate with multiple participants based on their own preferences, and it is difficult to successfully exchange items. In other words, it is difficult for participants to efficiently find suitable exchange partners. Therefore, how to provide a group resource matching method to solve the problems of low resource matching efficiency, unstable matching results, and long matching process that leads to a large amount of network resource consumption and is not conducive to optimizing computer computing resources in social platforms is the technical problem to be solved by this application.

[0050] In view of this, this application proposes a group resource matching method, a group resource matching system, a computer device, a computer-readable storage medium, and a computer program product based on a social platform. By determining the association information of each member in the group, a tree structure is constructed based on the association information. Based on the tree structure and the resource needs and priority preferences of each member in the group, resources are matched for each member using preset constraints to meet their resource needs. This achieves a fast, efficient, and automatic matching result for members when there are many members in the group or when the resource exchange range is large, without requiring members to communicate and exchange items with other members multiple times.

[0051] The social platform can be configured in the user's electronic device for user use and interaction between users. The electronic device may be, for example, a portable mobile terminal including but not limited to smartphones, tablets, and smartwatches, or an office terminal such as a desktop computer or laptop. It should be understood that the various components of the electronic device of this application can be implemented using hardware, software, or a combination of hardware and software, including one or more signal processing and / or application-specific integrated circuits.

[0052] The social platform refers to a platform that connects users via the internet or mobile networks to provide interactive services. In other words, registered users on the platform can make friends and interact with other registered users, and interact with their friends, such as colleagues sending messages (e.g., links, applications, text, pictures, videos, etc.). In some embodiments, the social platform can also provide services such as shopping, bartering, payment, location services, and customer relationship management. Examples of such social platforms include Facebook, Twitter, WeChat, QQ, TikTok, Weibo, and LinkedIn. In one embodiment, the social platform can also allow registered users to generate links to applications on the platform and send them to their friends on the platform or to friends on other platforms via message sending or status sharing (e.g., posting on WeChat Moments or Weibo).

[0053] In one embodiment, the social platform creates groups by publishing group links. Specifically, the social platform publishes the group links to a subset of registered users on the platform. In one example, the social platform may send group links to registered users belonging to the same region, such as those divided by administrative regions (country, province, prefecture-level city, county, or township) to form groups. In other examples, the social platform may also send the group links to registered users with a tendency to barter, such as those who have viewed articles / videos related to bartering. However, this is not a limitation; in other embodiments, the social platform may also randomly send the group links to registered users on the platform.

[0054] The group link is a channel or network link through which registered users on the social platform join the group. In other words, after receiving the group link, registered users on the social platform can choose to join or not join the group. Users can join the group by confirming their participation using the group link. In one embodiment, registered users joining the group also need to meet preset joining conditions. These joining conditions include the user inputting and submitting the resources they possess.

[0055] For example, please see Figure 1 The figure shows a schematic diagram of the interface of a registered user clicking the group link in one embodiment of this application. As shown in the figure, the user enters the supply resources he / she owns in the input box, such as the name of the supply resources and uploads the pictures / videos of the supply resources. Then the registered user can join the group after clicking the submit and join button.

[0056] Furthermore, members who have joined the group can continue to invite registered users on the social media platform to join the group. In one example, a member of the group can act as an inviter by sharing a link on the social media platform to invite invitees to join the group. For example, a member of the group can share a link in their social media feed.

[0057] In another example, group members can also invite invited users to join the group by sending a link to a target registered user on the social platform. This link can be a group link posted on the social platform as mentioned above, or a new invitation link generated after the member joins the group. The target registered user can be a user within the group members' social network, such as a friend, relative, or colleague. See also... Figure 2 The figure shows a schematic diagram of the interactive interface of the target registered user in one embodiment of this application. As shown, group member Y, as the inviter, sends a link to his friend U to invite his friend U to join the group.

[0058] In one embodiment, the number of members in the group is preset by the social platform. For example, when the number of members in the group reaches the preset number after mutual invitations among members, the group is formed and the social platform-based group resource matching method described in this application can begin to match and supply resources to the members in the group. For example, the preset number is 20, 40, 60, 80, 100, or more. In another embodiment, the social platform presets a group creation time, and the group is formed when the preset group creation time is reached.

[0059] In summary, each member of the group is a registered user on the social platform, and each member possesses a supply resource available for exchange. It should be noted that the supply resource can be provided to the social platform before a member joins the group; for example, by submitting relevant information about the supply resource (e.g., its name, photo, video, description, etc.) to the social platform before joining the group, or it can be provided to the social platform after a member joins the group.

[0060] The supply resources are exchangeable resources. These resources can be physical items, such as daily necessities, appliances, books, clothing, and electronic devices, or virtual products, such as training courses, memberships, phone top-ups, and game equipment. Of course, the resource matching method provided in this application can also be applied to housing / dormitory allocation scenarios, or to medical scenarios such as organ transplantation.

[0061] In one embodiment, each member within the group also has a pre-defined resource requirement, and this resource requirement is configured with a preference priority. A member's resource requirement represents a range of available resources that the member desires. In other words, a member's resource requirement constitutes a range of available resources to be allocated to that member; that is, during the subsequent allocation process of the group resource matching method, each member is allocated a resource according to their resource requirement. The preference priority is based on the resource allocation of at least some members within the group. Specifically, each member prioritizes the resource allocation of at least some members according to their own preferences, thus obtaining a resource requirement configured with a preference priority.

[0062] In one embodiment, the resource requirements preset by the group members include their own supply resources. Furthermore, the supply resources of the group members themselves have the lowest priority in their resource requirements. This allows the group resource matching process to end if the group resource matching method fails to match them with supply resources from other group members, by maintaining their own supply resources and not exchanging them.

[0063] In one embodiment, group members can browse the resources submitted by other group members on a social media platform and preset their resource requirements based on the resources they browse. For example, after browsing some or all of the resources, they can submit their resource requirements to the social media platform through a request submission interface. Please refer to [link to relevant documentation]. Figure 3 The figure shows a schematic diagram of the request submission interface in one embodiment of this application. As shown, after the user clicks the Add Request button, the interface displays the various supply resources in the group. Then, clicking the Priority button allows the user to sort the selected supply resource. After selecting the Continue Submit Request button, the user can continue to select the next supply resource and configure its priority. If the user selects the End and Submit button, the configuration of the resource request is completed.

[0064] For further information, please refer to [link / reference]. Figure 4 The figure shows a schematic diagram of the resource requirements of group members in one embodiment of this application. As shown, there are 10 members in the group. Member M1 holds resource h1, member M2 holds resource h2, member M3 holds resource h3, member M4 holds resource h4, member M5 holds resource h5, member M6 holds resource h6, member M7 holds resource h7, member M8 holds resource h8, member M9 holds resource h9, and member M10 holds resource h10. Each member has a preset resource requirement. For example, in one case, member M1's resource requirement is: h7 > h8 > h1. That is, member M1 wants to exchange either resource h7 held by member M7 or resource h8 held by member M8. Moreover, member M1 prefers resource h7 to resource h8. If neither resource h8 nor resource h7 can be allocated to member M1, member M1 retains their own resource h1.

[0065] Please see Figure 5 The figure shows a schematic block diagram of a computer device according to one embodiment of this application. As shown, the computer device 1 includes an interface device 10, a storage device 11, and a processing device 12. The computer device is exemplified as a server / server cluster of the social platform.

[0066] The interface device 10 is used to receive resource requests from each group member. In one embodiment, the interface device 10 is also used to send the supply resources matched to a group member and their owners, as well as the matchers of the supply resources held by that group member, to that group member. For example, the interface device includes, but is not limited to, serial interfaces such as HDMI or USB interfaces, or parallel interfaces. In one embodiment, the interface device further includes a network communication unit, which is a device for data transmission using wired or wireless networks, examples of which include, but are not limited to, integrated circuits containing network cards, local area network modules such as WiFi modules or Bluetooth modules, and wide area network modules such as mobile networks.

[0067] The storage device 11 is used to store at least one computer program. In one embodiment, the storage device 11 may also be used to store resource requirements, tree structure, association information, etc., for each member described below. The storage device 11 includes, but is not limited to, read-only memory, random access memory, and non-volatile memory. For example, the storage device 11 includes flash memory or other non-volatile solid-state storage devices. In some embodiments, the storage device 11 may also include memory remote from one or more processing devices, for example, network-attached memory accessed via RF circuitry or external ports and communication networks, wherein the communication network may be the Internet, one or more intranets, local area networks, wide area networks, storage area networks, etc., or suitable combinations thereof. The storage device 11 also includes a memory controller that controls access to the memory by components of the computer device, such as the central processing unit and interface devices, or other components. In some embodiments, the memory may include Random Access Memory (RAM), Read Only Memory (ROM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), etc. The memory is used to store programs (e.g., group resource matching programs), which the processor executes upon receiving an execution instruction.

[0068] The processing device 12 is communicatively connected to the storage device 11 and the interface device 10. The processing device 12 is used to run the computer program to execute the group resource matching method. The processing device 12 includes one or more processors. The processing device 12 is operatively capable of performing data read and write operations with the storage device 11. The processing device 12 performs operations such as data compression, data encoding, and data decoding. The processing device 12 includes one or more general-purpose microprocessors, central processing units, one or more dedicated processors, one or more digital signal processors, one or more field-programmable logic arrays, or any combination thereof. In some embodiments, the processor includes an integrated circuit chip with signal processing capabilities; or a general-purpose processor, for example, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a discrete gate or transistor logic device, or a discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor, etc.

[0069] The group resource matching method based on social platforms described in this application can be executed by the computer device 1 mentioned above or other computer devices capable of performing the relevant steps of the group resource matching method.

[0070] In one embodiment, please refer to Figure 6 The figure shows a flowchart of a group resource matching method based on a social platform in one embodiment of this application. As shown in the figure, the group resource matching method includes steps S110 to S130.

[0071] In step S110, the computer device constructs a tree structure based on the association information of each member in the group.

[0072] In one embodiment, the computer device can obtain the inviter and invitees of each member in the group. A member joins the group based on a link shared or sent by their inviter, and that member also shares or sends a link to invite their invitees to the group. Furthermore, the association information of each member can be determined based on their inviters and invitees.

[0073] The association information for each member in the group includes: the relationship between the member and its inviter as child and parent nodes in the tree structure; the relationship between the member and its invitees as parent and child nodes in the tree structure; the relationship between the member and other invitees of its inviter as sibling nodes in the tree structure; and the relationship between the member and the invitees of its descendant nodes as ancestor and descendant nodes in the tree structure. It should be noted that the parent-child node relationship is an ancestor-descendant relationship. Accordingly, a member is a child node of its inviter, a parent node of its invitees, and a sibling node of its inviter's other invitees. The child nodes of a member, the child nodes of its child nodes, and so on, are all descendant nodes of that member.

[0074] A tree structure can be constructed based on the aforementioned association information. In one embodiment, the tree structure includes a root node representing the social platform, and multiple parent nodes and multiple child nodes derived from the root node representing group members. In the following embodiments, the nodes representing group members in the tree structure may also be referred to as group members.

[0075] Please see Figure 7 The figure shows a schematic diagram of a tree structure constructed based on association information in one embodiment of this application. As shown, the social platform is the root node of the tree structure. The social platform and its invitees (members M1 and M2) have a parent-child relationship in the tree structure, that is, the invitees (members M1 and M2) are child nodes of the social platform. Member M1 and its invitee (member M3) have a parent-child relationship in the tree structure, that is, member M1 is the parent node of member M3, and member M3 is the child node of member M1. Member M3 and the other invitees of its inviter (member M1) (member M4) have a sibling relationship in the tree structure, that is, member M4 is the sibling node of member M3. Member M3 and its invitee (member M5) have a parent-child relationship in the tree structure, that is, the invitee (member M5) is a child node of member M3. In the tree structure, member M1 and its descendant nodes (members M3, M4, and M5) are all ancestor and descendant nodes. For example, member M1 can be called the ancestor node of members M3, M4, and M5, while member M5 can be called the descendant node of members M3 and M1. It should be understood that ancestor and descendant nodes are relative concepts and do not specifically represent a fixed parent-child generation distance or grandparent-grandchild generation distance.

[0076] In one embodiment, the computer device can sequentially number each node while constructing the tree structure. The number can be a number arranged in sequence such as 1, 2, 3, 4, or 5, or a letter arranged in sequence such as a, b, c, or d. For example, the node corresponding to each member can be numbered based on the time they entered the group. For instance, member K1 entered the group first, so their number is 1, and so on.

[0077] In step S120, the computer device obtains the resource requirements of the group members corresponding to each node.

[0078] In this process, the resource requirements of each group member are stored in the storage device 11 of the computer device. When the computer device executes the group resource matching method of this application, it determines the group member corresponding to each node in the tree structure, and then obtains the resource requirements of the corresponding group member from the storage device 11 for the computer device to execute step S130.

[0079] In step S130, the computer device, based on the tree structure and the resource requirements of each member in the group, uses preset constraints to match resources for each member to meet their resource requirements.

[0080] In one embodiment, when matching resources for a group member, the computer device supplies resources to the group member according to the group member's resource needs under the constraints stated therein. Specifically, if the highest priority resource among the group member's resource needs does not meet the constraints, then the next highest priority resource among the group member's resource needs is sequentially selected and matched to the group member. Please continue reading. Figure 4 If the supply resource h7 cannot be allocated to member M1, that is, if the allocation of supply resource h7 to member M1 does not meet the constraint condition, the next priority supply resource h8 is selected sequentially and the supply resource h8 is allocated to member M1 until the supply resource matched for the member meets the constraint condition.

[0081] The constraints are used to limit the supply resources that can be matched for each member. In one embodiment, the constraints include: when it is determined that the member is a child node of the root node, the supply resources matched for the member come from the member itself, its sibling nodes, or its descendant nodes; when it is determined that the member is not a child node of the root node, the supply resources matched for the member come from the member itself, its ancestor nodes, or its descendant nodes.

[0082] For example, please continue reading Figure 7As shown in the figure, when member M1 is a child node of the root node, the resources supplied to member M1 come from members M1, M2, M3, M4, and M5. When member M3 is not a child node of the root node, the resources supplied to member M3 come from members M1, M3, and M5.

[0083] Although this application uses the above embodiments to illustrate the limitations of the constraints on the supply resources that can be matched for each member, it is not limited thereto. In other embodiments, the two cases existing in the constraints described in the above embodiments can also be used individually. For example, when it is determined that the member is a child node of the root node, the restrictions on the corresponding member are the same as those in the above embodiments. When it is determined that the member is not a child node of the root node, the restrictions on the corresponding member are different from those in the above embodiments. For example, when it is determined that the member is not a child node of the root node, the supply resources matched for the member can come from the member's sibling nodes.

[0084] In one embodiment, step S130 includes steps S131 and S132.

[0085] In step S131, the computer device matches each member in the matching ring with supply resources that meet their resource needs by obtaining a matching ring. The matching ring includes at least one node representing a member and directed edges connecting the nodes. Specifically, when the matching ring includes two or more nodes, each node in the matching ring has a unique directed edge pointing to other nodes, and each node also has a unique directed edge pointing to itself. When the matching ring includes only one node, the directed edge is the edge from that node to itself. In other words, each member within the matching ring can be matched with a unique supply resource.

[0086] Please see Figure 8 The figure shows a schematic diagram of a matching ring in one embodiment of this application. Figure 8 The dashed lines pointing from one node to another represent directed edges. The graph includes three matching cycles: members M1, M3, and M5 can form one matching cycle, and members M4 and M2 can each form a matching cycle. In embodiments of this application, the matching cycle can include two or more members, thereby enabling the exchange of resources between two or more members, for example... Figure 8As shown, members M1, M3, and M5 form a matching loop. The computer device allocates the supply resources of member M1 to member M5, allocates the supply resources of member M3 to member M1, and allocates the supply resources of member M5 to member M3. Compared with the mutual exchange of supply resources between two members, this can increase the number of supply resource exchanges and the exchange efficiency.

[0087] In one embodiment, step S131 includes steps S1310 and S1311. Through steps S1310 and S1311, at least one matching ring can be obtained, and supply resources that meet the resource needs of each member in the matching ring can be matched.

[0088] In step S1310, the computer device obtains at least one matching cycle based on the tree structure and the resource requirements of each member in the group under the constraints of the constraints.

[0089] In one embodiment, step S1310 includes steps S1310a and S1310b.

[0090] In step S1310a, under the constraints of the constraints, the computer device, in the process of matching and supplying resources to each group member according to the resource needs of each group member, determines that when the supply resources that two group members tend to match belong to the same node, and the two group members are in the relationship of ancestor node and descendant node, the supply resources that tend to match are adjusted, or the supply resources are matched to the owner of the supply resources that the same node tends to match according to the cycle condition.

[0091] In step S1310b, step S1310a is repeated until a supply resource is matched for each member in the group, and at least one matching cycle is formed in the tree structure.

[0092] Specifically, the computer device randomly selects nodes in the tree structure or selects nodes according to their numbers in the tree structure, and then sequentially matches resources to each member based on the selected nodes. For example, if the numbers in the tree structure start from 1, the computer device matches resources to each member sequentially from the node represented by number 1. Alternatively, nodes can be randomly selected each time, and then matched sequentially. Furthermore, in the process of allocating resources to each member according to their resource needs, the matching of resources is based on the priority of the members' resource needs and the constraints. If two members' preferred resources belong to the same node, and the two members are in an ancestor-descendant relationship, then the preferred matching resources need to be adjusted, or resources need to be matched to the owner of the preferred matching resources of the same node according to preset cycle conditions. The nodes corresponding to the adjusted preferred matching resources and the nodes corresponding to the allocated but not adjusted preferred matching resources form at least one matching cycle in the tree structure. The supply resources matched to the preferences of a group member are those matched to that group member according to the constraints and the corresponding preference priority.

[0093] In one embodiment, when it is determined that the supply resources that two group members tend to match belong to the same group member of the same node, and the two group members are in the relationship of ancestor node and descendant node, and the ancestor node and the same node are also in the relationship of ancestor node and descendant node, the supply resources are adjusted to be matched with the supply resources held by other nodes according to the preference priority of the descendant node.

[0094] Please see Figure 9 The figure shows a schematic diagram of the matching of supply resources in one embodiment of this application before adjusting the supply resources to be matched with the descendant nodes. As shown in the figure, the supply resources that members M3 and M5 are matched with belong to the same member M1, and members M3 and M5 are ancestor nodes and descendant nodes. Since the same member M1 and member M3 are ancestor nodes and descendant nodes, it is necessary to match the next priority supply resources for member M5 according to the resource requirements of member M5.

[0095] In one embodiment, when it is determined that the supply resources that two group members tend to match belong to the same group member of the same node, and the two group members are in the relationship of ancestor node and descendant node, and the descendant node and the same node are also in the relationship of ancestor node and descendant node, the supply resources are adjusted to be matched with the supply resources held by other nodes according to the preference priority of the ancestor node.

[0096] Please see Figure 10 The figure shows a schematic diagram of the supply resource matching situation before the supply resources are adjusted to be matched with the ancestor node in one embodiment of this application. As shown in the figure, the supply resources that members M1 and M3 are inclined to match belong to the same member M5, and members M1 and M3 are ancestor node and descendant node. Member M3 and the same member M5 are also ancestor node and descendant node. Therefore, it is necessary to sequentially match the next preferred priority supply resources for member M1 according to the resource requirements of member M1.

[0097] In one embodiment, when it is determined that the supply resources that two group members tend to match belong to the same node, and the two group members are in the relationship of ancestor node and descendant node, and the same node is a descendant node of the ancestor node, and the same node is not a descendant node of the descendant node, the supply resources are matched with the owner of the supply resources that the same node tends to match according to the preset ring formation conditions to form a matching ring including the owner.

[0098] Please see Figure 11a and 11b The figures illustrate how, in different embodiments of this application, the supply resources that two group members tend to match belong to the same node. For example, when the supply resources that group members M3 and M11 tend to match belong to the same group member M7, and group members M3 and M11 are ancestor and descendant nodes respectively, and the same node (group member M7) is a descendant node of the ancestor node (group member M3) but not a descendant node of the descendant node (group member M11), supply resources are matched to the owner of the supply resources that the same node (group member M7) tends to match according to preset ring-forming conditions to form a matching ring including the owner. For example, as shown... Figure 11a As shown, if the owner of the supply resources that the same node (member M7) prefers to match is member M1, then supply resources need to be matched for member M1 according to the ring formation conditions to form a matching ring including member M1. For example, as... Figure 11b As shown, if the owner of the supply resources that the same node (member M7) tends to match is member M13, then the supply resources need to be matched for member M13 according to the ring formation conditions to form a matching ring that includes member M13.

[0099] The ring-forming conditions include: when the owner of the supply resources that the same node tends to match is an ancestor node of the ancestor node of the two group members, then the supply resources matched for the owner come from the ancestor node of the two group members or its ancestor node. When the owner of the supply resources that the same node tends to match is a descendant node of the descendant node of the two group members, then the supply resources matched for the owner come from the descendant node of the two group members or its descendant node.

[0100] Specifically, based on the above-mentioned loop-forming conditions and the resource needs of the owners of the supply resources that the same node tends to match, supply resources are matched for that owner. In the process of matching supply resources for that owner, since the owner can also match its own supply resources, it can be guaranteed that a matching loop including that owner can be formed through the above-mentioned loop-forming conditions.

[0101] For example, please continue reading Figure 11a The owner of the supply resources that the same node tends to match is member M1. Since member M1 is the ancestor node of the ancestor node of the two members (member M3), the supply resources matched for member M1 come from member M3 or the ancestor node of member M3. The specific node selected for allocation to member M1 can be determined based on the priority of member M1's resource needs.

[0102] For example, please continue reading Figure 11b The owner of the supply resources that the same node tends to match is member M13. Since member M13 is a descendant node of the descendant node (member M11) of the two members, the supply resources matched for member M13 come from member M11 or a descendant node of member M11. The specific node selected for allocation to member M13 is determined based on the priority of member M13's resource demand.

[0103] In one specific embodiment, please refer to Figure 4 , Figure 12 and Figure 13 , Figure 12 This application is based on Figure 4 The illustrated embodiment is a tree structure diagram showing the association information of each member. Figure 13 This application is based on Figure 4 Resource requirements in the illustrated embodiments and Figure 12The illustrated embodiment shows a schematic diagram of at least one matching cycle obtained from the tree structure. As shown, the computer device starts executing step S1310a from the group member M1 invited from the social platform. Among the resource needs of group member M1, the preferred priority of supplying resource h7 is the highest, and the supplying resource h7 is allocated to group member M1 to satisfy the constraint condition that group member M1 is a child node of the root node and the owner of the supplying resource h7 is a descendant node of group member M1. Therefore, the supplying resource h7 is the supplying resource that group member M1 prefers to match.

[0104] Repeat step S1310a to continue allocating supply resources to member M2. Among the resource requirements of member M2, the preference for supply resource h1 is the highest, and the supply resource h1 is allocated to member M2 to satisfy the constraint condition, that is, the owner of supply resource h1 is the sibling node of member M2. Then, supply resource h1 is the supply resource that member M2 prefers to match.

[0105] Repeat step S1310a to continue allocating supply resources to member M3. Among the resource needs of member M3, the preference for supply resource h6 is the highest, and the supply resource h6 is allocated to member M3 to satisfy the constraint condition. Then, the supply resource h6 is the supply resource that member M3 prefers to match.

[0106] Repeat step S1310a to continue allocating supply resources to member M4. Among the resource needs of member M4, supply resource h9 has the highest priority. However, allocating supply resource h9 to member M4 does not satisfy the constraint condition. Similarly, allocating supply resource h3 to member M4 does not satisfy the constraint condition. Therefore, according to the order of the resource needs of member M4, the next priority supply resource h4 is selected and matched to member M4.

[0107] Repeat step S1310a to continue allocating supply resources to member M5. Among the resource needs of member M5, the preference for supply resource h2 is the highest. If the supply resource h2 is allocated to member M5 to satisfy the constraint condition, then the supply resource h2 is the supply resource that member M5 prefers to match.

[0108] Repeat step S1310a to continue matching resources for member M6. Among member M6's resource needs, the preference for supplying resource h1 has the highest priority, and resource h1 is allocated to member M6 to satisfy the constraint. Although the supply resources preferred by members M6 and M2 belong to the same member M1, members M6 and M2 are not in an ancestor-descendant relationship, so no adjustment is needed to the supply resources preferred by members M6 and M2.

[0109] Repeat step S1310a to continue matching resources for member M7. Among the resource requirements of member M7, the preferred priority of supplying resource h4 is the highest. However, member M4 is not an ancestor node or a descendant node of member M7. Therefore, allocating the supply of resource h4 to member M7 does not satisfy the constraint condition. According to the order of the resource requirements of member M7, the next priority supply of resource h3 is selected and matched to member M7.

[0110] Repeat step S1310a to continue matching resources for member M8. If the supply resource h10 is allocated to member M8 to satisfy the constraint condition, then the supply resource h10 is the supply resource that member M8 prefers to match.

[0111] Repeat step S1310a to continue matching resources for member M9. Since assigning either resource h3 or resource h4 to member M9 does not satisfy the constraint, the next priority resource h2 is selected according to the resource requirements of member M9 and matched to member M9. However, since the resource that member M9 and member M5 prefer to match belongs to the same member M2, and member M9 and member M5 are not in an ancestor-descendant relationship, but the ancestor node and the same member M2 are also in an ancestor-descendant relationship, the resource is adjusted to the resource that the descendant node prefers to match. That is, the resource that member M5 prefers to match is not changed, but the resource that member M9 prefers to match is adjusted. When the next priority resource h7 is selected according to the resource requirements of member M9 and matched to member M9, since the constraint is not satisfied, the next priority resource h9 is selected according to the resource requirements of member M9 and matched to member M9.

[0112] Repeat step S1310a to continue matching resources for member M10. If the supply resource h5 is allocated to member M10 to satisfy the constraint condition, then the supply resource h5 is the supply resource that member M10 prefers to match.

[0113] Based on the above allocation, when resources are first matched to each member of the group, a matching cycle is formed among members M1, M3, M6, and M7. Member M4 forms a matching cycle on its own. Member M9 forms a matching cycle on its own.

[0114] Step S1311: Within the matching ring, according to the direction of the directed edge, supply resources that meet the resource needs of the group members within the ring are matched.

[0115] Specifically, in step S1310, at least one matching ring is formed. For each matching ring, according to the direction of the directed edge of the matching ring, supply resources that meet the resource needs of the members within the ring are matched. In one embodiment, the supply resources of the member pointed to by the directed edge are matched to another member connected by the directed edge. However, this is not a limitation; in other embodiments, the supply resources of another member connected by the directed edge may also be allocated to the member pointed to by the directed edge. For example, please continue to refer to... Figure 13 A matching cycle is formed among members M1, M3, M6, and M7. When matching resources to members within the cycle, the directed edge connecting member M1 and member M7 points from member M1 to member M7. In this case, the resources supplied by member M7 are matched to member M1. Similarly, the resources held by member M3 are matched to member M7, the resources held by member M6 are matched to member M3, and the resources held by member M1 are matched to member M6.

[0116] In step S132, the node corresponding to the matching ring is deleted from the tree structure to update the tree structure, and the matching ring is repeatedly obtained based on the updated tree structure until a supply resource that meets the resource needs of each member in the group is matched.

[0117] Specifically, all nodes in the matching loops obtained in step S131 are deleted from the tree structure, that is, the nodes corresponding to the group members matched with supply resources in step S131 are deleted from the tree structure, and then the tree structure is updated. The association information between nodes in the updated tree structure is the same as before the tree structure update. For example, in step S132, node W is deleted from the tree structure. Before deletion, node W and node Y were in a parent-child relationship; after deletion, node W and node Y remain in a parent-child relationship. The resources that the nodes in the updated tree structure previously tended to match are deleted. Step S131 is re-executed based on the updated tree structure until supply resources that meet the resource needs of each member represented by each node in the group are matched. For example, if there are still nodes not in the matching loops in the updated tree structure after re-executing step S131 based on the updated tree structure, the tree structure is updated again and step S131 is re-executed until supply resources that meet the resource needs of each member in the group are matched.

[0118] In one embodiment, please refer to Figures 13 to 15 and combined Figure 4 , Figure 14 This application will be displayed as Figure 13 The diagram shown illustrates the updated tree structure obtained after removing the matching loop from the tree structure in the illustrated embodiment. Figure 15 This application is based on Figure 13A schematic diagram of the matching cycle re-obtained from the tree structure in the illustrated embodiment is shown in the figure. Figure 13 The nodes corresponding to the three matching cycles in the tree structure are deleted. Figure 14 The nodes indicated by the dashed lines represent nodes that have been deleted from the tree structure, based on... Figure 14 The resource requirements of the tree structure and the remaining nodes in the tree structure are repeatedly executed in step S131.

[0119] For example, the computer device executes step S1310a starting with member M2. Since member M1 has already completed resource allocation, the next priority supply resource h8 in member M2's resource requirements is allocated to member M2. Furthermore, allocating supply resource h8 to member M2 satisfies the aforementioned constraint condition; therefore, supply resource h8 is the supply resource that member M2 prefers to match.

[0120] Repeat step S1310a to continue allocating supply resources to member M5. Among the resource needs of member M5, the preference for supply resource h2 is the highest. If the supply resource h2 is allocated to member M5 to satisfy the constraint condition, then the supply resource h2 is the supply resource that member M5 prefers to match.

[0121] Repeat step S1310a to continue allocating supply resources to member M8. Among the resource needs of member M8, the preference for supply resource h10 is the highest priority. If the supply resource h10 is allocated to member M8 to satisfy the constraint condition, then the supply resource h10 is the supply resource that member M8 prefers to match.

[0122] Repeat step S1310a to continue allocating supply resources to member M10. Among the resource needs of member M10, the preference of supply resource h5 is the highest, and the supply resource h5 is allocated to member M10 to satisfy the constraint condition. Then, the supply resource h5 is the supply resource that member M10 prefers to match.

[0123] Based on the above allocation, after the second matching of supply resources for group members, a matching ring is formed between the nodes corresponding to members M2, M5, M8, and M10. Then, step S1311 is executed, where supply resources that meet the resource needs of each member within the matching ring are matched according to the directions of the directed edges. Specifically, the supply resources of member M8 are matched to member M2, the resources held by member M2 are matched to member M5, the resources held by member M10 are matched to member M8, and the resources held by member M5 are matched to member M10. This completes the matching of supply resources that meet the resource needs of each member within the group.

[0124] In one embodiment, the group resource matching method further includes step S140, in which the computer device also sends the supply resources matched to a group member and their owners, as well as the matcher of the supply resources held by the group member, to the group member. In one example, the computer device sends the above information to the group member's social media platform so that the group member can clearly understand the supply resources matched to them and their owners, and which group member their supply resources are matched to, facilitating the exchange of supply resources among group members. For example, with Figure 15 Taking member M2 as an example, the computer device matches the supply resources of member M8 to member M2, and matches the supply resources of member M2 to member M5. The computer device also sends the relevant information of member M8 and supply resource h8 to member M2, and sends the relevant information of member M5 to member M2, so that member M2 and the above two members (member M8 and member M5) can communicate to exchange supply resources.

[0125] In one embodiment, an exchange is considered complete when a member in a group is assigned resources from other members, and those resources are subsequently allocated to other members. For example, member A is assigned resources from member B, and those resources are then allocated to member C. Similarly, member A is assigned resources from member B, and those resources are then allocated to member B. See also... Figure 17 The figure shows a schematic diagram illustrating the change in the number of exchanges completed using different matching methods as a function of the number of members in the group. The blue line represents the curve of the number of exchanges completed using the group resource matching method of this application as a function of the number of members in the group; the green line represents the curve of the number of exchanges completed using the Top Trading Cycle (TTC) algorithm as a function of the number of members in the group; and the orange line represents the curve of the number of exchanges completed using the Leave and Share algorithm (LaS) as a function of the number of members in the group. Figure 17 As shown, under the same conditions, the group resource matching method of this application completes more exchanges.

[0126] In one embodiment, a member's position promotion value is used to assess the degree of matching between the supplied resources assigned to that member and their resource needs. A higher position promotion value indicates a better match between the supplied resources assigned to that member and their resource needs. A member's position promotion value is the difference between the ranking of their own supplied resources and the ranking of the supplied resources they are assigned. For example, if a member receives the highest-ranking item in their resource needs, and their own supplied resources rank 3 in their resource needs, then their position promotion value is 2, i.e., 3 (their own supplied resource ranking) - 1 (the ranking of the supplied resources they are assigned) = 2. The average promotion value represents the average of the position promotion values ​​of all members in the group. Please refer to [link to relevant documentation]. Figure 18 The figure shows the average improvement value of different matching methods as a function of the number of members in the group. As shown, the blue line represents the curve of the average improvement value using the group resource matching method of this application as a function of the number of members in the group; the green line represents the curve of the average improvement value using the Top Trading Cycle (TTC) algorithm as a function of the number of members in the group; and the orange line represents the curve of the average improvement value using the Leave and Share algorithm (LaS) as a function of the number of members in the group. Figure 18 As shown, under the same conditions, the average improvement value of the group resource matching method of this application is higher, indicating that the supply resources allocated to each group member by the method of this application are highly matched with the resource needs of the group members.

[0127] This application also proposes a group resource matching system; please refer to [link / reference]. Figure 16 The figure shows a structural block diagram of a group resource matching system in one embodiment of the present application. As shown in the figure, the group resource matching system 20 includes a construction module 200, an acquisition module 201, and a matching module 202.

[0128] It should be understood that the building module 200, the acquisition module 201, and the matching module 202 can also be implemented in software running by different types of processors. For example, a module of executable code may include one or more physical or logical blocks of computer instructions organized as objects, programs, or functions. However, the executable files of the modules do not necessarily have to be physically located together, but may include different commands stored in different locations, which, when logically connected together, encompass the module and implement the specified objectives of the module.

[0129] Of course, the executable code module can be one or more instructions, and can even be distributed across several different code segments, different programs, and multiple storage devices. Similarly, computational data can be identified and represented within the module, and can be embodied in any suitable form and organized in any suitable data structure. The computational data can be collected as a single dataset, or can be distributed across different locations (including different storage devices), and can exist at least partially as electrical signals within a system or network. When the module or a portion thereof is implemented in software, the software portion is stored on one or more computer-readable media.

[0130] The construction module 200 is used to construct a tree structure based on the association information of each member in the group; wherein, the tree structure includes a root node for representing the social platform, and multiple parent nodes and multiple child nodes derived from the root node for representing the members; each member in the group holds a supply resource and a preset resource demand, and the resource demand is configured with a preference priority; the preference priority is based on the supply resource configuration held by at least some members in the group.

[0131] The acquisition module 201 is used to acquire the resource requirements of the corresponding group members for each node.

[0132] The matching module 202 is used to match resources for each member based on the tree structure and the resource needs and priority preferences of each member in the group, using preset constraints to meet the resource needs of each member; wherein, the constraints are used to limit the supply resources that can be matched for each member.

[0133] Here, the working method of each module in the group resource matching system of this application is the same as or similar to the corresponding steps in the group resource matching method based on the social platform mentioned above, and will not be repeated here.

[0134] This application also provides a computer-readable storage medium storing at least one computer program, which is used to execute the group resource matching method based on a social platform proposed in this application.

[0135] In the embodiments provided in this application, the computer-readable and writable storage medium may include read-only memory, random access memory, EEPROM, CD-ROM or other optical disc storage devices, disk storage devices or other magnetic storage devices, flash memory, USB flash drive, portable hard drive, or any other medium capable of storing desired program code in the form of instructions or data structures and accessible by a computer. Additionally, any connection may be appropriately referred to as a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium. However, it should be understood that computer-readable and writable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are intended for non-transient, tangible storage media. The disks and optical discs used in the application include compact discs (CDs), laser discs, optical discs, digital multifunction discs (DVDs), floppy disks, and Blu-ray discs, where disks typically copy data magnetically, while optical discs use lasers to copy data optically.

[0136] In one or more exemplary aspects, the functionality described in the computer program of the social platform-based group resource matching method of this application can be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, these functions can be stored or transmitted as one or more instructions or code onto a computer-readable medium. The steps of the methods or algorithms disclosed in this application can be embodied in processor-executable software modules, wherein the processor-executable software modules can reside on a tangible, non-transitory computer-readable and writable storage medium. The tangible, non-transitory computer-readable and writable storage medium can be any available medium accessible to a computer.

[0137] The flowcharts and block diagrams in the foregoing figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the figures. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented by a dedicated hardware-based system that performs the specified function or operation, or by a combination of dedicated hardware and computer instructions.

[0138] This application also provides a computer program product that, when run on a computer, causes the computer to execute the group resource matching method described in any embodiment of this application. Specifically, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer program product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application.

[0139] In summary, the group resource matching method, system, device, and medium disclosed in this application, based on a social platform, constructs a tree structure based on the association information of each member in the group, and matches resources to each member using preset constraints based on the tree structure and the resource needs and priorities of each member in the group. This achieves satisfactory matching results for exchangers quickly and efficiently, even when there are many members in the group or the scope of resource exchange is large. Furthermore, during the matching process, if two members prefer to match resources... When the sources belong to the same node, and the nodes corresponding to the two group members are in the relationship of ancestor node and descendant node, the supply resources that are preferred to be matched will be adjusted, or the supply resources will be matched to the owner of the supply resources that are preferred to be matched by the same node according to the preset ring conditions. By adjusting the matching conflict, this application can ensure that the group members do not invite the invitees (such as friends on the same social platform as the group members) to join the group without preference and avoid the group members from falsely reporting their preferences to benefit. It can also achieve more efficient matching, that is, it can generate more exchanges in the group and the results allocated to each group member can meet their needs to the greatest extent.

[0140] The above embodiments are merely illustrative of the principles and effects of this application and are not intended to limit this application. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of this application. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in this application should still be covered by the claims of this application.

Claims

1. A social platform based group resource matching method, characterized in that, The method comprises the following steps: constructing a tree structure based on the association information of each member in the group; wherein the tree structure comprises a root node representing the social platform, and a plurality of parent nodes and a plurality of child nodes derived from the root node, representing the members; each member in the group has a supply resource and a preset resource demand, and the resource demand is configured with a preference priority; the preference priority is configured based on the supply resource held by at least part of the members in the group; obtaining the resource demand of each member corresponding to each node; based on the tree structure and the resource demand and the preference priority of each member in the group, matching resources for each member to meet the resource demand of each member by using a preset constraint condition; wherein the constraint condition is used to limit the supply resource that can be matched by each member; based on the tree structure and the resource demand and the preference priority of each member in the group, matching resources for each member to meet the resource demand of each member by using a preset constraint condition comprises: under the constraint of the constraint condition, in the process of matching the supply resource for each member according to the resource demand of each member, when it is judged that the supply resource to which two members tend to match belongs to the same node, and the two members are in the relationship of ancestor node and descendant node, adjusting the supply resource to which the two members tend to match or matching the supply resource for the owner of the supply resource to which the same node tends to match by using a loop condition; repeating the above steps until the supply resource is matched for each member in the group, and at least one matching loop is formed in the tree structure; the matching loop comprises at least one node representing the member and a directed edge connecting the nodes; in the matching loop, the supply resource meeting the resource demand of the member in the loop is matched according to the direction of the directed edge; the nodes corresponding to the matching loop are deleted from the tree structure to update the tree structure, and based on the updated tree structure, the matching loop is repeatedly obtained until the supply resource meeting the resource demand of each member in the group is matched.

2. The group resource matching method of claim 1, wherein, The social platform forms a group in the form of publishing a group link, and each member in the group is a registered user on the social platform.

3. The group resource matching method of claim 2, wherein, The members in the group invite their invitees to enter the group to become members by sharing the link on the social platform or sending the link to the target registered user on the social platform.

4. The group resource matching method of claim 1, wherein, The resource demand preset by the member includes the supply resource of the member itself.

5. The group resource matching method of claim 1, wherein, The association information of the members in the group includes the relationship of the member and its inviter as a child node and a parent node in the tree structure, the relationship of the member and its invitee as a parent node and a child node in the tree structure, the relationship of the member and other invitees of its inviter as sibling nodes in the tree structure, and the relationship of the member and the invitees of the descendant node as an ancestor node and a descendant node in the tree structure.

6. The group resource matching method of claim 5, wherein, The constraint condition includes: when it is judged that the member is a child node of the root node, the supply resource matched for the member comes from the member itself, its sibling node, or its descendant node.

7. The group resource matching method of claim 5, wherein, The constraint condition comprises: when it is judged that the group member is not a child node of the root node, the supply resource matched for the group member comes from the group member itself, an ancestor node of the group member, or a descendant node of the group member.

8. The group resource matching method of claim 1, wherein, When it is judged that the matching ring only includes one node, the directed edge is an edge pointing to the node itself.

9. The group resource matching method of claim 1, wherein, The step of adjusting the supply resource intended to be matched comprises: when it is judged that the supply resource intended to be matched by the two group members belongs to the same node, and the two group members are in an ancestor node and a descendant node relationship, and the ancestor node and the same node also belong to an ancestor node and a descendant node relationship, adjusting the supply resource intended to be matched by the descendant node to match the supply resource held by other nodes according to the priority of the descendant node.

10. The group resource matching method of claim 1, wherein, The step of adjusting the supply resource intended to be matched comprises: when it is judged that the supply resource intended to be matched by the two group members belongs to the same node, and the two group members are in an ancestor node and a descendant node relationship, and the ancestor node and the same node also belong to an ancestor node and a descendant node relationship, adjusting the supply resource intended to be matched by the ancestor node to match the supply resource held by other nodes according to the priority of the ancestor node.

11. The group resource matching method of claim 1, wherein, The step of matching the supply resource for the owner of the supply resource intended to be matched by the same node according to the loop condition comprises: when it is judged that the supply resource intended to be matched by the two group members belongs to the same node, and the two group members are in an ancestor node and a descendant node relationship, and the same node belongs to the descendant node of the ancestor node, and the same node does not belong to the descendant node of the descendant node, matching the supply resource for the owner of the supply resource intended to be matched by the same node according to the loop condition to form a matching ring including the owner.

12. The group resource matching method of claim 1, wherein, The loop condition comprises: when the owner of the supply resource intended to be matched by the same node is an ancestor node of the ancestor nodes of the two group members, the supply resource matched for the owner comes from the ancestor nodes of the two group members or ancestor nodes thereof.

13. The group resource matching method of claim 1, wherein, The loop condition comprises: when the owner of the supply resource intended to be matched by the same node is a descendant node of the descendant nodes of the two group members, the supply resource matched for the owner comes from the descendant nodes of the two group members or descendant nodes thereof.

14. The group resource matching method of claim 1, wherein, The method further comprises sending the supply resource matched for a group member and the owner of the supply resource, and the matcher of the supply resource held by the group member, to the group member.

15. A group resource matching system, comprising: The method further comprises: The constructing module is configured to construct a tree structure based on the association information of each group member in the group; wherein the tree structure includes a root node representing a social platform, and a plurality of parent nodes and a plurality of child nodes representing group members derived from the root node; each group member in the group holds a supply resource and is preconfigured with a resource demand, and the resource demand is configured with a priority; the priority is configured based on at least part of the supply resources held by the group members in the group; The acquiring module is configured to acquire the resource demand of the corresponding group member of each node; The matching module is configured to match resources for each member of the group to meet the resource requirements of each member based on the tree structure and the resource requirements and the inclined priority of each member of the group and using preset constraint conditions to limit the supply resources that can be matched by each member. When the supply resources that the two members are inclined to match belong to the same node and the two members are in an ancestor node and descendant node relationship, the inclined matching supply resources are adjusted or the owner of the inclined matching supply resources is matched with supply resources using a loop condition under the constraint of the constraint conditions and according to the resource requirements of each member in the process of sequentially matching the supply resources for each member. The above steps are repeated until the supply resources that meet the resource requirements of each member of the group are matched and at least one matching loop is formed in the tree structure; the matching loop includes at least one node representing a member and a directed edge connecting the nodes. The supply resources that meet the resource requirements of each member in the loop are matched according to the direction of the directed edge in the loop. The nodes corresponding to the matching loop are deleted from the tree structure to update the tree structure, and the matching loop is repeatedly obtained based on the updated tree structure until the supply resources that meet the resource requirements of each member of the group are matched.

16. A computer device, comprising: The interface device is configured to obtain the resource requirements of each member of the group. The storage device is configured to store a computer program. The processing device is communicatively connected to the interface device and the storage device and is configured to run the computer program to perform the group resource matching method according to any one of claims 1-14. The computer program is stored in the computer readable storage medium and is used to perform the group resource matching method according to any one of claims 1-14.

17. A computer-readable storage medium, characterized in that, When the computer program product is run on the computer, the computer is caused to perform the group resource matching method according to any one of claims 1-14.

18. A computer program product, characterised in that, ​

Images