Towards Decision Making under Interval Uncertainty

Similar documents
Decision Making Under Interval Uncertainty as a Natural Example of a Quandle

Decision Making under Interval Uncertainty: What Can and What Cannot Be Computed in Linear Time and in Real Time

Decision Making under Interval and Fuzzy Uncertainty: Towards an Operational Approach

Decision Making Under Interval Uncertainty: Beyond Hurwicz Pessimism-Optimism Criterion

Towards Decision Making under General Uncertainty

Why Bellman-Zadeh Approach to Fuzzy Optimization

On Decision Making under Interval Uncertainty: A New Justification of Hurwicz Optimism-Pessimism Approach and Its Use in Group Decision Making

Towards Selecting the Best Abstraction for a Patrolling Game

Decision Making Beyond Arrow s Impossibility Theorem, with the Analysis of Effects of Collusion and Mutual Attraction

Positive Consequences of Negative Attitude: Game-Theoretic Analysis

Why Copulas? University of Texas at El Paso. Vladik Kreinovich University of Texas at El Paso,

How to Define Relative Approximation Error of an Interval Estimate: A Proposal

Towards Foundations of Interval and Fuzzy Uncertainty

Positive Consequences of Negative Attitude: Game-Theoretic Analysis

Decision Making under Interval (and More General) Uncertainty: Monetary vs. Utility Approaches

Checking Monotonicity is NP-Hard Even for Cubic Polynomials

How to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets

Random Utility Functions are Uniquely Determined by User Preferences

When Can We Reduce Multi-Variable Range Estimation Problem to Two Fewer-Variable Problems?

How to Assign Weights to Different Factors in Vulnerability Analysis: Towards a Justification of a Heuristic Technique

Similarity Beyond Correlation: Symmetry-Based Approach

Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help

Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach

How to Bargain: An Interval Approach

Computing Standard-Deviation-to-Mean and Variance-to-Mean Ratios under Interval Uncertainty is NP-Hard

Voting Aggregation Leads to (Interval) Median

Propagation of Probabilistic Uncertainty: The Simplest Case (A Brief Pedagogical Introduction)

Computability of the Avoidance Set and of the Set-Valued Identification Problem

How to Distinguish True Dependence from Varying Independence?

Which Bio-Diversity Indices Are Most Adequate

Towards Designing Optimal Individualized Placement Tests

How to Make Plausibility-Based Forecasting More Accurate

Exponential Disutility Functions in Transportation Problems: A New Theoretical Justification

Exact Bounds on Sample Variance of Interval Data

Why Locating Local Optima Is Sometimes More Complicated Than Locating Global Ones

Computation in Quantum Space-time Could Lead to a Super-polynomial Speedup

Decision Making under Interval (and More General) Uncertainty: Monetary vs. Utility Approaches

Towards a Localized Version of Pearson's Correlation Coefficient

Towards a More Physically Adequate Definition of Randomness: A Topological Approach

Membership Functions Representing a Number vs. Representing a Set: Proof of Unique Reconstruction

Use of Grothendieck s Inequality in Interval Computations: Quadratic Terms are Estimated Accurately (Modulo a Constant Factor)

Towards Optimal Allocation of Points to Different Assignments and Tests

Towards A Physics-Motivated Small-Velocities Approximation to General Relativity

Why Trapezoidal and Triangular Membership Functions Work So Well: Towards a Theoretical Explanation

Modeling Extremal Events Is Not Easy: Why the Extreme Value Theorem Cannot Be As General As the Central Limit Theorem

Towards Fast and Reliable Localization of an Underwater Object: An Interval Approach

How to Explain Usefulness of Different Results when Teaching Calculus: Example of the Mean Value Theorem

Combining Interval and Probabilistic Uncertainty in Engineering Applications

Multi-Criteria Optimization - an Important Foundation of Fuzzy System Design

Full Superposition Principle Is Inconsistent with Non-Deterministic Versions of Quantum Physics

How to Explain Ubiquity of Constant Elasticity of Substitution (CES) Production and Utility Functions Without Explicitly Postulating CES

How to Measure Loss of Privacy

Interval Computations as an Important Part of Granular Computing: An Introduction

Combining Interval, Probabilistic, and Fuzzy Uncertainty: Foundations, Algorithms, Challenges An Overview

Increased Climate Variability Is More Visible Than Global Warming: A General System-Theory Explanation

