Filetype PDF | Posted on 27 Jan 2023 | 3 years ago
Authentication
digital resources
278x Filetype PDF File size 0.46 MB Source: ceur-ws.org
One Approach to Fuzzy Matrix Games
1 2 3
Konstantin N. Kudryavtsev , Irina S. Stabulit , and Viktor I. Ukhobotov
1 South Ural State University, Chelyabinsk, Russia
kudrkn@gmail.com
2 South Ural State Agrarian University, Chelyabinsk, Russia
irisku76@mail.ru
3 Chelyabinsk State University, Chelyabinsk, Russia
ukh@csu.ru
Abstract. The paper is concerned with a two-person zero sum matrix
game with fuzzy payoffs, with saddle-point being defined with a clas-
sic definition in matrix game. In order to compare fuzzy numbers some
different ordering operators can be used. The original game can be asso-
ciated with the bimatrix game with crisp payoffs which are the operators
value on a fuzzy payoff. We propose that every player use its ordering
operator. The following statement can be proposed: when the ordering
operators are linear, the same equilibrium strategy profile can be used
for the matrix game, with fuzzy payoffs being the same for the bimatrix
crisp game. We introduce and employ the algorithm of constructing a
saddle-point in a two-person zero sum matrix game with fuzzy payoffs.
In the instances of matrix games we use such ordering operators and
construct the saddle-point.
Keywords: Fuzzy game · Matrix game · Saddle-point · Nash equilib-
rium
1 Introduction
Game theory is well known to take a significant part in decision making, this
theory being often used to model the real world. Applied in real situations the
game theory is difficult to have strict values of payoffs, because it is difficult for
players to analyze some data of game. Thus, the players’ information cannot be
considered complete. Besides the players can have vague targets.
This uncertainty and lack of precision may be modeled as fuzzy games. Fuzzy
sets are known to be initially used in non-cooperative game theory by Butnariu
[3] to prove the belief of each player for strategies of other players. Since then
fuzzy set theory has been applied in cooperative and non-cooperative games.
The results of fuzzy games overview are given in [10]. Recently there were made
c
Copyright
by the paper’s authors. Copying permitted for private and academic purposes.
In: S. Belim et al. (eds.): OPTA-SCL 2018, Omsk, Russia, published at http://ceur-ws.org
One Approach to Fuzzy Matrix Games 229
various efforts in fuzzy bi-matrix game theory namely Maeda [11], Nayak [13],
Dutta [6], Seikh [14], Verma and Kumar [16].
In [9], we represented the approach which generalizes some other ideas ([4],
[5],[6] at al.).
2 Fuzzy Numbers
In this part, some basic definitions and results of fuzzy numbers and fuzzy arith-
metic operations will be reminded. Here we will follow to [21].
˜
A fuzzy set can be considered as a subset A of universal set X ⊆ R by its
membership function µ˜(·) with a real number µ˜(x) in the interval [0,1] and
A A
assigns to each element x ∈ R. ˜
Definition 2.1. A fuzzy subset A defined on R, is said to be a fuzzy number if
its membership function µ˜(x) comply with the following conditions:
A
(1) µ˜(x) : R → [0,1] is upper semi-continuous;
A
(2) µ˜(x) = 0 for ∀x 6∈ [a,d];
A
(3) There exist real numbers b, c such that a 6 b 6 c 6 d and
(a) x µ˜(x ) ∀x ,x ∈[a,b];
1 2 A 1 A 2 1 2
(c) µ˜(x) = 1, ∀x ∈ [b,c].
A
˜
Theα-cutofafuzzynumberAplaysanimportantroleinparametricordering
˜ ˜
of fuzzy numbers. The α-cut or α-level set of a fuzzy number A, denoted by A ,
α
˜
is defined as Aα = {x ∈ R|µ˜(x) > α} for all α ∈ (0,1]. The support or 0-cut
A
˜ ˜
A0 is defined as the closure of the set A0 = {x ∈ R|µ˜(x) > 0}. Every α-cut is a
A
˜
closed interval Aα = [g˜(α),G˜(α)] ⊂ R, where g˜(α) = inf{x ∈ R|µ˜(x) > α}
A A A A
and G˜(α) = sup{x ∈ R|µ˜(x) > α} for any α ∈ [0,1].
A A
The sets of fuzzy number is denoted as F. Then, two types of fuzzy numbers
are used.
˜ ˜
Definition 2.2. Let A be a fuzzy number. If the membership function of A is
given by
x−a+l, for x ∈ [a−l,a],
l
µ˜(x) = a+r−x, for x ∈ [a,a+r],
A r
0, otherwise,
where, a, l and r are all real (crisp) numbers, and l, r are non-negative. Then
˜ ˜
Ais called a triangular fuzzy number, denoted by A = (a,l,r).
The sets of triangular fuzzy number are denoted as F3.
˜ ˜
Definition 2.3. Let A be a fuzzy number. If the membership function of A is
given by
x−a+l, for x ∈ [a−l,a],
l
µ˜(x) = 1, for x ∈ [a,b]
A b+r−x,for x∈[b,b+r],
r
0, otherwise,
where, a, b, l and r are all real (crisp) numbers, and l, r are non-negative. Then
˜ ˜
A is called a trapezoidal fuzzy number, denoted by A = (a,b,l,r). [a,b] is the
˜
core of A.
230 K. Kudryavtsev et al.
The sets of trapezoidal fuzzy number are denoted as F4.
˜ ˜
If A = (a ,l ,r ) and B = (a ,l ,r ) are two triangular fuzzy numbers,
1 1 1 2 2 2
˜ ˜
arithmetic operations on A and B are defined as follows:
˜ ˜ ˜ ˜
Addition: A+B = C = (a +a ,l +l ,r +r ), C ∈ F .
1 2 1 2 1 2 3
Scalar multiplication: ∀ k > 0, k ∈ R,
˜ ˜
kA=(ka ,kl ,kr ), kA∈F .
1 1 1 3
˜ ˜
If A = (a ,b ,l ,r ) and B = (a ,b ,l ,r ) are two trapezoidal fuzzy num-
1 1 1 1 2 2 2 2
˜ ˜
bers, arithmetic operations on A and B are defined as follows:
˜ ˜ ˜ ˜
Addition: A+B = C = (a +a ,b +b ,l +l ,r +r ), C ∈ F .
1 2 1 2 1 2 1 2 4
Scalar multiplication: ∀ k > 0, k ∈ R,
˜ ˜
kA=(ka ,kb ,kl ,kr ), kA ∈ F .
1 1 1 1 4
˜ ˜ ˜ ˜ ˜ ˜ ˜
Generaly, if A and B are two fuzzy numbers and A + B = C, λA = D and
λ=const>0, then
˜
Cα =[g˜(α)+g˜(α),G˜(α)+G˜(α)],
A B A B
and
˜
D =[λg˜(α),λG˜(α)]
α A A
for any α ∈ [0,1].
To compare fuzzy numbers is crucial issue. There are plenty of various meth-
ods for comparing fuzzy numbers. For instance, fuzzy numbers can be ranked
with the help of defuzzification methods.Defuzzification is the process of produc-
ing a real (crisp) value which correspond to a fuzzy number, the defuzzification
approach being used for ranking fuzzy numbers. Fuzzy numbers are initially
defuzzified and then the obtained crisp numbers are organised using the order
relation of real numbers.
Afunction for ranking fuzzy subsets in unit interval was introduced by Yager
in [17]. It was based on the integral of mean of the α-cuts. Yager index is
1
˜ 1 Z
Y(A)= (g˜(α)+G˜(α))dα.
2 A A
0
Another methods for ordering fuzzy subsets in the unit interval were sug-
gested by Jain in [8], Baldwin and Guild in [1].
Thesubjective approach for ranking fuzzy numbers was developed by Ibanez
and Munoz in [7], the following number as the average index for fuzzy number
˜
Abeind defined in [7] Z
˜
V (A) = f˜(α)dP(α),
P A
Y
with Y is a subset of the unit interval and P is a probability distribution on Y ,
the definition of f˜ being subjective for decision maker.
A
One Approach to Fuzzy Matrix Games 231
The ordering operator was proposed by Ukhobotov in [15]
1
˜ Z
U(A,ν) = ((1 −ν)g˜(α)+νG˜(α))dα,
A A
0
with crisp parameter ν ∈ [0,1], different behavior of the decision maker being
corresponded with different ν.
Other defuzzification operators are given in [2].
˜ ˜
Definition 2.4. Let A and B are a fuzzy numbers, T : F → R is the operator of
defuzzification (T(·) = Y (·), VP(·), U(·,ν) etc.).
˜ ˜ ˜ ˜
Wesaythat B is preferable to A by the defuzzification operator T (A T B)
if and only if
˜ ˜
T(A)6T(B).
The defuzzification operator T is dependant on the order relation T. Then,
we give the example.
˜ ˜ ˜ ˜ ˜
Example 2.1. Let T(·) = U(·,ν) and A,B,C ∈ F3, A = (40,8,10), B =
˜
=(45,20,10), C = (42,6,4).
˜
If X = (a,l,r) ∈ F , then
3
˜ νr−(1−ν)l
U(X,ν)=a+ 2 .
˜ ˜ ˜ 1
Next, if ν = 0, then U(A,0) = 36, U(B,0) = 35, U(C,0) = 39. If ν = 2, then
˜ 1 ˜ 1 ˜ 1 ˜
U(A, 2) = 40,5, U(B, 2) = 42,5, U(C, 2) = 41,5. If ν = 1, then U(A,1) = 45,
˜ ˜
U(B,1) = 50, U(C,1) = 44.
Therefore,
˜ ˜ ˜
B U(·,0) A U(·,0) C,
˜ 1 ˜ 1 ˜
A C B,
˜ U(·,2) ˜ U(·,2) ˜
C U(·,1) A U(·,1) B.
˜ ˜
Definition 2.5. If ∀A,B ∈ F, ∀α,β = const
˜ ˜ ˜ ˜
T(αA+βB)=αT(A)+βT(B),
then the defuzzification operator T(·) is the linear defuzzification operator.
Clear, Yager index Y(·) and operator U(·,ν) is linear.
3 Crisp Games
In this part, some basic definitions of non-cooperative game theory are presented.
no reviews yet
Please Login to review.
