Decision-making under interval uncertainty revisited

Olga Kosheleva (Department of Teacher Education, The University of Texas at El Paso, El Paso, Texas, USA)
Vladik Kreinovich (Department of Computer Science, University of Texas at El Paso, El Paso, Texas, USA)
Uyen Pham (Faculty of Mathematical Economics, University of Economics and Law, Vietnam National University, Ho ChiMinh City, Vietnam)

Asian Journal of Economics and Banking

ISSN: 2615-9821

Article publication date: 28 August 2020

Issue publication date: 27 April 2021

690

Abstract

Purpose

In many real-life situations, we do not know the exact values of the expected gain corresponding to different possible actions, we only have lower and upper bounds on these gains – i.e., in effect, intervals of possible gain values. The purpose of this study is to describe all possible ways to make decisions under such interval uncertainty.

Design/methodology/approach

The authors used both natural invariance and additivity requirements.

Findings

The authors demonstrated that natural requirements – invariance or additivity – led to a two-parametric family of possible decision-making strategies.

Originality/value

This is a first description of all reasonable strategies for decision-making under interval uncertainty – strategies that satisfy natural requirements of invariance or additivity.

Keywords

Citation

Kosheleva, O., Kreinovich, V. and Pham, U. (2021), "Decision-making under interval uncertainty revisited", Asian Journal of Economics and Banking, Vol. 5 No. 1, pp. 79-85. https://doi.org/10.1108/AJEB-07-2020-0030

Publisher

:

Emerald Publishing Limited

Copyright © 2020, Olga Kosheleva, Vladik Kreinovich and Uyen Pham.

License

Published in Asian Journal of Economics and Banking. Published by Emerald Publishing Limited. This article is published under the Creative Commons Attribution (CC BY 4.0) licence. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this licence may be seen at http://creativecommons.org/licences/by/4.0/legalcode


1. Formulation of the problem

Decision-making: a brief reminder. In many real-life situations, we need to select an appropriate action. In economics, a reasonable idea is to select an action that leads to the largest values of the expected gain; e.g. Fishburn (1969), Luce and Raiffa (1989), Raiffa (1997), Nguyen et al. (2009) and Kreinovich (2014). In this manner, if we repeatedly make such a selection, then, because of the law of large numbers, we will obtain the largest possible gain.

Need to consider uncertainty. In practice, we often cannot predict the exact consequence of each possible action. Consequently, for each action a rather than the exact value ua of the expected gain, we only know the interval [u¯a,u¯a] of possible gain values.

Comment. It is often convenient to represent this interval in the equivalent form as [u˜aΔa,u˜a+Δa], where:

u˜a=u¯a+u¯a2  and  Δa=u¯au¯a2.

How do you make decisions under interval uncertainty. How can we make decisions under such interval uncertainty? In other words, when can we decide that Action 1 is better than Action 2? In general, we have three possible cases.

Sometimes, we can guarantee that Action 1 is better than Action 2. This happens if every value u1 from the interval [u¯1,u¯1] is larger than or equal to every value u2 from the interval [u¯2,u¯2]. One can easily verify that this is equivalent to requiring that the smallest possible value u¯1 from the interval [u¯1,u¯1] is larger than or equal to the largest possible value u¯2 from the interval [u¯2,u¯2], i.e.:

u¯1 ≤ u¯2.

Sometimes, we can guarantee that Action 2 is better than Action 1, i.e., every value u2 from the interval [u¯2,u¯2] is larger than or equal to every value u1 from the interval [u¯1,u¯1]. Similar to the previous case, we can conclude that this condition is equivalent to:

u¯1 ≤ u¯2.

In all other cases, i.e., when

u¯2<u¯1  and  u¯1<u¯2,
we cannot make a guaranteed conclusion. In such cases, Action 1 is better, and it can be that Action 2 is better.

So which action should we select? In situations in which we can guarantee that one of the actions if better, this better action is the one we should select. However, what if we are in the situation when no such guarantee is possible? Which action should we then recommend?

This is a question that we consider in this study.

Comment. It is not necessary to provide recommendation for all the cases; however, we would like to be able to provide recommendation for at least some of the cases.

2. Analysis of the problem

What do we want. We want to be able, for some intervals [u¯1,u¯1] and [u¯2,u¯2], to say that the second interval is better (or of the same quality). We will denote this relation by the usual inequality sign:

[u¯1,u¯1] ≤ [u¯2,u¯2].

What are the natural requirements on this relation?

First natural requirement: transitivity. If Action 2 is better than (or of the same quality as) Action 1, and Action 3 is better than (or of the same quality as) Action 2, then we should be able to conclude that Action 3 is better than (or of the same quality as) Action 1, i.e., the relation ≤ on the class of all intervals should be transitive:

(1)  if [u¯1,u¯1][u¯2,u¯2] and [u¯2,u¯2][u¯3,u¯3], then [u¯1,u¯1][u¯3,u¯3].

Second natural requirement: reflexivity. Each interval has the same quality as itself. Therefore, for every interval [u¯,u¯], we should have:

(2) [u¯,u¯][u¯,u¯].