Kekule's Benzene Structure: A Case Study of Teaching Usefulness of Symmetry

Multiattribute decision making models and methods using intuitionistic fuzzy sets

Do It Today Or Do It Tomorrow: Empirical Non- Exponential Discounting Explained by Symmetry and Fuzzy Ideas

Monchaya Chiangpradit 1, Wararit Panichkitkosolkul 1, Hung T. Nguyen 1, and Vladik Kreinovich 2. 2 University of Texas at El Paso

How to Estimate Expected Shortfall When Probabilities Are Known with Interval or Fuzzy Uncertainty

Optimizing Computer Representation and Computer Processing of Epistemic Uncertainty for Risk-Informed Decision Making: Finances etc.

Formalizing the Informal, Precisiating the Imprecise: How Fuzzy Logic Can Help Mathematicians and Physicists by Formalizing Their Intuitive Ideas

From Mean and Median Income to the Most Adequate Way of Taking Inequality Into Account

Product of Partially Ordered Sets (Posets), with Potential Applications to Uncertainty Logic and Space-Time Geometry

Information, Utility & Bounded Rationality

Only Intervals Preserve the Invertibility of Arithmetic Operations

Why in Mayan Mathematics, Zero and Infinity are the Same: A Possible Explanation

Computing with Words: Towards a New Tuple-Based Formalization

Pure Quantum States Are Fundamental, Mixtures (Composite States) Are Mathematical Constructions: An Argument Using Algorithmic Information Theory

A New Cauchy-Based Black-Box Technique for Uncertainty in Risk Analysis

Why Curvature in L-Curve: Combining Soft Constraints

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

ESTIMATING STATISTICAL CHARACTERISTICS UNDER INTERVAL UNCERTAINTY AND CONSTRAINTS: MEAN, VARIANCE, COVARIANCE, AND CORRELATION ALI JALAL-KAMALI

Best Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty

How to Make a Proof of Halting Problem More Convincing: A Pedagogical Remark

Computing With Tensors: Potential Applications of Physics-Motivated Mathematics to Computer Science

Computational Aspects of Aggregation in Biological Systems

Key words: MaxEnt, expert systems, uncertainty, commonsense reasoning, intelligent control

An Uncertain Bilevel Newsboy Model with a Budget Constraint

New Algorithms for Statistical Analysis of Interval Data

Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations

Logic of Scientific Discovery: How Physical Induction Affects What Is Computable

Decisions under Uncertainty. Logic and Decision Making Unit 1

Density-Based Fuzzy Clustering as a First Step to Learning the Rules: Challenges and Possible Solutions

Adjoint Fuzzy Partition and Generalized Sampling Theorem

New Algorithms for Statistical Analysis of Interval Data

Credibilistic Bi-Matrix Game

Improving analytic function approximation by minimizing square error of Taylor polynomial

An Analytic Method for Solving Uncertain Differential Equations

Towards Symmetry-Based Explanation of (Approximate) Shapes of Alpha-Helices and Beta- Sheets (and Beta-Barrels) in Protein Structure

Inverse problems in theory and practice of measurements and metrology

Decision Analysis. An insightful study of the decision-making process under uncertainty and risk

International Journal of Statistics: Advances in Theory and Applications

We Live in the Best of Possible Worlds: Leibniz's Insight Helps to Derive Equations of Modern Physics

Image and Model Fusion: Unexpected Counterintuitive Behavior of Traditional Statistical Techniques and Resulting Need for Expert Knowledge

Multiplication of Multinomial Subjective Opinions

Price and Capacity Competition

A SIMULATION AIDED SOLUTION TO AN MCDM PROBLEM. Ferenc Szidarovszky Abdollah Eskandari

Notes and Solutions #6 Meeting of 21 October 2008

arxiv: v1 [cs.ds] 17 Jul 2013

Transcription:

