We show that a simple game form, which resembles the "Divide-and-Choose" procedure, Nash-implements the no-envy solution on domains of economies where the set of feasible allocations is symmetric (an allocation obtained from a feasible allocation by interchanging the bundles of two agents is...

Each capacity-filling and substitutable choice rule is known to have a maximizer-collecting representation: there exists a list of priority orderings such that from each choice set that includes more alternatives than the capacity, the choice is the union of the priority orderings' maximizers...