English
Related papers

Related papers: Metatickles and Death in Damascus

200 papers

When formulated using Bayesian networks, two standard decision algorithms (Evidential Decision Theory and Causal Decision Theory) can be shown to fail systematically when faced with aspects of the prisoner's dilemma and so-called…

Artificial Intelligence · Computer Science 2023-06-02 Alex Altair

In this paper I present an argument and a general schema which can be used to construct a problem case for any decision theory, in a way that could be taken to show that one cannot formulate a decision theory that is never outperformed by…

Artificial Intelligence · Computer Science 2021-01-05 Joar Skalse

This paper investigates the problem of finding a preference relation on a set of acts from the knowledge of an ordering on events (subsets of states of the world) describing the decision-maker (DM)s uncertainty and an ordering of…

Artificial Intelligence · Computer Science 2013-02-08 Didier Dubois , Helene Fargier , Henri Prade

This paper explains why internal and external validity cannot be simultaneously maximised. It introduces "evidential states" to represent the information available for causal inference and shows that routine study operations (restriction,…

Applications · Statistics 2025-12-01 Daniel D. Reidpath

Moving beyond the dualistic view in AI where agent and environment are separated incurs new challenges for decision making, as calculation of expected utility is no longer straightforward. The non-dualistic decision theory literature is…

Artificial Intelligence · Computer Science 2015-06-25 Tom Everitt , Jan Leike , Marcus Hutter

Analyzing decision problems under uncertainty commonly relies on idealizing assumptions about the describability of the world, with the most prominent examples being the closed world and the small world assumption. Most assumptions are…

Methodology · Statistics 2025-12-08 Christoph Jansen , Georg Schollmeyer , Thomas Augustin , Julian Rodemann

In Newcomb's problem, causal decision theory (CDT) recommends two-boxing and thus comes apart from evidential decision theory (EDT) and ex ante policy optimisation (which prescribe one-boxing). However, in Newcomb's problem, you should…

Artificial Intelligence · Computer Science 2024-11-22 Emery Cooper , Caspar Oesterheld , Vincent Conitzer

This paper proposes a careful separation between an entity's epistemic system and their decision system. Crucially, Bayesian counterfactuals are estimated by the epistemic system; not by the decision system. Based on this remark, I prove…

Theoretical Economics · Economics 2020-08-11 Lê Nguyên Hoang

We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…

Logic in Computer Science · Computer Science 2025-06-16 Domenico Cantone , Gianluca Cincotti

This paper examines two related problems that are central to developing an autonomous decision-making agent, such as a robot. Both problems require generating structured representafions from a database of unstructured declarative knowledge…

Artificial Intelligence · Computer Science 2013-04-10 Spencer Star

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide…

Machine Learning · Computer Science 2020-03-02 Amir-Hossein Karimi , Gilles Barthe , Borja Balle , Isabel Valera

In Newcomb's paradox you choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose, a prediction algorithm deduces your choice, and fills the two boxes based…

Computer Science and Game Theory · Computer Science 2010-03-09 David H. Wolpert , Gregory Benford

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap

Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…

Artificial Intelligence · Computer Science 2023-07-25 Chunxi Ji , Adnan Darwiche

We study the problem of deriving policies, or rules, that when enacted on a complex system, cause a desired outcome. Absent the ability to perform controlled experiments, such rules have to be inferred from past observations of the system's…

Machine Learning · Computer Science 2020-09-09 Kailash Budhathoki , Mario Boley , Jilles Vreeken

This paper describes and motivates a new decision theory known as functional decision theory (FDT), as distinct from causal decision theory and evidential decision theory. Functional decision theorists hold that the normative principle for…

Artificial Intelligence · Computer Science 2018-05-24 Eliezer Yudkowsky , Nate Soares

The roles played by decision factors in making complex subject are decisions are characterized by how these factors affect the overall decision. Evidence that partially matches a factor is evaluated, and then effective computational rules…

Artificial Intelligence · Computer Science 2013-04-15 Gerald Shao-Hung Liu

The fundamental elements of evidential reasoning problems are described, followed by a discussion of the structure of various types of problems. Bayesian inference networks and state space formalism are used as the tool for problem…

Artificial Intelligence · Computer Science 2013-04-12 Moshe Ben-Bassat

Most traditional models of uncertainty have focused on the associational relationship among variables as captured by conditional dependence. In order to successfully manage intelligent systems for decision making, however, we must be able…

Artificial Intelligence · Computer Science 2015-05-19 David Heckerman , Ross D. Shachter

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

Logic in Computer Science · Computer Science 2014-01-17 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier
‹ Prev 1 2 3 10 Next ›