Representing choice functions by a total hyper-order

07/06/2021
by   Daniel Lehmann, et al.
0

Choice functions over a set X that satisfy the Outcast, a.k.a. Aizerman, property are exactly those that attach to any set its maximal subset relative to some total order of 2^X.

READ FULL TEXT

page 1

page 2

research
03/25/2020

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

Methods for choosing from a set of options are often based on a strict p...
research
07/13/2019

Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks

A framework for asynchronous, signature free, fully local and probabilis...
research
02/28/2019

An alternative approach to coherent choice functions

Choice functions constitute a simple, direct and very general mathematic...
research
03/18/2019

On Deep Set Learning and the Choice of Aggregations

Recently, it has been shown that many functions on sets can be represent...
research
04/03/2020

On the Structure of Stable Tournament Solutions

A fundamental property of choice functions is stability, which, loosely ...
research
12/27/2022

Foundations of self-progressive choice theories

Consider a population of agents whose choice behaviors are partially com...
research
10/24/2019

What's Decidable About Program Verification Modulo Axioms?

We consider the decidability of the verification problem of programs mod...

Please sign up or login with your details

Forgot password? Click here to reset