نتایج جستجو برای: ریاضی decision theory

تعداد نتایج: 1101468  

1996
Fahiem Bacchus Adam Grove

Probabilistic independence has proved to be a fundamental tool that can dramatically simplify the task of eliciting, representing, and computing with probabilities. We advance the position that notions of utility independence can serve similar functions when reasoning about preferences and utilities during decision making. In this paper we first summarize existing results and definitions concer...

2005
A. PHILIP DAWID STEFFEN L. LAURITZEN S. L. LAURITZEN

A decision problem is defined in terms of an outcome space, an action space and a loss function. Starting from these simple ingredients, we can construct: Proper Scoring Rule; Entropy Function; Divergence Function; Riemannian Metric; and Unbiased Estimating Equation. We illustrate these for the case of a Riemannian outcome space. From an abstract viewpoint, the loss function defines a duality b...

2015

We briefly introduce and discuss some criteria for optimal decisions. For the majority of this module, we consider a person’s utility for different options (or ‘rewards’ or ‘actions’) and, with uncertainty about the reward which will follow a specific decision, we aim at maximisation of the expected utility, which is actually the utility of the optimal decision (note that a decision is a gamble...

Journal: :Synthese 2013
John Cantwell

This paper explores the possibility that causal decision theory can be formulated in terms of probabilities of conditionals. It is argued that a generalized Stalnaker semantics in combination with an underlying branching time structure not only provides the basis for a plausible account of the semantics of indicative conditionals, but also that the resulting conditionals have properties that ma...

1999
H. Barnum C. M. Caves J. Finkelstein C. A. Fuchs R. Schack

In a recent paper, Deutsch [1] claims to derive the “probabilistic predictions of quantum theory” from the “non-probabilistic axioms of quantum theory” and the “non-probabilistic part of classical decision theory.” We show that his derivation fails because it includes hidden probabilistic assumptions.

1982
K. A. KALORKOTI

At the 1976 Oxford Conference, Aanderaa introduced a new class of machines which he called F machines (later renamed as modular machines). Using these he gave two remarkably short and easy examples of finitely presented groups with unsolvable word problem. Both of these examples, together with an exposition of modular machines, will be found in a paper by Aanderaa and Cohen [2]. The aim of this...

Journal: :Psychological bulletin 1954
W EDWARDS

Many social scientists other than psychologists try to account for the behavior of individuals. Economists and a few psychologists have produced a large body of theory and a few experiments that deal with individual decision making. The kind of decision making with which this body of theory deals is as follows: given two states, A and B, into either one of which an individual may put himself, t...

2010
Richard Bradley

This paper provides new foundations for Bayesian Decision Theory based on a representation theorem for preferences de…ned on a set of prospects containing both factual and conditional possibilities. This use of a rich set of prospects not only provides a framework within which the main theoretical claims of Savage, Ramsey, Je¤rey and others can be stated and compared, but also allows for the po...

Journal: :AI Magazine 1999
Jon Doyle Richmond H. Thomason

qualitative decision theory: its motivating tasks and issues, its antecedents, and its prospects. Qualitative decision theory studies qualitative approaches to problems of decision making and their sound and effective reconciliation and integration with quantitative approaches. Although it inherits from a long tradition, the field offers a new focus on a number of important unanswered questions...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید