We apply the procedure to both existing and new classes of cooperative situations: sequencing situations without initial ordering, maintenance problems, minimum cost spanning tree situations, travelling salesman problems, shared taxi problems and travelling repairman problems.