# Decision-making with E-admissibility given a finite assessment of choices

arXiv: https://arxiv.org/abs/2204.07428 · HTML: https://mlsanity.com/paper/2204.07428/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 15 references that are in the map.
- First posted on arXiv 15 Apr 2022.

## Builds on (most cited first, 4 of 4)

- [Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Making](https://mlsanity.com/paper/2002.05196/) (2020)
- [A Desirability-Based Axiomatisation for Coherent Choice Functions](https://mlsanity.com/paper/1806.01044/) (2018)
- [Coherent and Archimedean choice in general Banach spaces](https://mlsanity.com/paper/2002.05461/) (2020)
- [Inference with Choice Functions Made Practical](https://mlsanity.com/paper/2005.03098/) (2020)

## Abstract (arXiv)

Given information about which options a decision-maker definitely rejects from given finite sets of options, we study the implications for decision-making with E-admissibility. This means that from any finite set of options, we reject those options that no probability mass function compatible with the given information gives the highest expected utility. We use the mathematical framework of choice functions to specify choices and rejections, and specify the available information in the form of conditions on such functions. We characterise the most conservative extension of the given information to a choice function that makes choices based on E-admissibility, and provide an algorithm that computes this extension by solving linear feasibility problems.