Journal of Uncertain Systems Vol.1, No.3, pp.00-07, 018 Online at: www.us.org.uk Towards Decision Making under Interval Uncertainty Andrze Pownuk, Vladik Kreinovich Computational Science Program, University of Texas at El Paso, El Paso, TX 79968, USA Received 10 December 016; Revised 19 December 016 Abstract In many practical situations, we know the exact form of the obective function, and we know the optimal decision corresponding to each values of the corresponding parameters x i. What should we do if we do not know the exact values of x i, and instead, we only know each x i with uncertainty e.g., with interval uncertainty? In this case, one of the most widely used approaches is to select, for each i, one value from the corresponding interval usually, a midpoint and to use the exact-case optimal decision corresponding to the selected values. Does this approach lead to the optimal solution to the intervaluncertainty problem? If yes, is selecting the midpoints the best idea? In this paper, we provide answers to these questions. It turns out that the selecting-a-valued-from-each-interval approach can indeed lead us to the optimal solution for the interval problem but not if we select midpoints. c 018 World Academic Press, UK. All rights reserved. Keywords: decision making, interval uncertainty, Hurwicz optimism-pessimism criterion 1 Formulation of the Practical Problem Often, we know the ideal-case solution. One of the main obectives of science and engineering is to provide an optimal decision in different situations. In many practical situations, we have an algorithm that provides an optimal decision based under the condition that we know the exact values of the corresponding parameters x 1,..., x n. In practice, we need to take uncertainty into account. In practice, we usually know x i with some uncertainty. For example, often, for each i, we only know an interval [x i, x i ] that contains the actual (unknown) value x i ; see, e.g., [7]. A problem. In the presence of such interval uncertainty, how can we find the optimal solution? One of the most widely used approaches uses the fact that under interval uncertainty, we can implement decisions corresponding to different combinations of values x i [x i, x i ]. Is this indeed a way to the solution which is optimal under interval uncertainty? If yes, which values should we choose? Often, practitioners select the midpoints, but is this selection the best choice? These are the questions that we answer in this paper. Formulation of the Problem in Precise Terms Decision making: a general description. In general, we need to make a decision u = (u 1,, u m ) based on the state x = (x 1,, x n ) of the system. According to decision theory, a rational person selects a decision that maximizes the value of an appropriate function known as utility; see, e.g., [1, 4, 5, 8]. We will consider situations when or each state x and for each decision u, we know the value of the utility f(x, u) corresponding to us choosing u. Then, when we know the exact state x of the system, the optimal decision u opt (x) is the decision for which this utility is the largest possible: Corresponding author. Emails: ampownuk@utep.edu (A. Pownuk), vladik@utep.edu (V. Kreinovich). f(x, u opt (x)) = max f(x, u). (1) u

Journal of Uncertain Systems, Vol.1, No.3, pp.00-07, 018 01 Decision making under interval uncertainty. In practice, we rarely know the exact state of the system, we usually know this state with some uncertainty. Often, we do not know the probabilities of different possible states x, we only know the bounds on different parameters describing the state. The bounds mean that for each i, instead of knowing the exact values of x i, we only know the bounds x i and x i on this quantity, i.e., we only know that the actual (unknown) value x i belongs to the interval [x i, x i ]. The question is: what decision u should we make in this case? We also assume that the uncertainty with which we know x is relatively small, so in the corresponding Taylor series, we can only keep the first few terms in terms of this uncertainty. Decision making under interval uncertainty: towards a precise formulation of the problem. Because of the uncertainty with which we know the state x, for each possible decision u, we do not know the exact value of the utility, we only know that this utility is equal to f(x, u) for some x i [x i, x i ]. Thus, all we know is that this utility value belongs to the interval [ ] min f(x 1,, x n, u), max f(x 1,, x n, u). () x i [x i,x i] x i [x i,x i] According to decision theory (see, e.g., [, 3, 4]), if for every action a, we only know the interval [f (a), f + (a)] of possible values of utility, then we should select the action for which the following combination takes the largest possible value: α f + (a) + (1 α) f (a), (3) where the parameter α [0, 1] describes the decision maker s degree of optimism-pessimism: the value α = 1 means that the decision maker is a complete optimist, only taking into account the best-case situations, the value α = 0 means that the decision maker is a complete pessimist, only taking into account the worst-case situations, and intermediate value α (0, 1) means that the decision maker takes into account both worst-case and best-case scenarios. Resulting formulation of the problem. In these terms our goal is: given the function f(x, u) and the bounds x and x, to find the value u for which the following obective function takes the largest possible value: α max f(x 1,, x n, u) + (1 α) min f(x 1,, x n, u) max. (4) x i [x i,x i] x i [x i,x i] u Comment. The simplest case when the state x is characterized by a single parameter and when a decision u is also described by a single number, was analyzed in [6]. 3 Analysis of the Problem We assumed that the uncertainty is small, and that in the corresponding Taylor expansions, we can keep only a few first terms corresponding to this uncertainty. Therefore, it is convenient to describe this uncertainty explicitly. Let us denote the midpoint (x i + x i )/ of the interval [x i, x i ] by x i. Then, each value x i from this interval can be represented as x i = x i + x i, where we denoted x i = x i x i. The range of possible values of x i is [x i x i, x i x i ] = [ i, i ], where we denoted i = x i x i.

