Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Artificial Intelligence

arXiv:2204.07428 (cs)
[Submitted on 15 Apr 2022 (v1), last revised 12 May 2022 (this version, v2)]

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

Authors:Arne Decadt, Alexander Erreygers, Jasper De Bock, Gert de Cooman
View PDF
Abstract: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.
Comments: 11 pages, 1 figure, extended version of conference paper
Subjects: Artificial Intelligence (cs.AI); Probability (math.PR)
Cite as: arXiv:2204.07428 [cs.AI]
  (or arXiv:2204.07428v2 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2204.07428

Submission history

From: Arne Decadt [view email]
[v1] Fri, 15 Apr 2022 11:46:00 UTC (52 KB)
[v2] Thu, 12 May 2022 12:01:31 UTC (52 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.AI
< prev   |   next >
new | recent | 2022-04
Change to browse by:
cs
math
math.PR

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)