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...

We provide new characterisations of the equal surplus division value. This way, the difference between the Shapley value, the equal surplus division value, and the equal division value is pinpointed to one axiom.

We study the problem of rationing a divisible good among a group of people. Each personʼs preferences are characterized by an ideal amount that he would prefer to receive and a minimum quantity that he will accept: any amount less than this threshold is just as good as receiving nothing at all....

We consider the “airport problem”, which is concerned with sharing the cost of an airstrip among agents who need airstrips of different lengths. We investigate the implications of two properties, Left-endpoint Subtraction (LS) bilateral consistency and LS converse consistency, in the airport...

We explore in this paper the axiomatic approach to the problem of sharing the revenue from museum passes. We formalize two models for this problem on the grounds of two different informational bases. In both models, we provide axiomatic rationale for natural rules to solve the problem. We,...

This paper starts from a classical fair division situation of allocating an object among a set of agents. The problem is studied from both a cooperative and a bankruptcy point of view, analyzing the fairness properties of the proposed solutions.

Users need to connect a pair of target nodes in the network. They share the fixed connection costs of the edge. The system manager elicits target pairs from users, builds the cheapest forest meeting all demands, and choose a cost sharing rule satisfying: