English
Related papers

Related papers: Extending choice assessments to choice functions: …

200 papers

We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose…

Artificial Intelligence · Computer Science 2020-07-16 Arne Decadt , Jasper De Bock , Gert de Cooman

We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…

Artificial Intelligence · Computer Science 2024-03-27 Quratul-ain Mahesar , Nir Oren , Wamberto W. Vasconcelos

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…

Artificial Intelligence · Computer Science 2019-05-22 Jasper De Bock , Gert de Cooman

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

Artificial Intelligence · Computer Science 2013-04-11 Eric Neufeld , David L Poole

The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…

Combinatorics · Mathematics 2022-09-15 Vladimir Danilov

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…

Artificial Intelligence · Computer Science 2020-04-03 Jasper De Bock

A default theory can be characterized by its sets of plausible conclusions, called its extensions. But, due to the theoretical complexity of Default Logic (Sigma_2p-complete), the problem of finding such an extension is very difficult if…

Artificial Intelligence · Computer Science 2007-05-23 P. Nicolas , F. Saubion , I. Stephan

There are notable examples of online search improving over hand-coded or learned policies (e.g. AlphaZero) for sequential decision making. It is not clear, however, whether or not policy improvement is guaranteed for many of these…

Artificial Intelligence · Computer Science 2019-10-08 Murugeswari Issakkimuthu , Alan Fern , Prasad Tadepalli

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The…

Machine Learning · Statistics 2017-10-31 Sapan Agarwal , Corey M. Hudson

In economic theory, an agent chooses from available alternatives -- modeled as a set. In decisions in the field or in the lab, however, agents do not have access to the set of alternatives at once. Instead, alternatives are represented by…

Computer Science and Game Theory · Computer Science 2021-11-09 Paulo Oliva , Philipp Zahn

We study preferences estimated from finite choice experiments and provide sufficient conditions for convergence to a unique underlying "true" preference. Our conditions are weak, and therefore valid in a wide range of economic environments.…

Theoretical Economics · Economics 2020-11-03 Christopher P. Chambers , Federico Echenique , Nicolas Lambert

It has been shown that a functional interpretation of proofs in mathematical analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in…

Logic · Mathematics 2012-04-25 Paulo Oliva , Thomas Powell

We propose a mathematical framework for natural selection in finite populations. Traditionally, many of the selection-based processes used to describe cultural and genetic evolution (such as imitation and birth-death models) have been…

Populations and Evolution · Quantitative Biology 2015-11-18 Alex McAvoy

We develop a full-fledged analysis of an algorithmic decision process that, in a multialternative choice problem, produces computable choice probabilities and expected decision times.

Theoretical Economics · Economics 2023-05-08 Carlo Baldassi , Fabio Maccheroni , Massimo Marinacci , Marco Pirazzini

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…

Artificial Intelligence · Computer Science 2022-05-13 Arne Decadt , Alexander Erreygers , Jasper De Bock , Gert de Cooman

In this contribution we explore choice revision, a sort of belief change in which the new information is represented by a set of sentences and the agent could accept some of the sentences while rejecting the others. We propose a generalized…

Logic in Computer Science · Computer Science 2018-05-04 Li Zhang

The theory of evolution by natural selection cannot be used to evaluate the truth value of the following proposition: Through evolution, there exists at least one species that can adapt to any one given environment. To address this issue,…

Biological Physics · Physics 2022-08-17 Kai Xu

Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating considerable efforts…

Neural and Evolutionary Computing · Computer Science 2024-03-08 Hongshu Guo , Yining Ma , Zeyuan Ma , Jiacheng Chen , Xinglin Zhang , Zhiguang Cao , Jun Zhang , Yue-Jiao Gong

Feature selection is popular for obtaining small, interpretable, yet highly accurate prediction models. Conventional feature-selection methods typically yield one feature set only, which might not suffice in some scenarios. For example,…

Machine Learning · Computer Science 2025-02-07 Jakob Bach
‹ Prev 1 2 3 10 Next ›