The priority value for cooperative games with a priority structure

We study cooperative games with a priority structure modeled by poset on the agent set. introduce Priority value, which splits Harsanyi dividend of each coalition among set its members over no other member has priority. This allocation shares many desirable properties classical Shapley value: it is efficient, additive and satisfies null axiom. provide two axiomatic characterizations value invoke both axioms new describing effects payoff allocation. Finally, in special case where agents are ranked level, link between weighted values Owen-type can be drawn.