We consider a cost sharing problem, where each individual is identi ed by a characteristic (a positive real number) ci: The two main positions on how to share a common cost M are the Egalitarian and the Proportional solutions. These solutions can be obtained as the Perron's eigenvectors (right...

We reconsider the following cost-sharing problem: agent i = 1,...,n demands a quantity xi of good i; the corresponding total cost C(x1,...,xn) must be shared among the n agents. The Aumann-Shapley prices (p1,...,pn) are given by the Shapley value of the game where each unit of each good is...

We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...

The equitable division of a joint cost (or a jointly produced output) among agents with different shares or types of output (or input) commodities, is a central theme of the theory of cooperative games with transferable utility. Ever since Shapley's seminal contribution in 1953, this question...

A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic...

We reconsider the following cost-sharing problem: agent i = 1, ...,n demands a quantity xi of good i; the corresponding total cost C(x1, ..., xn) must be shared among the n agents. The Aumann-Shapley prices (p1, ..., pn) are given by the Shapley value of the game where each unit of each good is...

A group of agents participate in a cooperative enterprise producing a single good. Each participant contributes a particular type of input; output is nondecreasing in these contributions. How should it be shared? We analyze the implications of the axiom of Group Monotonicity: if a group of...

We consider an extension of minimum cost spanning tree (mcst) problems where some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...

We offer an axiomatization of the serial cost-sharing method of Friedman and Moulin (1999). The key property in our axiom system is Group Demand Monotonicity, asking that when a group of agents raise their demands, not all of them should pay less.

A group of agents participate in a cooperative enterprise producing a single good. Each participant contributes a particular type of input; output is nondecreasing in these contributions. How should it be shared? We analyze the implications of the axiom of Group Monotonicity: if a group of...