Cooperation among agents is a very actual problem, which is a focus of lotspapers published recently. The main purpose of cooperation is to improve each agent’sexecution or whole execution of agents’ society and it depends strongly on concrete kindsof agents and a situation in which the agents are situated. Moreover, agents’ intelligenceand their relationship also influence lots to cooperation process, mainly, when the agents’society is huge or composed from a variety different agents. In this paper we focus to aproblem how to create optimal coalitions among the given agents, where a coalition is aone of possible forms for cooperation and in which the common goal has highest priorityfor all the agents creating this coalition. Further, we will introduce methods, which areable to guarantee sub-optimal solutions by reducing a search space and estimate thedomain, where the optimal solution possibly could be. In the end we will discuss about aproblem of creating coalition with more parameters.