0 A. Pownuk and V. Kreinovich: Towards Decision Making under Interval Uncertainty The differences x i are small, so we should be able to keep only the few first terms in x i. When all the values x i are known exactly, the exact-case optimal decision is u opt (x). Since uncertainty is assumed to be small, the optimal decision u = (u 1,, u m ) under interval uncertainty should be close to the exact-case optimal decision ũ = (ũ 1,, ũ m ) = u opt ( x) corresponding to the midpoints of all the intervals. So, the difference u = u ũ should also be small. In terms of u, the interval-case optimal value u has the form u = ũ + u. Substituting x i = x i + x i and u = ũ + u into the expression f(x, u) for the utility, and keeping only linear and quadratic terms in this expansion, we conclude that where we denoted f(x, u) = f( x + x, ũ + u) = f( x, ũ) + f xi x i + f u u + 1 i =1 f xix i x i x i + f xiu x i u + 1 f uu u u, (5) f xi = f ( x, ũ ), f u = f ( x, ũ), f xix x i u i = f ( x, ũ), x i x i f xiu = f ( x, ũ), f uu x i u = f ( x, ũ). u u To find an explicit expression for the obective function (4), we need to find the maximum and the minimum of this obective function when u is fixed and x i [x i, x i ], i.e., when x i [ i, i ]. To find the maximum and the minimum of a function of an interval, it is useful to compute its derivative. For the obective function (5), we have f = f xi + f xix x i x i + f xiu u. (6) i i =1 In general, the value f xi is different from 0; possible degenerate cases when f xi = 0 seem to be rare. On a simple example when the state is described by a single quantity x = x 1 and the decision u is also described by a single quantity u = u 1 let us explain why we believe that this degenerate case can be ignored. 4 Explaining Why, in General, We Have f xi 0 Simple case. Let us assume that the state x is the difference x = T T ideal between the actual temperature T and the ideal temperature T ideal. In this case, T = T ideal + x. Let u be the amount of degree by which we cool down the room. Then, the resulting temperature in the room is T = T u = T ideal + x u. The difference T T ideal between the resulting temperature T and the ideal temperature T ideal is thus equal to x u. It is reasonable to assume that the discomfort D depends on this difference d: D = D(d). The discomfort is 0 when the difference is 0, and is positive when the difference is non-zero. Thus, if we expand the dependence D(d) in Taylor series and keep only quadratic terms in this expansion D(d) = d 0 + d 1 d + d d, we conclude that d 0 = 0, that d 1 = 0 (since the function D(d) has a minimum at d = 0), and thus, that D(d) = d d = d (x u), for some d > 0. So the utility which is negative this discomfort is equal to f(x, u) = d (x u). In this case, for each state x, the exact-case optimal decision is u opt (x) = x. Thus, at the point where x = x 0 and u = u 0 = u opt (x) = x 0, we have f x = f x = d (x 0 u 0 ) = 0. So, we have exactly the degenerate case that we were trying to avoid. Let us make the description of this case slightly more realistic. Let us show that if we make the description more realistic, the derivative f x is no longer equal to 0.

