Consistent Valued Preference Models

Abstract

As shown by Fodor, Ovchinikov and Roubens [3,4,7,14], a binary preference relation should be always understood as a structure which explicits how strict preference, infidifference, weak preference and even incomparability are defined. Some particular solutions have been aximatically characterized by these authors. In this paper we shall discuss some of their basic assumptions and comment on the real degree of freedom we have in order to define consistent families of these four basic valued preference relations.