Abstract

Two classically equivalent, but constructively inequivalent, strict convexity properties of a preference relation are discussed, and conditions given under which the stronger notion is a consequence of the weaker. The last part of the paper introduces uniformly rotund preferences, and shows that uniform rotundity implies strict convexity. The paper is written from a strictly constructive point of view, in which all proofs embody algorithms. MSC: 03F60, 90A06