Journal of Uncertain Systems, Vol.1, No.3, pp.00-07, 018 03 Indeed, in the above simplified description, we only took into account the discomfort of the user when the temperature in the room is different from the ideal. To be realistic, we need to also take into account that there is a cost C(u) associated with cooling (or heating). This cost is 0 when u = 0 and is non-negative when u 0, so in the first approximation, similarly to how we described D(d), we conclude that C(u) = k u, for some k > 0. The need to pay this cost decreases the utility function which now takes the form f(x, u) = d (x u) k u. For this more realistic utility function, the value u opt (x) that maximizes the utility for a given x can be found if we differentiate the utility function with respect to u and equate the derivative to 0. Thus, we get hence (d + k) u d x = 0, and d (u x) + k u = 0, u opt (x) = d d + k x. For x = x 0 and u = u 0 = u opt (x 0 ) = x 0 d /(d + k), we thus get f x = f ( x = (x 0 u 0 ) = x 0 d ) d + k x 0 = k d + k x 0 0. So, if we make the model more realistic, we indeed get a non-degenerate case f x 0 that we consider in our paper. 5 Analysis of the Problem (continued) We consider the non-degenerate case, when f xi 0. Since we assumed that all the differences x i and u are small, a linear combination of these differences is smaller than f xi. Thus, for all values x i from the corresponding intervals x i [ i, i ], the sign of the derivative f is the same as the sign s xi = sign(f xi ) x i of the midpoint value f xi. Hence: when f xi > 0 and s xi = +1, the function f(x, u) is an increasing function of x i ; its maximum is attained when x i is attained its largest possible values x i, i.e., when x i = i, and its minimum is attained when x i = i ; when f xi < 0 and s xi = 1, the function f(x, u) is an decreasing function of x i ; its maximum is attained when x i is attained its smallest possible values x i, i.e., when x i = i, and its minimum is attained when x i = i. In both cases, the maximum of the utility function f(x, u) is attained when x i = s xi i and its minimum is attained when x i = s xi i. Thus, max f(x 1,, x n, u) = f( x 1 + s x1 1,, x n + s xn n, ũ + u) x i [x i,x i] and = f( x, ũ) + f xi s xi i + f u u + 1 i =1 f xix i s xi s xi i i + f xiu s xi i u + 1 f uu u u, (7) min f(x 1,, x n, u) = f( x 1 s x1 1,, x n s xn n, ũ + u) x i [x i,x i]

04 A. Pownuk and V. Kreinovich: Towards Decision Making under Interval Uncertainty = f( x, ũ) f xi s xi i + f u u + 1 i =1 f xix i s xi s xi i i f xiu s xi i u + 1 f uu u u. (8) Therefore, our obective function (4) takes the form α max f(x 1,, x n, u) + (1 α) min f(x 1,, x n, u) x i [x i,x i] x i [x i,x i] = f( x, ũ) + (α 1) +(α 1) f xi s xi i + f u u + 1 i =1 f xix i s xi s xi i i f xiu s xi i u + 1 f uu u u. (9) To find the interval-case optimal value u max = u ũ for which the obective function (4) attains its largest possible value, we differentiate the expression (9) for the obective function (4) with respect to u and equate the derivative to 0. As a result, we get: f u + (α 1) f xiu s xi i + f uu u max = 0. (10) To simplify this expression, let us now take into account that for each x = (x 1,, x n ), the function f(x, u) attains its maximum at the known value u opt (x). Differentiating expression (5) with respect to u and equating the derivative to 0, we get: f u + f xiu x i + f uu opt u = 0, (11) where we denoted opt u = u opt u. For x = x, i.e., when x i = 0 for all i, this maximum is attained when u = ũ, i.e., when u = 0 for all. Substituting x i = 0 and u = 0 into the formula (11), we conclude that f u = 0 for all. Thus, the formula (10) takes a simplified form (α 1) f xiu s xi i + f uu u max = 0. (1) In general, we can similarly expand u opt (x) in Taylor series and keep only a few first terms in this expansion: where we denoted u opt (x 1,..., x n ) = u opt ( x 1 + x 1,, x n + x n ) = ũ + Thus, for the exact-case optimal decision, u opt Substituting this expression for u opt u,xi = uopt = u opt (x) ũ = x i. u,xi x i, (13) u,xi x i. (14) into the formula (11), we conclude that f xiu x i + f uu u,x i x i = 0,

Journal of Uncertain Systems, Vol.1, No.3, pp.00-07, 018 05 i.e., that x i f xiu + f uu u,x i = 0 for all possible combinations of x i. Thus, for each i, the coefficient at x i is equal to 0, i.e., for all i and, so f xiu + f xiu f uu u,x i = 0 = f uu u,x i. (15) Substituting the expression (15) into the formula (1), we conclude that i.e., that (α 1) f uu u,x i (s xi i ) + f uu max = 0, ( ) n f uu u max (α 1) u,x i (s xi i ) = 0. This equality is achieved when u max for all. So, the interval-case optimal values can be described as n = (α 1) u,x i (s xi i ) (16) u max u max = ũ + (α 1) = ũ + u max In general, as we have mentioned earlier (formula (13)), we have u,xi (s xi i ). (17) u opt ( x 1 + x 1,, x n + x n ) = ũ + By comparing the formulas (17) and (18), we can see that u max u,xi x i. (18) s = x + (α 1) s xi i, is equal to u opt (s) when we take i.e., that Here, s xi u max = u opt ( x 1 + (α 1) s x1 1,, x n + (α 1) s xn n ). (19) is the sign of the derivative f xi. We have two options: If f xi > 0, i.e., if the obective function increases with x i, then s xi = 1, and the expression in the formula (19) takes the form s i = x i + x i s i = x i + (α 1) s xi i + (α 1) xi x i = α x i + (1 α) x i. (0)

