The Shapley value of a cooperative transferable utility game distributes the dividend of each coalition in the game equally among its members. Given exogenous weights for all players, the corresponding weighted Shapley value distributes the dividends proportionally to their weights. In this...

The Shapley value of a cooperative transferable utility game distributes the dividend of each coalition in the game equally among its members. Given exogenous weights for all players, the corresponding weighted Shapley value distributes the dividends proportionally to their weights. In this...

The Shapley value of a cooperative transferable utility game distributes the dividend of each coalition in the game equally among its members. Given exogenous weights for all players, the corresponding weighted Shapley value distributes the dividends proportionally to their weights. In this...

In this paper, we introduce two polytopes that respect a digraph in the sense that for every vector in the polytope every component corresponds to a node and is at least equal to the component corresponding to each successor of this node. The sharing polytope is the set of all elements from the...

We consider the problem of sharing water among agents located along a river. Each agent's benefit depends on the amount of water consumed. An allocation of water is efficient when it maximizes total benefits. To sustain an efficient water allocation the agents can compensate each other by...

Generalized characteristic functions extend characteristic functions of ‘classical’ TU-games by assigning a real number to every ordered coalition being a permutation of any subset of the player set. Such generalized characteristic functions can be applied when the earnings or costs of...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. Besides the well-known axioms of anonymity and positive responsiveness we...

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus.

A cooperative game with a permission structure describes a situation in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. In this paper we consider non-negative...