Divide-and-permute

We construct “simple” games implementing in Nash equilibria several solutions to the problem of fair division. These solutions are the no-envy solution, which selects the allocations such that no agent would prefer someone else's bundle to his own, and several variants of this solution. Components of strategies can be interpreted as allocations, consumption bundles, permutations, points in simplices of dimensionalities equal to the number of goods or to the number of agents, and integers. We also propose a simple game implementing the Pareto solution and games implementing the intersections of the Pareto solution with each of these solutions.