Choice functions based on sets of strict partial orders: an axiomatic characterisation

03/25/2020
by   Jasper De Bock, et al.
0

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 an axiomatic characterisation for choice functions based on (sets of) total orders, (sets of) weak orders, (sets of) coherent lower previsions and (sets of) probability measures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2019

An alternative approach to coherent choice functions

Choice functions constitute a simple, direct and very general mathematic...
research
07/06/2021

Representing choice functions by a total hyper-order

Choice functions over a set X that satisfy the Outcast, a.k.a. Aizerman,...
research
04/24/2018

Robust and Approximately Stable Marriages under Partial Information

We study the stable marriage problem in the partial information setting ...
research
05/28/2020

Discovering Domain Orders through Order Dependencies

Much real-world data come with explicitly defined domain orders; e.g., l...
research
07/10/2017

Lexicographic choice functions

We investigate a generalisation of the coherent choice functions conside...
research
04/19/2023

Depth Functions for Partial Orders with a Descriptive Analysis of Machine Learning Algorithms

We propose a framework for descriptively analyzing sets of partial order...
research
07/27/2014

Defining Relative Likelihood in Partially-Ordered Preferential Structures

Starting with a likelihood or preference order on worlds, we extend it t...

Please sign up or login with your details

Forgot password? Click here to reset