Let M and N be the set of minimizers of a function f over respective subsets K and L of a lattice, with K being lower than L. This paper characterizes the class of functions f for which M is lower (resp., weakly lower, meet lower, join lower, chain lower) than N for all K lower than L. The...

It is shown that Lemke's algorithm can be used to compute, in a finite number of steps, an equilibrium or reduction for the pure exchange model with linear utilities.