Choice functions based on sets of strict partial orders: an axiomatic characterisation
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). First posted on arXiv 25 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021On a notion of independence proposed by Teddy Seidenfeldcited by 2
- 2021On a notion of independence proposed by Teddy Seidenfeld20 Feb 2021