06 A. Pownuk and V. Kreinovich: Towards Decision Making under Interval Uncertainty If f xi < 0, i.e., if the obective function decreases with x i, then s xi = 1, and the expression in the formula (19) takes the form s i = x i + (α 1) s xi i s i = x i + x i (α 1) xi x i = α x i + (1 α) x i. (1) So, we arrive at the following recommendation. 6 Solution to the Problem Formulation of the problem: reminder. We assume that we know the obective function f(x, u) that characterizes our gain in a situation when the actual values of the parameters are x = (x 1,, x n ) and we select an alternative u = (u 1,, u m ). We also assume that for every state x, we know the exact-case optimal decision u opt (x) for which the obective function attains its largest possible value. In a practical situation in which we only know that each value x i is contained in an interval [x i, x i ], we need to find the alternative u max = (u max 1,, u max m ) that maximizes the Hurwicz combination of the best-case and worst-case values of the obective function. Description of the solution. The solution to our problem is to use the exact-case optimal solution u opt (s) corresponding to an appropriate state s = (s 1,, s n ). Here, for the variables x i for which the obective function is an increasing function of x i, we should select s i = α x i + (1 α) x i, () where α is the optimism-pessimism parameter that characterizes the decision maker. For the variables x i for which the obective function is a decreasing function of x i, we should select s i = α x i + (1 α) x i. (3) Comment. Thus, the usual selection of the midpoint s is only interval-case optimal for decision makers for which α = 0.5; in all other cases, this selection is not interval-case optimal. Discussion. Intuitively, the above solution is in good accordance with the Hurwicz criterion: when the obective function increases with x i, the best possible situation corresponds to x i, and the worst possible situation corresponds to x i ; thus, the Hurwicz combination corresponds to the formula (); when the obective function decreases with x, the best possible situation corresponds to x i, and the worst possible situation corresponds to x i ; thus, the Hurwicz combination corresponds to the formula (3). This intuitive understanding is, however, not a proof Hurwicz formula combines utilities, not parameter values. Acknowledgments This work was supported in part by the National Science Foundation grants HRD-073485 and HRD-141 (Cyber-ShARE Center of Excellence) and DUE-09671, and by an award UTEP and Prudential Actuarial Science Academy and Pipeline Initiative from Prudential Foundation. The authors are thankful to all the participants of the 016 Annual Conference of the North American Fuzzy Information Processing Society NAFIPS 016 (El Paso, Texas, October 31 November 4, 016) or valuable discussions.

Journal of Uncertain Systems, Vol.1, No.3, pp.00-07, 018 07 References [1] Fishburn, P.C., Utility Theory for Decision Making, John Wiley & Sons Inc., New York, 1969. [] Hurwicz, L., Optimality Criteria for Decision Making under Ignorance, Cowles Commission Discussion Paper, Statistics, no.370, 1951. [3] Kreinovich, V., Decision making under interval uncertainty (and beyond), Human-Centric Decision-Making Models for Social Sciences, edited by Guo, P. and W. Pedrycz, Springer Verlag, pp.163 193, 014. [4] Luce, R.D., and R. Raiffa, Games and Decisions: Introduction and Critical Survey, Dover, New York, 1989. [5] Nguyen, H.T., Kosheleva, O., and V. Kreinovich, Decision making beyond Arrow s impossibility theorem, with the analysis of effects of collusion and mutual attraction, International Journal of Intelligent Systems, vol.4, no.1, pp.7 47, 009. [6] Pownuk, A., and V. Kreinovich, Which point from an interval should we choose?, Proceedings of the 016 Annual Conference of the North American Fuzzy Information Processing Society NAFIPS 016, El Paso, Texas, October 31 November 4, 016. [7] Rabinovich, S.G., Measurement Errors and Uncertainty. Theory and Practice, Springer Verlag, Berlin, 005. [8] Raiffa, H., Decision Analysis, Addison-Wesley, Reading, Massachusetts, 1970.