Third natural requirement: consistency with common sense. It is reasonable to require that if Action 2 is guaranteed to be better than Action 1, then we will still select Action 2:

(3) if u¯1u¯2, then [u¯1,u¯1][u¯2,u¯2].

Fourth natural requirement: scale-invariance. If we multiply all gains by the same positive constant c > 0, then whichever gain was larger remains larger, and whichever gain was smaller remains smaller. This multiplication corresponds to switching from the original currency to the one that is c times smaller: the mere change of currency should not change which action is better. Therefore, it is reasonable to require that a similar change of currency should not affect decision-making under uncertainty either, i.e.:

(4)  if [u¯1,u¯1][u¯2,u¯2] then [c·u¯1,c·u¯1][c·u¯2,c·u¯2].

Fifth natural requirement: additivity. If we add the same amount to two gains, this will not change which gain is larger. Similarly, if we add the same interval-valued gain [c¯,c¯] to the gains of both actions, this should not change which action was better.

If we have two independent situations, in one of which the gain can be anything from u¯i to u¯i and in the second one anything from c¯ to c¯, then the smallest possible value of the overall gain is when both gains are the smallest: when we have u¯i+c¯ and the largest possible value of the overall gain is when both gains are the largest, i.e. when we have u¯i+c¯.

Thus, the abovementioned requirement takes the following form:

(5) [u¯1,u¯1][u¯2,u¯2] if and only if [u¯1+c¯,u¯1+c¯][u¯2+c¯,u¯2+c¯].

Final natural requirement: closeness. When the values of u¯ and u¯ are close, the corresponding alternatives are practically indistinguishable. Thus, it is reasonable to require that if we have two sequences of intervals [u¯1(n),u¯1(n)] and [u¯2(n),u¯2(n)] for which [u¯1(n),u¯1(n)][u¯2(n),u¯2(n)], and endpoints of both intervals tends to some limits, then because the limit intervals are indistinguishable from these one for sufficiently large n, we should expect the same relation ≤ for the limit intervals:

if [u¯1(n),u¯1(n)][u¯2(n),u¯2(n)] for all  n, and  u¯i(n)u¯i  and  u¯i(n)u¯i,
(6)  then [u¯1,u¯1][u¯2,u¯2].

Now, we are ready to formulate our primary result.

3. Definitions and the main result

Definition

  • We say that a binary relation ≤ on the set of all intervals is transitive if it satisfies the condition (1).

  • We say that a binary relation ≤ on the set of all intervals is reflexive if it satisfies the condition (2).

  • We say that a binary relation ≤ on the set of all intervals is consistent with common sense if it satisfies the condition (3).

  • We say that a binary relation ≤ on the set of all intervals is scale-invariant if it satisfies the condition (4).

  • We say that a binary relation ≤ on the set of all intervals is additive if it satisfies the condition (5).

  • We say that a binary relation ≤ on the set of all intervals is closed if it satisfies the condition (6).

Proposition. For a binary relation ≤ on the set of all intervals, the following two conditions are equivalent to each other:
  • the relation is transitive, reflexive, consistent with common sense, scale-invariant, additive and closed;

  • for some values α and α+ for which −1≤ α≤ α+≤1, the relation ≤ has the following form: [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2] if and only if either:

    Δ1Δ2  and  u˜1+α·Δ1u˜2+α·Δ2

or

Δ2Δ1  and  u˜1+α+·Δ1u˜2+α+·Δ2.

Comments.

  • The only case when we have a linear order, i.e. when for every two intervals [u¯1,u¯1] and [u¯2,u¯2], we have either [u¯1,u¯1][u¯2,u¯2] or [u¯2,u¯2][u¯1,u¯1], is when α=α+. In this case, we obtain the known Hurwicz criterion for decision-making, e.g., Hurwicz (1951), Luce and Raiffa (1989) and Kreinovich (2014).

  • Relations described in the proposition were first considered in (Stefanini et al., 2019a) and (Stefanini et al., 2019b); however, with an additional requirement that [u¯1,u¯1][u¯2,u¯2] implies u˜1u˜2. This requirement is not always satisfied; see, e.g. for α=α+=1, when

    [u¯1,u¯1][u¯2,u¯2]  if and only  ifu¯1u¯2,
    we have [1,1] ≤ [–2,2]. However, for the midpoints u˜i of these intervals, the opposite inequality is true: 1 > 0.

