Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Making

• URL: http://arxiv.org/abs/2002.05196v3
• Date: Wed, 25 Mar 2020 19:39:57 GMT
• Title: Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Making
• Authors: Jasper De Bock
• Abstract summary: We focus on two generalisations that apply to sets of probability measures: E-admissibility and maximality. We provide a set of necessary and sufficient conditions on choice functions that uniquely characterises this rule. A representation theorem for Archimedean choice functions in terms of coherent lower previsions lies at the basis of both results.
• Score: 0.9442139459221782
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: If uncertainty is modelled by a probability measure, decisions are typically made by choosing the option with the highest expected utility. If an imprecise probability model is used instead, this decision rule can be generalised in several ways. We here focus on two such generalisations that apply to sets of probability measures: E-admissibility and maximality. Both of them can be regarded as special instances of so-called choice functions, a very general mathematical framework for decision making. For each of these two decision rules, we provide a set of necessary and sufficient conditions on choice functions that uniquely characterises this rule, thereby providing an axiomatic foundation for imprecise decision making with sets of probabilities. A representation theorem for Archimedean choice functions in terms of coherent lower previsions lies at the basis of both results.

Related papers

• Differentiating Choices via Commonality for Multiple-Choice Question Answering [54.04315943420376]
  Multiple-choice question answering can provide valuable clues for choosing the right answer. Existing models often rank each choice separately, overlooking the context provided by other choices. We propose a novel model by differentiating choices through identifying and eliminating their commonality, called DCQA.
  arXiv  Detail & Related papers  (2024-08-21T12:05:21Z)
• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• Learning Choice Functions with Gaussian Processes [0.225596179391365]
  In consumer theory, ranking available objects by means of preference relations yields the most common description of individual choices. We propose a choice-model which allows an individual to express a set-valued choice.
  arXiv  Detail & Related papers  (2023-02-01T12:46:43Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• Decision-making with E-admissibility given a finite assessment of choices [64.29961886833972]
  We study the implications for decision-making with E-admissibility. We use the mathematical framework of choice functions to specify choices and rejections. We provide an algorithm that computes this extension by solving linear feasibility problems.
  arXiv  Detail & Related papers  (2022-04-15T11:46:00Z)
• Parameter selection in Gaussian process interpolation: an empirical study of selection criteria [0.0]
  This article revisits the fundamental problem of parameter selection for Gaussian process. We show that the choice of an appropriate family of models is often more important than the choice of a particular selection criterion.
  arXiv  Detail & Related papers  (2021-07-13T11:57:56Z)
• PSD Representations for Effective Probability Models [117.35298398434628]
  We show that a recently proposed class of positive semi-definite (PSD) models for non-negative functions is particularly suited to this end. We characterize both approximation and generalization capabilities of PSD models, showing that they enjoy strong theoretical guarantees. Our results open the way to applications of PSD models to density estimation, decision theory and inference.
  arXiv  Detail & Related papers  (2021-06-30T15:13:39Z)
• Smart Choices and the Selection Monad [0.0]
  Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made. We define two small languages that support decision-making abstractions: one with choices and rewards, and the other additionally with probabilities.
  arXiv  Detail & Related papers  (2020-07-17T12:13:16Z)
• Inference with Choice Functions Made Practical [1.1859913430860332]
  We study how to infer new choices from previous choices in a conservative manner. We use the theory of choice functions: a unifying mathematical framework for conservative decision making.
  arXiv  Detail & Related papers  (2020-05-07T12:58:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.