Patent Application
20230381666
Under the applicable patent law and/or rules pursuant to the Paris Convention, this application is made to timely claim the priority to and benefits of Chinese Patent Application No. 202210583584.4, filed on May 25, 2022. For all purposes under the law, the entire disclosure of the aforementioned application is incorporated by reference as part of the disclosure of this application.
The present disclosure relates to the technical field of computers, in particular to a method and an apparatus for game matching, a storage medium, and an electronic device.
In a battle matching scenario of the multiplayer online battle arena (MOBA), usually a single user or a plurality of users make(s) up a game team first, and then battle matching is performed in units of game teams. In case of a great number of online game teams at the same time, battle matching needs to be performed on the online game teams concurrently to shorten a duration required for game matching and improve the efficiency of matching for a game.
At present, an approach of concurrent battle matching refers to randomly allocating online game teams to different matching pools to concurrently perform, in each matching pool, battle matching on game teams in the matching pool. In battle matching, it is preferred to match users of the same type. However, since game teams are randomly allocated to different matching pools, such an approach may result in increased difficulty of matching with a game team of the same type in the same matching pool and an increased duration required for game matching, thereby leading to reduced efficiency of matching for a game.
The summary is provided to introduce concepts briefly, and these concepts will be described in detail in the following detailed description. The summary is neither intended to indicate the key features or essential features of the claimed technical solutions nor meant to limit the scope of the claimed technical solutions.
In the first aspect, the present disclosure provides a method for game matching, comprising:
In the second aspect, the present disclosure further provides an apparatus for game matching, comprising:
In the third aspect, the present disclosure further provides a computer-readable medium, on which a computer program is stored, and the computer program, when executed by a processor, causes the processor to perform steps of the method according to the first aspect.
In the fourth aspect, the present disclosure further provides an electronic device, comprising:
With the above solutions, since the clustering model is obtained by training with a constraint goal of differing in game levels of sample game teams in different class clusters under different game room types and minimizing a quantitative difference of sample game teams in any two class clusters under different game room types, it can be guaranteed that a difference in the number of game teams to be matched under each game room type in each matching pool is minimized and a difference in game level between game teams to be matched allocated to the same matching pool is minimized if a target class cluster to which the game team to be matched belongs and the game room type are predicted according to the clustering model. Thus, a matching duration for battle matching of game teams in the same matching pool is shortened, and the efficiency of matching for a game is improved.
Other features and advantages of the present disclosure will be described in detail in the following detailed description.
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent when taken in conjunction with the accompanying drawings and with reference to the following detailed description. Throughout the drawings, the same or similar reference numerals refer to the same or similar elements. It should be understood that the drawings are schematic and that the components and elements are not necessarily drawn to scale. In the accompanying drawings:
The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the protection scope of the present disclosure.
It should be understood that the various steps described in the method implementations of the present disclosure may be performed in different orders and/or in parallel. Furthermore, the method implementations may include additional steps and/or omit performing the illustrated steps. The protection scope of the present disclosure is not limited in this aspect.
As used herein, the terms “include,” “comprise,” and variations thereof are open-ended inclusions, i.e., “including but not limited to.” The term “based on” is “based, at least in part, on.” The term “an embodiment” represents “at least one embodiment,” the term “another embodiment” represents “at least one additional embodiment,” and the term “some embodiments” represents “at least some embodiments.” Relevant definitions of other terms will be given in the description below.
It should be noted that concepts such as the “first,” “second,” or the like mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the interdependence relationship or the order of functions performed by these devices, modules or units.
It should be noted that the modifications of “a,” “an,” “a plurality of,” and the like mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless the context clearly indicates otherwise, these modifications should be understood as “one or more.”
The names of messages or information exchanged between multiple devices in the embodiments of the present disclosure are only for illustrative purposes, and are not intended to limit the scope of these messages or information.
It should be understood that before using the technical solutions disclosed in various embodiments of the present disclosure, a user should be notified of a type, a range of use, a usage scenario and the like of personal information involved in the present disclosure in an appropriate manner in accordance with relevant laws and regulations, and these should be authorized by the user.
For example, in response to receiving an active request from a user, prompt information is sent to the user to explicitly prompt the user that the operation the user requests to perform will require to acquire and use the personal information of the user. Thus, the use can independently select, according to the prompt information, whether or not to provide the personal information to the software or hardware such as an electronic device, an application, a server, or a storage medium that performs the operations of the technical solutions of the present disclosure.
As an alternative but non-limiting implementation, in response to receiving an active request from a user, a manner of sending prompt information to the user may be, for example, using a pop-up window in which the prompt information may be presented in the form of text. Furthermore, the pop-up window may also carry option controls for the user to select to “agree” or “disagree” with providing personal information to an electronic device.
It should be understood that the processes of notifying of and authorizing by a user described above are merely exemplary and do not constitute a limitation on the implementations of the present disclosure, and other manners meeting relevant laws and regulations may also be applied to the implementations of the present disclosure.
Meanwhile, it should be understood that data (including but not limited to data itself, and the acquisition or use of data) involved in the present technical solutions should follow corresponding laws and regulations and requirements of relevant stipulations.
As stated in the background, in the battle matching of MOBA, it is preferred to perform battle matching on game teams of the same type. In MOBA, usually a single user or a plurality of users make(s) up a game team first, and then matching is performed in the unit of one game team. The type as used herein means a game level of each user in the game team. That is, in the battle matching, it is desired to match game teams having a small difference in game level therebetween to guarantee the game experience of users. Therefore, when concurrently matching game teams in different matching pools, it is vital how to guarantee that game teams of the same type can be matched rapidly in each matching pool.
In view of this, the embodiments of the present disclosure provide a method and an apparatus for game matching, a storage medium, and an electronic device. The embodiments of the present disclosure will be explained and described in detail with reference to the accompanying drawings.
Step S101: obtaining a team feature of a game team to be matched.
In some embodiments, the electronic device may perform the step of obtaining a team feature of a game team to be matched in response to a game request operation initiated by a user for a game application installed on a game terminal.
In some embodiments, obtaining the team feature of the game team to be matched may be achieved by: obtaining a user feature and/or a device feature corresponding to at least one user in the game team to be matched; and determining the team feature of the game team to be matched according to the user feature and/or the device feature in the game team to be matched.
As mentioned above, the user feature is a feature of a user making up the game team to be matched, and the device feature is a feature of the game terminal by which the user initiates the game request operation.
In some embodiments, the user feature may be a feature constructed by a division feature and an Elo rating, and the division feature and the Elo rating may reflect a game level of a user. The division feature may include features of different granularities (a large division and a small division). For example, using digits to characterize the division feature, 1 to 7 may be used to represent different large divisions, and 1 to 31 may be used to represent different small divisions. Different digits characterize different game levels of users.
The device feature may be a ping value which refers to the time from transmitting data from the game terminal to a game server to receiving feedback data from the game server and is used to characterize a network delay of the game terminal.
In the case that the team feature is determined by the user feature and the device feature, the team feature may be determined by: vectorizing the user feature and the device feature in the game team to be matched, respectively, and obtaining a user feature vector corresponding to the user feature and a device feature vector corresponding to the device feature; and concatenating the user feature vector and the device feature vector to obtain a team feature vector for characterizing the team feature.
Taking the above-mentioned exemplary division feature, Elo rating and ping value as an example, obtaining the team feature of the game team to be matched is exemplarily described. The team feature of the game team to be matched is represented by a vector feature which may be formed by concatenating a vector of an Elo rating dimension, a vector of a first-team large division dimension, a vector of a first-team small division dimension, a vector of a second-team large division dimension, a vector of a second-team small division dimension, a vector of a third-team large division dimension, a vector of a third-team small division dimension, and a vector of a ping value dimension.
A parameter in the vector of the Elo rating dimension may include a highest Elo rating, a lowest Elo rating, and an average Elo rating of Elo ratings of all users in the game team to be matched, and further include a value obtained by performing mean variance normalization on the Elo ratings of all the users.
A parameter in the vector of the first-team large division dimension may include a highest large division, a lowest large division, and an average large division of large divisions of all the users in the game team to be matched.
A parameter in the vector of the first-team small division dimension may include a highest small division, a lowest small division, and an average small division of small divisions of all the users in the game team to be matched.
A parameter in the vector of the second-team large division dimension may include large divisions of all the users in the game team to be matched.
A parameter in the vector of the second-team small division dimension may include small divisions of all the users in the game team to be matched.
A parameter in the vector of the third-team large division dimension may include the number of users of each large division in the game team to be matched. This vector may be standardized as a vector having a modulus length of 1.
A parameter in the vector of the third-team small division dimension may include the number of users of each small division in the game team to be matched. This vector may be standardized as a vector having a modulus length of 1. The vector may be standardized as a vector having a modulus length of 1 with reference to the related art, which will not be redundantly described here in the present embodiment.
A parameter in the vector of the ping value dimension may include a mean value of ping values of all users in the game team to be matched to different game servers. For example, the vector of the ping value dimension=[ping−1, ping−2, ping−3, ping−4, ping−5, ping−6], wherein ping−1 may be used to characterize a mean value of ping values of all the users in the game team to be matched to a game server 1, ping−2 may be used to characterize a mean value of ping values of all the users in the game team to be matched to a game server 2, and in a similar fashion, ping−6 may be used to characterize a mean value of ping values of all the users in the game team to be matched to a game server 6.
In some embodiments, ping values may be normalized to be mapped into a range of (0, 1). For example, each parameter may be normalized by using the following formula:
In the above formula (1), different determination manners for mapped values correspond to specific ping values, respectively. For the formula, value is a mapped value corresponding to a ping value; k is a preset value, which represents a slope of the influence of a change in the ping value on the mapped value, and the greater the absolute value of k, the greater the influence of the ping value changing per unit on the mapped value; and Pcomf represents a critical value of battle comfort of a user. When the ping value is less than or equal to Pcomf, it is considered that the user's battle experience is comfortable.
In consideration of a difference in user experience of delay due to overall network situations of different countries/regions, for example, in a country/region having a high overall network delay, the tolerance of users is relatively high, and Pcomf should be greater. On the contrary, in a country/region having a low overall network delay, the tolerance of users is relatively low, and Pcomf should be smaller. In some implementations, statistical critical values of tolerance of users to network delay in each country/region may be collected, and based on the statistics, a mean value of critical values of tolerance of all the users to network delay may be taken as Pcomf of the country/region.
It needs to be noted that the above-mentioned exemplary vector feature does not result in a limitation to the concatenating order of the vectors of different dimensions in the present embodiment. Besides, the above-mentioned vectors of different dimensions may be arbitrarily combined to obtain a vector feature characterizing the team feature.
In some embodiments, a value of a division (a large division or a small division) may be mapped into a range of (0, 1). With continuous reference to the above example in which 1 to 7 may be used to represent different large divisions and 1 to 31 may be used to represent different small divisions, for example, if the large division of a user A in the game team to be matched is 1, the corresponding mapped value may be 1/7; and if the small division of the user A is 10, the corresponding mapped value may be 10/31.
It needs to be noted that the above-mentioned parameters are mapped into a same value range (e.g., (0, 1)) for the convenience of comparison between data, e.g., for the convenience of comparison on game level between game teams to be matched.
Step S102: obtaining, by a pre-trained clustering model, a target class cluster to which the game team to be matched belongs according to the team feature, the clustering model being obtained by training with a constraint goal of differing in game levels of sample game teams in different class clusters under different game room types and minimizing a quantitative difference of sample game teams in any two class clusters under different game room types.
It needs to be noted that a basic condition for achieving the objective of the present disclosure is that the distribution of obtained game teams to be matched is consistent with that of sample game teams for pre-training the clustering model.
It should be necessary that the clustering model includes clustering sub-models corresponding to different game room types, and each clustering sub-model is used for predicting a target class cluster for the game team to be matched of the game room type matched with the clustering sub-model.
Exemplarily, taking for example that the game room types include one user, two users, three users, four users and five users, each of which corresponds to one clustering sub-model.
In some embodiments, the clustering model may be obtained by the following process: for a sample game team corresponding to each game room type, performing, with a goal constraint, iterative optimization on a parameter of an initial clustering sub-model corresponding to the game room type according to a sample team feature of the sample game team corresponding to the game room type, until an iteration stop condition is met, so as to obtain a clustering sub-model corresponding to the game room type; and determining the clustering model according to clustering sub-models corresponding to all game room types. The goal constraint is: a minimum quantitative difference of sample game teams between different class clusters and a minimum difference in game level between sample game teams in a same class cluster.
It should be understood that the clustering model may be obtained by combining the clustering sub-models respectively corresponding to different game room types.
With reference to
In the present embodiment, the sample team feature may be obtained with reference to the implementation process of obtaining the team feature of the game team to be matched in
The parameters corresponding to different game room types are similar. Taking the game room type of five users as an example, the specific construction process of the parameter of the game room type of five users is explained and described below. The parameter is constructed by adding a regularization term on the basis of a function corresponding to the K-Means clustering algorithm, wherein the regularization term is used to constrain a quantitative difference between different clusters. Therefore, in the present embodiment, the parameter includes two sub-functions, with a first term being a function corresponding to the K-Means clustering algorithm and a second term being a regularization term.
The function corresponding to the first term is:
In the case of F being given, one regularization term may be introduced to constrain the number equilibrium of each class cluster, and the second term of the parameter is:
∥F∥e=Tr(FT11TF) (3)
In the above formula (3), Tr represents the trace of a matrix; 1 represents a matrix of which all digits are 1; FT represents the transposition of F; and 1T represents the transposition of 1. As it can be seen from the above formula, ∥F∥e is equal to the square sum of the number of samples of each class cluster, and the following may be derived:
∥F∥e=n12+n22+ . . . +nk2=Σi=1kni2 (4)
In the above formula (4), ni represents the number of samples of the i-th class cluster; and to minimize ∥F∥e, it is necessary to let
where N is the total number of samples of all class clusters. This conclusion may be proved by using the Cauchy inequality, and the specific proof process is as shown below.
The following formula may be derived according to the Cauchy inequality:
(n12+n22+ . . . +nk2)(b12+b22+ . . . +bk2)≥(n1b1+n2b2+ . . . +nkbk) (5)
Letting bi=1, i=1, 2, . . . , k, the above formula (5) may be simplified as:
k(n12+n22+ . . . +nk2)≥(n1+n2+ . . . +nk)2 (6)
As it can be seen from the Cauchy inequality, when and only when n1=n2= . . . =nk, the equal sign for the inequality is satisfied, and in this case,
Furthermore, to measure that the minimization of a quantitative difference between class clusters is more emphasized during the iterative optimization, a weight hyper-parameter is introduced, and a greater weight hyper-parameter may characterize that the minimization of the quantitative difference between class clusters is more emphasized during the iterative optimization.
In conclusion, the parameter may be:
As it can be seen from the above, the parameter of the initial clustering sub-model corresponding to a different game room type includes an initial allocation matrix and an initial indication matrix. Therefore, an idea of alternately performing iterative optimization on the initial allocation matrix and the initial indication matrix may be used in iterative updating of the parameter of the initial clustering sub-model to realize the iterative optimization of the parameter. For example, the iterative optimization of the parameter may include the following process: for the sample game team corresponding to each game room type, performing, with the goal constraint, the iterative optimization on the initial allocation matrix and the initial indication matrix according to the sample team feature of the sample game team corresponding to the game room type, until the iteration stop condition is met, so as to obtain the clustering sub-model corresponding to the game room type.
In some embodiments, the iteration stop condition includes the matrix no longer changing during the iterative optimization, or the number of iterative optimization times being greater than the preset number of times. It needs to be noted that the matrix during the iterative optimization here includes the initial allocation matrix and the initial indication matrix, and the preset number of times may be set according to an actual situation, which will not be limited here in the present embodiment.
The iterative optimization performed on the initial allocation matrix and the initial indication matrix with the goal constraint is further explained and described below, including the following process:
for the sample game team corresponding to each game room type, determining a target indication matrix that minimizes a value of the parameter according to the initial allocation matrix and the sample team feature of the sample game team corresponding to the game room type; determining a target allocation matrix that minimizes the value of the parameter according to the target indication matrix and the sample team feature of the sample game team corresponding to the game room type, and in a case that the iteration stop condition preset is not met, determining the target allocation matrix as a new initial allocation matrix and returning to perform the step of determining the target indication matrix that minimizes the value of the parameter according to the initial allocation matrix and the sample team feature of the sample game team corresponding to the game room type, until the iteration stop condition preset is met; and obtaining the clustering sub-model according to a corresponding target indication matrix and a corresponding target allocation matrix when the iteration stop condition preset is met.
Firstly, it needs to be noted that the initial allocation matrix needs to be preset as a known parameter. In the above processes, controlling the initial allocation matrix to remain unchanged, i.e., taking the initial allocation matrix as a known parameter, the target indication matrix that minimizes the value of the initial function is calculated. An implementation of the process may be as follows: letting a derivative of the initial function be equal to 0, the following formula may be derived:
F=XH(HTH)−1 (8)
The target indication matrix (i.e., F) that satisfies the above formula is calculated according to the initial allocation matrix (i.e., H) and the team feature (i.e., X) of a historical game team to be matched.
In the case that the target indication matrix is obtained, the target indication matrix is taken as a known parameter and then the initial allocation matrix is updated. That is, a target allocation matrix that minimizes the value of the parameter is determined according to the target indication matrix and the sample team feature of the sample game team corresponding to the game room type. An implementation of the process may be as follows: each row of the initial allocation matrix is updated orderly from top to bottom; for the i-th row, a value corresponding to a cluster that minimizes the parameter is set to 1 and values corresponding to other clusters are set to 0 until the n-th row is updated completely, whereby the target allocation matrix is obtained. When updating the (i+1)-th row, all rows before the (i+1)-th row that minimizes the parameter are calculated, subject to the updated values.
The target allocation matrix is taken as a new initial allocation matrix, and a target indication matrix that satisfies the above formula (8) is calculated according to the new initial allocation matrix and the team feature of the sample game team until the preset iteration stop condition is met.
In the case that the preset iteration stop condition is met, the clustering sub-model is obtained according to the corresponding target indication matrix and the corresponding target allocation matrix when the preset iteration stop condition is met. The target indication matrix is used to indicate the clustering center vector of each class cluster, and the target allocation matrix is used to indicate the class cluster corresponding to each sample. The class cluster to which the game team to be matched belongs may be determined according to the target allocation matrix. Using the target indication matrix to indicate the clustering center vector of each class cluster may be used in pre-generating a plurality of matching pools in Step S103, and the specific generation manner will be explained and described in Step S103, which will not be limited here in the present embodiment.
In the above manner, by dividing according to the class cluster to which each sample in the target allocation matrix belongs, the minimization of the quantitative difference between class clusters may be satisfied. The same class cluster (the same game level) under different game room types may be pointed to the same matching pool according to the target indication matrix.
Step S103: allocating the game team to be matched to a target matching pool of a plurality of matching pools according to the target class cluster of the game team to be matched and a game room type, the matching pool being configured to accommodate game teams corresponding to one class cluster under different game room types, and a level difference between the game teams in the matching pool being minimum.
It needs to be noted that one class cluster corresponds to one game level such that the difference in game level between game teams allocated to the same matching pool is minimum.
As it can be seen from the above embodiment with respect to Step S102, the target indication matrix is used to indicate the clustering center vector of each class cluster. Therefore, class clusters having the minimum difference in game level may be bound to the same matching pool in advance according to the target indication matrices corresponding to different clustering sub-models. Thus, matching of game teams at the same level may be performed in the same matching pool in practical use.
In some embodiments, the binding process described above may be: determining, by using a dynamic path planning algorithm, a mapping relationship between each class cluster in target indication matrices corresponding to different clustering sub-models and the matching pool according to target indication matrices corresponding to all clustering sub-models. The constraint goal of the dynamic path planning algorithm is to minimize a distance between the clustering center vectors of various class clusters in the same matching pool, thereby satisfying that the difference between the game levels corresponding to the class clusters to which the game teams in the same matching pool belong is minimized. The dynamic path planning algorithm may be, for example, a dynamic path planning algorithm involved in the traveling salesman problem (see the related art for details), which will not be redundantly described here in the present embodiment.
With reference to
With reference to
Taking that shown in
Step S104: determining, in the target matching pool, a game team matched with the game team to be matched.
It needs to be noted that the determined game team matched with the game team to be matched may be a friendly game team for the game team to be matched or a rival game team for the game team to be matched. Besides, the game team matched with the game team to be matched is a team matched with the game team to be matched in terms of game level.
In some embodiments, Step S104 may be specifically implemented by: in the target matching pool, determining a first game team and a second game team matched with each other in terms of game level, wherein each of the first game team and the second game team is a team made up by at least one game team to be matched in the target matching pool, and each of the first game team and the second game team includes a preset number of users.
Exemplarily, taking for example that the target matching pool includes game teams to be matched having one user, two users, three users, four users, and five users and the preset number of users is 5, the first game team or the second game team may be made up by only one game team to be matched having five users or may be made up by one game team to be matched having one user and two game teams to be matched each having two users. Furthermore, this example does not result in a limitation to the combination manner of the first game team or the second game team. A team having the preset number of users made up by game teams to be matched having different numbers of users may serve as the first game team or the second game team.
Through the methods described above, since the clustering model is obtained by training with the constraint goal of differing in game levels of sample game teams in different class clusters under different game room types and minimizing a quantitative difference of sample game teams in any two class clusters under different game room types, it can be guaranteed that a difference in the number of game teams to be matched under each game room type in each matching pool is minimized and a difference in game level between game teams to be matched allocated to the same matching pool is minimized if a target class cluster to which the game team to be matched belongs and the game room type are predicted according to the clustering model. Thus, a matching duration for battle matching of game teams in the same matching pool is shortened, and the efficiency of matching for a game is improved.
Optionally, the obtaining module 501 includes:
Optionally, in a case that the team feature is determined by the user feature and the device feature, the first determination sub-module is specifically configured to: vectorize the user feature and the device feature in the game team to be matched, respectively, and obtain a user feature vector corresponding to the user feature and a device feature vector corresponding to the device feature; and concatenate the user feature vector and the device feature vector to obtain a team feature vector for characterizing the team feature.
Optionally, the clustering model includes clustering sub-models corresponding to different game room types, and the apparatus 500 further includes:
The goal constraint is: a minimum quantitative difference of sample game teams between different class clusters and a minimum difference in game level between sample game teams in a same class cluster.
Optionally, the parameter of the initial clustering sub-model includes an initial allocation matrix and an initial indication matrix, and the iteration module includes:
The iteration stop condition includes: the matrix no longer changing during the iterative optimization, or a number of iterative optimization times being greater than a preset number of times.
Optionally, the iteration sub-module is specifically configured to: for the sample game team corresponding to each game room type, determine a target indication matrix that minimizes a value of the parameter according to the initial allocation matrix and the sample team feature of the sample game team corresponding to the game room type;
Optionally, the apparatus 500 further includes:
Referring to
As illustrated in
Usually, the following apparatus may be connected to the I/O interface 605: an input apparatus 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, or the like; an output apparatus 607 including, for example, a liquid crystal display (LCD), a loudspeaker, a vibrator, or the like; a storage apparatus 608 including, for example, a magnetic tape, a hard disk, or the like; and a communication apparatus 609. The communication apparatus 609 may allow the electronic device 600 to be in wireless or wired communication with other devices to exchange data. While
Particularly, according to some embodiments of the present disclosure, the processes described above with reference to the flowchart may be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried by a non-transitory computer-readable medium. The computer program includes program codes for performing the method shown in the flowchart. In such embodiments, the computer program may be downloaded online through the communication apparatus 609 and installed, or may be installed from the storage apparatus 608, or may be installed from the ROM 602. When the computer program is executed by the processing apparatus 601, the above-mentioned functions defined in the method of some embodiments of the present disclosure are performed.
It should be noted that the above-mentioned computer-readable medium in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination thereof. For example, the computer-readable storage medium may be, but not limited to, an electric, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or any combination thereof. More specific examples of the computer-readable storage medium may include but not be limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any appropriate combination of them. In the present disclosure, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, apparatus or device. In the present disclosure, the computer-readable signal medium may include a data signal that propagates in a baseband or as a part of a carrier and carries computer-readable program codes. The data signal propagating in such a manner may take a plurality of forms, including but not limited to an electromagnetic signal, an optical signal, or any appropriate combination thereof. The computer-readable signal medium may also be any other computer-readable medium than the computer-readable storage medium. The computer-readable signal medium may send, propagate or transmit a program used by or in combination with an instruction execution system, apparatus or device. The program codes contained on the computer-readable medium may be transmitted by using any suitable medium, including but not limited to an electric wire, a fiber-optic cable, radio frequency (RF) and the like, or any appropriate combination of them.
In some implementation modes, the client and the server may communicate with any network protocol currently known or to be researched and developed in the future such as hypertext transfer protocol (HTTP), and may communicate (via a communication network) and interconnect with digital data in any form or medium. Examples of communication networks include a local area network (LAN), a wide area network (WAN), the Internet, and an end-to-end network (e.g., an ad hoc end-to-end network), as well as any network currently known or to be researched and developed in the future.
The above-described computer-readable medium may be included in the above-described electronic device, or may also exist alone without being assembled into the electronic device.
The above-described computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is caused to: obtain a team feature of a game team to be matched; obtain, by a pre-trained clustering model, a target class cluster to which the game team to be matched belongs according to the team feature, wherein the clustering model is obtained by training with a constraint goal of differing in game levels of sample game teams in different class clusters under different game room types and minimizing a quantitative difference of sample game teams in any two class clusters under different game room types; allocate the game team to be matched to a target matching pool of a plurality of matching pools according to the target class cluster of the game team to be matched and a game room type, wherein the matching pool is configured to accommodate game teams corresponding to one class cluster under different game room types, and a level difference between the game teams in the matching pool is minimum; and determine, in the target matching pool, a game team matched with the game team to be matched.
The computer program codes for performing the operations of the present disclosure may be written in one or more programming languages or a combination thereof. The above-described programming languages include but are not limited to object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the “C” programming language or similar programming languages. The program codes may by executed entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the scenario related to the remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flow chart and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of codes, including one or more executable instructions for implementing specified logical functions. It should also be noted that, in some alternative implementations, the functions noted in the blocks may also occur out of the order noted in the accompanying drawings. For example, two blocks shown in succession may, in fact, can be executed substantially concurrently, or the two blocks may sometimes be executed in a reverse order, depending upon the functionality involved. It should also be noted that, each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts, may be implemented by a dedicated hardware-based system that performs the specified functions or operations, or may also be implemented by a combination of dedicated hardware and computer instructions.
The modules or units involved in the embodiments of the present disclosure may be implemented in software or hardware. Among them, the name of the module or unit does not constitute a limitation of the unit itself under certain circumstances.
The functions described herein above may be performed, at least partially, by one or more hardware logic components. For example, without limitation, available exemplary types of hardware logic components include: a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), an application specific standard product (ASSP), a system on chip (SOC), a complex programmable logical device (CPLD), etc.
In the context of the present disclosure, the machine-readable medium may be a tangible medium that may include or store a program for use by or in combination with an instruction execution system, apparatus or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium includes, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semi-conductive system, apparatus or device, or any suitable combination of the foregoing. More specific examples of machine-readable storage medium include electrical connection with one or more wires, portable computer disk, hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
According to one or more embodiments of the present disclosure, the example 1 provides a method for game matching, comprising:
According to one or more embodiments of the present disclosure, the example 2 provides the method for the example 1, and obtaining the team feature of the game team to be matched comprises:
According to one or more embodiments of the present disclosure, the example 3 provides the method for the example 2, and in a case that the team feature is determined by the user feature and the device feature, determining the team feature of the game team to be matched according to the user feature and/or the device feature in the game team to be matched comprises:
According to one or more embodiments of the present disclosure, the example 4 provides the method for the example 1, and the clustering model comprises clustering sub-models corresponding to different game room types, and the clustering model is obtained by:
According to one or more embodiments of the present disclosure, the example 5 provides the method for the example 4, and the parameter of the initial clustering sub-model comprises an initial allocation matrix and an initial indication matrix, and for the sample game team corresponding to each game room type, performing, with the goal constraint, the iterative optimization on the parameter of the initial clustering sub-model corresponding to the game room type according to the sample team feature of the sample game team corresponding to the game room type, until the iteration stop condition is met, so as to obtain the clustering sub-model corresponding to the game room type, comprises:
According to one or more embodiments of the present disclosure, the example 6 provides the method for the example 5, and for the sample game team corresponding to each game room type, performing, with the goal constraint, the iterative optimization on the initial allocation matrix and the initial indication matrix according to the sample team feature of the sample game team corresponding to the game room type, until the iteration stop condition is met, so as to obtain the clustering sub-model corresponding to the game room type, comprises:
According to one or more embodiments of the present disclosure, the example 7 provides the method for the example 6, and the method further comprises:
According to one or more embodiments of the present disclosure, the example 8 provides an apparatus for game matching, comprising:
According to one or more embodiments of the present disclosure, the example 9 provides a computer-readable medium, on which a computer program is stored, and the computer program, when executed by a processor, causes the processor to perform steps of the method for game matching according to any one of examples 1-7.
According to one or more embodiments of the present disclosure, the example 10 provides an electronic device, comprising:
The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, and should also cover, without departing from the above-mentioned disclosed concept, other technical solutions formed by any combination of the above-mentioned technical features or their equivalents, such as technical solutions which are formed by replacing the above-mentioned technical features with the technical features disclosed in the present disclosure (but not limited to) with similar functions.
Additionally, although operations are depicted in a particular order, it should not be understood that these operations are required to be performed in a specific order as illustrated or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, although the above discussion includes several specific implementation details, these should not be interpreted as limitations on the scope of the present disclosure. Certain features that are described in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment may also be implemented in multiple embodiments separately or in any suitable sub-combinations.
Although the subject matter has been described in language specific to structural features and/or method logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are merely example forms of implementing the claims. Specific manners of operations performed by the modules for the apparatus in the above embodiments have been described in detail in the embodiments regarding the method, which will not be explained and described in detail herein again.
| Number | Date | Country | Kind |
|---|---|---|---|
| 202210583584.4 | May 2022 | CN | national |
