We consider certain mixtures, Γ, of classes of stochastic games and provide sufficient conditions for these mixtures to possess the orderfield property. For 2-player zero-sum and non-zero sum stochastic games, we prove that if we mix a set of states S 1 where the transitions are controlled by one player with a set of states S 2 constituting a sub-game having the orderfield property (where S 1 ∩ S 2 = ∅), the resulting mixture Γ with states S = S 1 ∪ S 2 has the orderfield property if there are no transitions from S 2 to S 1. This is true for discounted as well as undiscounted games. This condition on the transitions is sufficient when S 1 is perfect information or SC (Switching Control) or ARAT (Additive Reward Additive Transition). In the zero-sum case, S 1 can be a mixture of SC and ARAT as well. On the other hand,when S 1 is SER-SIT (Separable Reward — State Independent Transition), we provide a counter example to show that this condition is not sufficient for the mixture Γ to possess the orderfield property. In addition to the condition that there are no transitions from S 2 to S 1, if the sum of all transition probabilities from S 1 to S 2 is independent of the actions of the players, then Γ has the orderfield property even when S 1 is SER-SIT. When S 1 and S 2 are both SERSIT, their mixture Γ has the orderfield property even if we allow transitions from S 2 to S 1. We also extend these results to some multi-player games namely, mixtures with one player control Polystochastic games. In all the above cases, we can inductively mix many such games and continue to retain the orderfield property.