We extend the classical concept of set majorization to the case where the set is partially ordered. We give a useful property which characterizes majorization on a partially ordered set. Quite unexpectedly, the proof of this property relies on a theorem of Shapley on convex games. We also give a theorem which is parallel to the Schur-Ostrowski theorem in comparing two sets of parameters in a function.