Abstract. In this paper, a class of set-valued mappings is introduced, which is called uniformly same-order. For this sort of mappings, some minimax problems, in which the minimization and the maximization of set-valued mappings are taken in the sense of vector optimization, are investigated without any hypotheses of convexity.