Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Optimal decision

From Wikipedia, the free encyclopedia
Decision that leads to the best outcome in decision theory
This article includes alist of references,related reading, orexternal links,but its sources remain unclear because it lacksinline citations. Please helpimprove this article byintroducing more precise citations.(September 2018) (Learn how and when to remove this message)

Anoptimal decision is a decision that leads to at least as good a known or expected outcome as all other available decision options. It is an important concept indecision theory. In order to compare the different decision outcomes, one commonly assigns autility value to each of them.

If there is uncertainty as to what the outcome will be but one has knowledge about the distribution of the uncertainty, then under thevon Neumann–Morgenstern axioms the optimal decision maximizes theexpected utility (a probability–weighted average of utility over all possible outcomes of a decision). Sometimes, the equivalent problem of minimizing theexpected value ofloss is considered, where loss is (–1) times utility. Another equivalent problem is minimizing expectedregret.

"Utility" is only an arbitrary term for quantifying the desirability of a particular decision outcome and not necessarily related to "usefulness." For example, it may well be the optimal decision for someone to buy a sports car rather than a station wagon, if the outcome in terms of another criterion (e.g., effect on personal image) is more desirable, even given the higher cost and lack of versatility of the sports car.

The problem of finding the optimal decision is amathematical optimization problem. In practice, few people verify that their decisions are optimal, but instead useheuristics and rules of thumb to make decisions that are "good enough"—that is, they engage insatisficing.

A more formal approach may be used when the decision is important enough to motivate the time it takes to analyze it, or when it is too complex to solve with more simple intuitive approaches, such as many available decision options and a complex decision–outcome relationship.

Formal mathematical description

[edit]

Each decisiond{\displaystyle d} in a setD{\displaystyle D} of available decision options will lead to an outcomeo=f(d){\displaystyle o=f(d)}. All possible outcomes form the setO{\displaystyle O}. Assigning a utilityUO(o){\displaystyle U_{O}(o)} to every outcome, we can define the utility of a particular decisiond{\displaystyle d} as

UD(d) = UO(f(d)).{\displaystyle U_{D}(d)\ =\ U_{O}(f(d)).\,}

We can then define an optimal decisiondopt{\displaystyle d_{\mathrm {opt} }} as one that maximizesUD(d){\displaystyle U_{D}(d)} :

dopt=argmaxdDUD(d).{\displaystyle d_{\mathrm {opt} }=\arg \max \limits _{d\in D}U_{D}(d).\,}

Solving the problem can thus be divided into three steps:

  1. predicting the outcomeo{\displaystyle o} for every decisiond;{\displaystyle d;}
  2. assigning a utilityUO(o){\displaystyle U_{O}(o)} to every outcomeo;{\displaystyle o;}
  3. finding the decisiond{\displaystyle d} that maximizesUD(d).{\displaystyle U_{D}(d).}

Under uncertainty in outcome

[edit]

In case it is not possible to predict with certainty what will be the outcome of a particular decision, a probabilistic approach is necessary. In its most general form, it can be expressed as follows:

Given a decisiond{\displaystyle d}, we know the probability distribution for the possible outcomes described by theconditional probability densityFailed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle p(o|d)}. ConsideringUD(d){\displaystyle U_{D}(d)} as arandom variable (conditional ond{\displaystyle d}), we can calculate the expected utility of decisiond{\displaystyle d} as

EUD(d)=p(o|d)U(o)do{\displaystyle {\text{E}}U_{D}(d)=\int {p(o|d)U(o)do}\,} ,

where the integral is taken over the whole setO{\displaystyle O} (DeGroot, pp 121).

An optimal decisiondopt{\displaystyle d_{\mathrm {opt} }} is then one that maximizesEUD(d){\displaystyle {\text{E}}U_{D}(d)}, just as above:

dopt=argmaxdDEUD(d).{\displaystyle d_{\mathrm {opt} }=\arg \max \limits _{d\in D}{\text{E}}U_{D}(d).\,}

An example is theMonty Hall problem.

See also

[edit]

References

[edit]
  • Morris DeGrootOptimal Statistical Decisions. McGraw-Hill. New York. 1970.ISBN 0-07-016242-5.
  • James O. BergerStatistical Decision Theory and Bayesian Analysis. Second Edition. 1980. Springer Series in Statistics.ISBN 0-387-96098-8.
Continuous data
Center
Dispersion
Shape
Count data
Summary tables
Dependence
Graphics
Study design
Survey methodology
Controlled experiments
Adaptive designs
Observational studies
Statistical theory
Frequentist inference
Point estimation
Interval estimation
Testing hypotheses
Parametric tests
Specific tests
Goodness of fit
Rank statistics
Bayesian inference
Correlation
Regression analysis
Linear regression
Non-standard predictors
Generalized linear model
Partition of variance
Categorical
Multivariate
Time-series
General
Specific tests
Time domain
Frequency domain
Survival
Survival function
Hazard function
Test
Biostatistics
Engineering statistics
Social statistics
Spatial statistics
Authority control databases: NationalEdit this at Wikidata
Retrieved from "https://en.wikipedia.org/w/index.php?title=Optimal_decision&oldid=1249708258"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp