We introduce a new operator for general rationing problems in which, besides conflicting claims, individual baselines play an important role in the rationing process. The operator builds onto ideas of composition, which are not only frequent in rationing, but also in related problems such as...

We consider the problem of assigning agents to a facility, represented by slots on a line, where only one agent can be served at a time. There is a finite number of agents, and each one wants to be served as close as possible to his preferred slot. We first consider deterministic assignment of...

We consider the problem of distributing the proceeds generated from a joint venture in which the participating agents are hierarchically organized. We characterize a family of allocation rules ranging from the so-called zero-transfer rule (which awards agents in the hierarchy their individually...

We consider a cost sharing problem among agents on a line. The problem is closely related to the classic airport game, but in our model agents are characterized by their location, rather than their needed runway length. We characterize a family of cost allocation rules in which agents pay a...