Decisions with Uncertain Consequences -- A Total Ordering on Loss-Distributions
Decisions are often based on imprecise, uncertain or vague information. Likewise, the consequences of an action are often equally unpredictable, thus putting the decision maker into a twofold jeopardy. Assuming that the effects of an action can be modeled by a random variable, then the decision problem boils down to comparing different effects (random variables) by comparing their distribution functions. Although the full space of probability distributions cannot be ordered, a properly restricted subset of distributions can be totally ordered in a practically meaningful way. We call these loss-distributions, since they provide a substitute for the concept of loss-functions in decision theory. This article introduces the theory behind the necessary restrictions and the hereby constructible total ordering on random loss variables, which enables decisions under uncertainty of consequences. Using data obtained from simulations, we demonstrate the practical applicability of our approach.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Impossibility and Uncertainty Theorems in AI Value Alignment (or why your AGI should not have a utility function)
Utility functions or their equivalents (value functions, objective functions, loss functions, reward functions, preference orderings) are a central tool in most current machine learning systems. These mechanisms for defi…
BIG-bench Machine LearningOn Game-Theoretic Risk Management (Part One) -- Towards a Theory of Games with Payoffs that are Probability-Distributions
Optimal behavior in (competitive) situation is traditionally determined with the help of utility functions that measure the payoff of different actions. Given an ordering on the space of revenues (payoffs), the classical…
ManagementEfficiently Exploring Ordering Problems through Conflict-directed Search
In planning and scheduling, solving problems with both state and temporal constraints is hard since these constraints may be highly coupled. Judicious orderings of events enable solvers to efficiently make decisions over…
BenchmarkingSchedulingSubjective Risk Decomposition: A New View for Uncertainty Quantification
We present a novel viewpoint for uncertainty quantification. Uncertainty measures are not primitives, in need of axioms and argumentation, but instead consequences, of higher-level modelling decisions. We show how episte…
Generalized Conflict-directed Search for Optimal Ordering Problems
Solving planning and scheduling problems for multiple tasks with highly coupled state and temporal constraints is notoriously challenging. An appealing approach to effectively decouple the problem is to judiciously order…
BenchmarkingScheduling