On a combinatorial property of choice functions of finite sets

We consider choice functions [ X ] k → X , where X is a finite set and [ X ] k denotes the set of all k-subsets of X. We define a property of domination for such maps generalizing the classical case k = 2 (tournaments) and prove the existence of a dominating element generalizing the existence of a 2-root (king) in the classical case.