For a two-sided multipartner matching model where agents are given by path-independent choice functions and no quota restrictions, Blair [7] had shown that stable matchings always exist and form a lattice. However, the lattice operations were not simple and not distributive. Recently Alkan [3]...

Given any problem involving assignment of indivisible objects and a sum of money among individuals, there is an efficient envy-free allocation (namely the minmax money allocation) which can be extended monotonically to a new efficient envyfree allocation for any object added or individual...