Choice functions based on sets of strict partial orders: an axiomatic characterisation
This work addresses foundational issues in decision theory and choice modeling, offering a theoretical framework for researchers, but it is incremental as it extends existing axiomatic characterizations.
The paper tackles the problem of axiomatic characterization for choice functions based on sets of strict partial orders, providing a general framework that includes special cases like total orders and probability measures, with no concrete numerical results reported.
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It includes as special cases axiomatic characterisations for choice functions based on (sets of) total orders, (sets of) weak orders, (sets of) coherent lower previsions and (sets of) probability measures.