4. Proof

  1. It is straightforward to confirm that every relation of the above form satisfies conditions (1)-(6). So, to complete the proof, it is sufficient to prove that if a relation satisfies the conditions (1)-(6), then it has the desired form.

  2. Let us first analyze how the interval [−1,1] compares with different real values u (i.e., with degenerate intervals [u,u]).

    • Because of consistency with common sense, we have u[1,1] when u1. Let us denote α=defsup{u:u[1,1]}. This value is a limit of values for which u[1,1]; therefore, because of closeness, α[1,1]. By transitivity, if uα, then we have u[1,1]. By definition of α, if u> α, then we cannot have u[1,1]. Thus, we have:

      (7) u[1,1] if and only if uα.

    • Similarly, because of consistency with common sense, we have [1,1]u when 1 ≤ u. Let us denote α+=definf{u:[1,1]u}. This value is a limit of values for which [1,1]u; therefore, because of closeness, [1,1]α+.

      By transitivity, if α+u, then we have [1,1]u. By definition of α+, if u< α+, then we cannot have [1,1]u. Thus, we have:

      (8) [1,1]u  ifandonlyifα+u.

  3. Let us now compare two general intervals:

    [u˜1Δ1,u˜1+Δ1]  and  [u˜2Δ2,u˜2+Δ2].
    There are three possible cases that we will consider one by one: when Δ12, when Δ1 < Δ 2, and when Δ2< Δ1.
    • When Δ1 = Δ2, then for [c¯,c¯]=[Δ1,Δ1]=[Δ2,Δ2], additivity indicates that:

      [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2] if and only if u˜1u˜2.

      Therefore, in this case, the proposition is proven.

    • Let us now consider the case when Δ1< Δ2. Then, for:

      [c¯,c¯]=[u˜2Δ1,u˜2+Δ1],

      additivity indicates that:

      [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2]  if and only if 
      (9) u˜1u˜2[(Δ2Δ1),Δ2Δ1].

      By applying scale-invariance with c2− Δ1 >0, we conclude that:

      (10) u˜1u˜2[(Δ2Δ1),Δ2Δ1] if and only ifu˜1u˜2Δ2Δ1[1,1].

      Because of (7), this inequality is, in its turn, equivalent to:

      (11) u˜1u˜2Δ2Δ1α.

      Multiplying both sides of this inequality by the positive number Δ2−Δ1, we obtain an equivalent inequality:

      (12) u˜1u˜2α·Δ2α·Δ1,

      i.e. equivalently,

      (13) u˜1+α·Δ1u˜2+α·Δ2.

      Thus, from (9) to (13), we conclude that here, indeed:

      [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2] if and only if 
      (14) u˜1+α·Δ1u˜2+α·Δ2.

    • To complete the proof, we need to consider the case when Δ2< Δ1. Then, for [c¯,c¯]=[u˜1Δ2,u˜1+Δ2], additivity indicates that:

      [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2] if and only if 
      (15) [(Δ1Δ2),Δ1Δ2]u˜2u˜1.

      By applying scale-invariance with c2− Δ1 >0, we conclude that:

      (16) [(Δ1Δ2),Δ1Δ2]u˜2u˜1 if and only if [1,1]u˜2u˜1Δ1Δ2.

      Because of (8), this inequality is, in its turn, equivalent to:

      (17) α+u˜2u˜1Δ1Δ2.

      Multiplying both sides of this inequality by the positive number Δ1−Δ2, we obtain an equivalent inequality:

      (18) α+·Δ1α+·Δ2u˜2u˜1,

      i.e. equivalently,

      (19) u˜1+α+·Δ1u˜2+α+·Δ2.

      Thus, from (15) to (19), we conclude that here indeed:

      [u˜1Δ1,u˜1+Δ1][u˜2Δ2,u˜2+Δ2] if and only if 
      (20) u˜1+α+·Δ1u˜2+α+·Δ2.

      So, in all three cases, the proposition is confirmed.

References

Fishburn, P.C. (1969), Utility Theory for Decision Making, John Wiley and Sons Inc., New York, NY.

Hurwicz, L. (1951), “Optimality criteria for decision making under ignorance”, Cowles commission discussion paper, Statistics, Vol. 1951 No. 370.

Kreinovich, V. (2014), “Decision making under interval uncertainty (and beyond)”, in Guo, P. and Pedrycz, W. (Eds), Human-Centric Decision-Making Models for Social Sciences, Springer Verlag, pp. 163-193.

Luce, R.D. and Raiffa, R. (1989), Games and Decisions: Introduction and Critical Survey, Dover, New York, NY.

Nguyen, H.T., Kosheleva, O. and Kreinovich, V. (2009), “Decision making beyond arrow’s ‘impossibility theorem’, with the analysis of effects of collusion and mutual attraction”, International Journal of Intelligent Systems, Vol. 24 No. 1, pp. 27-47.

Raiffa, H. (1997), Decision Analysis, McGraw-Hill, Columbus, OH.

Stefanini, L., Sorini, L. and Amicizia, B. (2019a), “Interval analysis and calculus for interval-valued functions of a single variable. Part I: partial orders, gH derivative, monotonicity”, Axioms, Vol. 8 No. 4, p. 113.

Stefanini, L., Sorini, L. and Amicizia, B. (2019b), “Interval analysis and calculus for interval-valued functions of a single variable. Part II: extremal points, convexity, periodicity”, Axioms, Vol. 8 No. 4, p. 114.

Acknowledgements

This work was supported in part by the National Science Foundation grants 1623190 (A Model of Change for Preparing a New Generation for Professional Practice in Computer Science) and HRD-1242122 (Cyber-ShARE Center of Excellence).

Corresponding author

Vladik Kreinovich can be contacted at: vladik@utep.edu

Related articles