In this paper we look for a solution to a land division problem that could be applied to different types of disputes when the arbitrator has a very limited information about the agents' preferences. The solution must be fair and efficient under the constraint of the limited information available...

This paper is concerned with the problems of achieving lasting peace. One dimension includes fairly sharing the post-war economic and political pie or the peace dividend. This requires post-war allocations that are envy free. Many peace agreements that end civil wars are notoriously unstable in...

In an incomplete information setting, we analyze the sealed bid auction proposed by Knaster (cf. Steinhaus (1948)). This procedure was designed to efficiently and fairly allocate multiple indivisible items when participants report their valuations truthfully. In equilibrium, players do not...

The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic...

In an experiment on a subjective claims problem we compare three unanimity bargaining procedures - the Demand, the Offer and the Exit variant - in terms of fairness and efficiency. To assess the fairness of the allocations obtained by these procedures, we evaluate them from a partial point of...

In a subjective claims problem several agents have contributed to the production of a cake which is to be divided among them. Since contributions are difficult to compare and the production function is nonlinear, agents'subjective evaluations of claims are likely to be conflicting. In a...