Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players

We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS) and the Radon–Nykodim Set (RNS). The algorithm can be considered as an extension of the Adjusted Winner procedureby Brams and Taylor to the three-player case, without the guarantee of envy-freeness.