Desirability and the birth of incomplete preferences

06/01/2015
by   Marco Zaffalon, et al.
0

We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles developed in the context of imprecise probability. The equivalence allows us to revisit incomplete preferences from the viewpoint of desirability and through the derived notion of coherent lower previsions. On this basis, we obtain new results and insights: in particular, we show that the theory of incomplete preferences can be developed assuming only the existence of a worst act---no best act is needed---, and that a weakened Archimedean axiom suffices too; this axiom allows us also to address some controversy about the regularity assumption (that probabilities should be positive---they need not), which enables us also to deal with uncountable possibility spaces; we show that it is always possible to extend in a minimal way a preference relation to one with a worst act, and yet the resulting relation is never Archimedean, except in a trivial case; we show that the traditional notion of state independence coincides with the notion called strong independence in imprecise probability---this leads us to give much a weaker definition of state independence than the traditional one; we rework and uniform the notions of complete preferences, beliefs, values; we argue that Archimedeanity does not capture all the problems that can be modelled with sets of expected utilities and we provide a new notion that does precisely that. Perhaps most importantly, we argue throughout that desirability is a powerful and natural setting to model, and work with, incomplete preferences, even in case of non-Archimedean problems. This leads us to suggest that desirability, rather than preference, should be the primitive notion at the basis of decision-theoretic axiomatisations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2021

On a notion of independence proposed by Teddy Seidenfeld

Teddy Seidenfeld has been arguing for quite a long time that binary pref...
research
01/30/2013

Towards Case-Based Preference Elicitation: Similarity Measures on Preference Structures

While decision theory provides an appealing normative framework for repr...
research
02/22/2019

On Nominal Syntax and Permutation Fixed Points

We propose a new axiomatisation of the alpha-equivalence relation for no...
research
01/05/2018

Reasons and Means to Model Preferences as Incomplete

Literature involving preferences of artificial agents or human beings of...
research
07/27/2017

Bayesian Decision Theory and Stochastic Independence

Stochastic independence has a complex status in probability theory. It i...
research
02/24/2023

Weak equivalence of local independence graphs

Classical graphical modeling of multivariate random vectors uses graphs ...
research
06/14/2019

Matroidal Approximations of Independence Systems

Milgrom (2017) has proposed a heuristic for determining a maximum weight...

Please sign up or login with your details

Forgot password? Click here to reset