Algorithm for selecting subgroups by compatibility?

Question

higher mathematics

I am making a website service for finding a team for online games.
Let's say 10,000 people have registered on it, filled in the data and are sitting online.
Some of them activated the search function.
This function creates subgroups of people of 2-3-5-10-20 people based on the search parameters they set. (game, desired group size, age, game experience, game skills, UTC daily periods possible for co-op games, overall game experience , country, etc.). If the group has compatibility less than the minimum value, then these users sit further in the search pool and wait for a new selection.
How to implement this feature? The first thing that comes to my mind is a classification based on mathematical optimization (like artificial neural networks) a la tensorflow or similar tools.

Answer 1

and the usual clustering is not suitable?