Next Article in Journal
A Dynamic Scheduling Method for Carrier Aircraft Support Operation under Uncertain Conditions Based on Rolling Horizon Strategy
Previous Article in Journal
Practical Guide to Ultrasound Beam Forming: Beam Pattern and Image Reconstruction Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Another View on the Middle East Conflict Analysis

1
Department of Mathematics and Statistics, Riphah International University, I-14, Islamabad 44000, Pakistan
2
Department of Mathematics, Islamia College University, Peshawar 25120, KPK, Pakistan
3
Department of Mathematics, University of Ulsan, Ulsan 44610, Korea
4
Department of Mathematics, Research Institute of Natural Sciences, Hanyang University, Seoul 04763, Korea
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Appl. Sci. 2018, 8(9), 1545; https://doi.org/10.3390/app8091545
Submission received: 10 August 2018 / Revised: 18 August 2018 / Accepted: 31 August 2018 / Published: 3 September 2018

Abstract

:
Decision making is a cognitive process for evaluating data with certain attributes to come up with the best option, in terms of the preferences of decision makers. Conflicts and disagreements occur in most real world problems and involve the applications of mathematical tools dealing with uncertainty, such as rough set theory in decision making and conflict analysis processes. Afterwards, the Pawlak conflict analysis model based on rough set theory was established. Subsequently, Deja put forward some questions that are not answered by the Pawlak conflict analysis model and Sun’s model. In the present paper, using the notions of soft preference relation, soft dominance relation, and their roughness, we analyzed the Middle East conflict and answered the questions posed by Deja in a good manner.

1. Introduction

In daily life, we always face various decision making pursuits. Some decision are simple and some are complex. When one faces a complex problem with conflicting criteria, an effective decision making method becomes helpful to make an acceptable and reasonable decision. Decision making is a key component for achieving objectives in diverse areas. Usually a conflict occurs when two people have different points of view about the same event or thing. The study of conflict is of utmost importance both practically and theoretically. No doubt its importance is increasing nowadays, as huge social networks based on cell phones, tablets, computers, and other gadgets and systems of computers play a paramount role in society [1]. There is always an uncertainty about agreement, disagreement, and neutrality in a conflict situation among agents. To deal with such situations, the main aim is how to model the uncertainty in conflict [2].
Pawlak applied rough set theory to the study of conflict analysis in Reference [3]. He also found a mathematical formulation for a conflict situation based on agreement, disagreement, and neutrality, and gave the axioms for these sets. Subsequently, Deja put forward an extension and generalization of Pawlak’s model by adding some local aspects [2]. Pawlak conflict analysis model has certain limitations, for example, it cannot deal with intrinsic causes in the Middle East conflict. Another flaw of Pawlak’s model is that, it has failed to find a feasible consensus strategy for solving a conflict. In Reference [4], Sun et al. developed a conflict analysis model based on rough set theory over two universes to overcome the above mentioned shortcomings in Pawlak’s conflict analysis. But in their proposals, still there are many areas for critique, for example, the development of a proper and feasible consensus strategy is missing.
As a general mathematical tool while dealing with uncertainty, Molodtsov proposed soft set theory in Reference [5]. Maji et al. further strengthened the theory; they introduced several algebraic operations and examined their basic properties in Reference [6], which was later corrected by Ali et al. [7]. More on soft equivalence relations can be seen in Reference [8]. Applications of soft sets hybrid soft sets in decision making problems have been widely studied by many authors in different contexts (see References [9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24]). Many decision making problems have been characterized by the ranking of objects according to a set of criteria with predefined preference ordered decision classes, such as credit approval, stock risk estimation, university ranking, teaching evaluation, etc. (see References [25,26,27]). A recent work on the tolerance rough set can be found in Reference [28]. Many authors used the game theoretic rough sets model to construct a mechanism for analyzing the uncertainties of rough set theory [29,30,31,32]. In the present paper, we developed a new conflict analysis model, which is based on soft preference relation and soft dominance relation, to study the Middle East conflict situation. Further, we answered different questions raised by various authors in an affirmative way. A general technique for the conflict problem is proposed and examined and our newly developed model is more efficient than the existing techniques/models.
The rest of the paper is arranged as follows: Section 2 briefly reviews the Pawlak conflict analysis model followed by the Deja, together with Sun et al., conflict analysis models. Drawbacks of the Sun et al. conflict model are also discussed in this section. Section 3 consists of the proposed conflict analysis model based on soft set theory. Various uncertainties have been studied, which tried to address the shortcomings of Sun’s model.

2. Literature Review

In the following, different conflict models are presented.

2.1. Pawlak’s Conflict Analysis Model

The conflict analysis model introduced by Pawlak is based on rough set theory [3]. The Middle East conflict analysis problem is shown in Table 1, where the agents are represented by rows and the issues by columns. Each agent is assigned a value to an issue from the set , 0 , + , where − shows that the agent is against that particular issue, 0 shows the neutrality of the agent, and + depicts the favorability of the agent towards the issue/event. Furthermore, Pawlak discussed the Middle East conflict analysis problem in Reference [3]. This conflict analysis problem consists of five issues and six agents. The relationship of each agent to an issue is given in Table 1.
Let U = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 be the universe of six agents, where
u 1 : Israel u 2 : Egypt u 3 : Palestine u 4 : Jordan u 5 : Syria u 6 : Saudi Arabia .
Let V = a 1 , a 2 , a 3 , a 4 , a 5 be the universe of the five issues of the conflict situation, where
  • a 1 : Autonomous Palestinian state on the West Bank and Gaza,
  • a 2 : Israeli military outpost along the Jordan River,
  • a 3 : Israel retains East Jerusalem,
  • a 4 : Israeli military outposts on the Golan Heights, and
  • a 5 : Arab countries grant citizenship to Palestinians who choose to remain within their boarders.
In the information system, the attitudes of the six nations of the Middle East region towards the above issues are presented.

2.2. Deja’s Conflict Analysis Model

The conflict analysis of Reference [3] is confined to the conclusions, such as to find the most conflicted attribute or the assembly of agents when three or more take part in the conflict. Although Pawlak’s conflict model has proven to be effective in practice, Deja in Reference [2], posed three questions that Pawlak’s conflict model is unable to answer:
(i)
What are the intrinsic reasons for the conflict?
(ii)
How can a feasible consensus strategy be found?
(iii)
Is it possible to satisfy all the agents?

2.3. Sun et al.’s Conflict Analysis Model

Sun et al. in Reference [4] tried to answer Deja’s questions and focussed on answering the first and second questions raised by Deja in Reference [2].
Let U = u 1 , . . . , u m be the universe of agents and V = a 1 , . . . , a n be the universe of issues in the conflict situation. For any subset A 2 of V , we call A 2 the feasible strategy for a conflict situation. Let the set f = f + , f be the collection of set valued mappings defined as follows:
f + : U P V , f + u = a V f u , a = + , for all u U
and:
f : U P V , f u = a V f u , a = , for all u U .
The mapping f + gives the subset of issues with which agent u agrees while the mapping f gives the subset of issues with which the agent u disagrees. For any feasible strategy A 2 P V on an issue, the approximations are:
a p r ̲ f + A 2 = u U f + u A 2 , a p r ̲ f A 2 = u U f u A 2 ,
a p r ¯ f + A 2 = u U f + u A 2 , a p r ¯ f A 2 = u U f u A 2 .
Example 1.
Consider the Middle East conflict as in Table 1.
Let A 2 = a 2 , a 3 , a 5 V . Then a p r ̲ f + A 2 = u 6 , a p r ¯ f + A 2 = u 1 , u 6 , a p r ̲ f A 2 = u 4 , u 6 , and a p r ¯ f A 2 = u 2 , u 3 , u 4 , u 5 , u 6 .
According to Sun et al. [4]:
Agreement subset = R f + A 2 = a p r ̲ f + A 2 a p r ̲ f A 2 = ,
Disagreement subset = R f A 2 = a p r ̲ f A 2 a p r ̲ f + A 2 = u 4 ,
Neutral subset = U R f + A 2 R f A 2 = u 1 , u 2 , u 3 , u 5 , u 6 .
It is observed that:
(i)
For the feasible strategy A 2 = a 2 , a 3 , a 5 P V using Sun et al.’s technique, the agreement subset = , the disagreement subset = u 4 , and the neutral subset = u 1 , u 2 , u 3 , u 5 , u 6 . This is because, in the information system (Table 1) the values for u 4 in the columns of a 2 , a 3 and a 5 are in disagreement, that is “−”. Additionally, the case of u 5 is not different from u 4 , but in Reference [4] it is treated as neutral, so the agents of the same behavior have been grouped in different coalitions, which causes confusion.
(ii)
For the feasible strategy A 2 = a 3 P V , the agreement subset = , the disagreement subset = u 6 , and the neutral subset = u 1 , u 2 , u 3 , u 4 , u 5 . This is because, in the information system (Table 1) the attitude of u 6 in the column of a 3 is in disagreement, that is “−”. Also the cases of u 2 , u 3 , u 4 and u 5 are not different from u 6 , but according to Reference [4], they should be in neutral, so the agents of the same character are grouped in different coalitions, which is an infirmity of the Sun et al. technique.
(iii)
For another strategy, A 2 = a 1 , a 3 P V , the agreement subset = u 2 , u 3 , u 5 , the disagreement subset = u 1 , u 6 and the neutral subset = u 4 . Now, in the information system (Table 1) the behavior of u 4 and u 6 in the columns of a 1 and a 3 are the same. But using technique of Reference [4], these agents of the same character fall in different coalitions, which is another infirmity of the Sun et al. technique.
(iv)
The technique of Reference [4] declared the conflict problem as an undecided one, which is another flaw of this technique as seen below:
Let V = a 1 , a 2 , a 3 , a 4 , a 5 be the set of all issues. Then
a p r ̲ f + V = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 ,
a p r ̲ f V = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 ,
the agreement subset = , the disagreement subset = , and the neutral subset = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 .
So for a feasible consensus strategy when V = a 1 , a 2 , a 3 , a 4 , a 5 , the set of all issues of the conflict situation, there is no agreement subset and disagreement subset; the attitudes of all agents u 1 , u 2 , u 3 , u 4 , u 5 , and u 6 are neutral for the feasible consensus strategy V .

3. Conflict Analysis Based on Soft Preference Relation

Inspired by the existing studies on conflict analysis based on Pawlak’s rough set theory, as well as Sun et al.’s conflict analysis based on rough set theory over two universes, we propose a new conflict analysis model based on a soft preference relation that will help to improve the above limitations in the existing approaches in the literature.
In order to overcome the above mentioned shortcomings, a new conflict analysis model with the help of soft set theory is developed which is free from all such weaknesses and works more efficaciously.
Let U be a set of agents and V be a set of issues. Let a be an outranking relation on U with respect to issue a V such that x 1 a x 2 means “ x 1 is at least as good as x 2 with respect to criterion a . Suppose that a is a complete preorder, it is strongly complete (which means that for each x 1 , x 2 U at least one of x 1 a x 2 or x 2 a x 1 exists) and a transitive binary relation defined on U . Thus x 1 and x 2 are always comparable with respect to criterion a V . We say that an object x 1 E-dominates an object x 2 with respect to E V (denoted by x 1 D E x 2 ), if x 1 a x 2 for all a E . Since the intersection of complete preorders is a partial preorder, D E = a E a , so the dominance relation D E is a partial preorder.
Definition 1.
[5] A pair = F , E is called a soft set over U , where E is a subset of parameters of V and F : E P U is a set valued mapping.
Definition 2.
[8] If F : E P U × U is a mapping from a subset of parameters E to the power set of U × U , then the soft set F , E over U × U is called a soft binary relation over U . A soft binary relation F , E over a set U is called a soft equivalence relation over U, if F a is an equivalence relation over U for all a E .
Definition 3.
Let IS = U , V , f ˜ be the Middle East conflict situation and F : E P U × U be a set valued mapping from E to P U × U , where E V denotes the set of parameters or attributes and P U × U the set of all subsets of U × U . If F a is a preference relation for all a E , then F , E is called a soft preference relation, where:
F a = u i u j f ˜ u i , a f ˜ u j , a , u i , u j U
and:
f ˜ : U × V , 0 , + ,
such that f ˜ u , a = s , where s , 0 , + and u U , a V . In fact f ˜ is more general than Sun et al.’s f of Reference [4]. Throughout the paper, we will use u i , u j for u i u j . Preference relations are efficient tools to address decision making problems that only require the decision makers to compare one pair of objects at a time. In the information system (Table 1), favorability + is preferred to neutrality 0 , while neutrality 0 is preferred to antagonism .
Definition 4.
Let IS = U , V , f ˜ be the Middle East conflict situation and F , E be a soft preference relation over U . Then there is an associated dominance relation, which can be denoted by D o   min F 1 , E and is defined as follows:
D o   min F 1 , E = a E F a .
For any u U , define the soft dominance classes by:
u D o   min F 1 , E + = u i U : u i D o   min F 1 , E u
and:
u D o   min F 1 , E = u i U : u i D o   min F 1 , E u ,
which represent the F , E -dominating set and F , E -dominated set with respect to u U of the IS , respectively. Class u D o   min F 1 , E + describes the set of all those objects that dominate u and u D o   min F 1 , E describes the set of all those objects that are dominated by u in terms of D o   min F 1 , E , where:
D o   min F 1 , E + = u U : u D o   min F 1 , E +
and:
D o   min F 1 , E = u U : u D o   min F 1 , E .
Theorem 1.
Let IS = U , V , f ˜ be the Middle East conflict situation and D o   min F 1 , E be a soft dominance relation. Then the following hold:
(1) 
If E 1 E , then D o   min F 1 , E D o   min F 1 , E 1 ;
(2) 
If a n a m D o   min F 1 , E + , then a n D o   min F 1 , E + a m D o   min F 1 , E + ;
(3) 
a m D o   min F 1 , E + = a n D o   min F 1 , E : a n a m D o   min F 1 , E + ;
(4) 
a m D o m k H , C + = a n D o m k H , C + iff f a m , C j = f a n , C j and g a m , D k = g a n , D k for all C j C and D k D ;
(5) 
Γ = a m D o   min F 1 , E + : a m U constitutes a covering of U .
Proof. 
The proof is straightforward. □
Definition 5.
Let IS = U , V , f ˜ be the Middle East conflict situation. Then, for any A 1 U the lower and upper approximations with respect to the F 1 , E -dominating set and F 1 , E -dominated set are:
A 1 ̲ D o   min F 1 , E + = u U : u D o   min F 1 , E + A 1
A 1 ¯ D o   min F 1 , E + = u U : u D o   min F 1 , E A 1 : .
The lower approximation A 1 ̲ D o   min F 1 , E + , is the collection of all those objects u from U, such that all objects u i , having at least the same evaluations on all of the considered criteria from V, also belong to A 1 . Thus one can say that if an object u i has at least as good an evaluation on the criteria from V as an object u belonging to A 1 ̲ D o   min F 1 , E + , then certainly u i belongs to A 1 . The upper approximation A 1 ¯ D o   min F 1 , E + is the collection of all those objects u from U whose evaluation on the criteria from V is not worse than the evaluation of at least one other object u i belonging to A 1 . If A 1 ¯ D o   min F 1 , E + = A 1 ̲ D o   min F 1 , E + then it is called soft definable, otherwise it is a soft rough set. Similarly:
A 1 ̲ D o   min F 1 , E = u U : u D o   min F 1 , E A 1
A 1 ¯ D o   min F 1 , E = u U : u D o   min F 1 , E + A 1 : .
If A 1 ¯ D o   min F 1 , E = A 1 ̲ D o   min F 1 , E then it is called soft definable, otherwise it is a soft rough set.
We call,
(1) 
P O S A 1 D o   min F 1 , E + = A 1 ̲ D o   min F 1 , E + the positive region of A 1 with respect to D o   min F 1 , E + .
(2) 
N E G A 1 D o   min F 1 , E + = U A 1 ¯ D o   min F 1 , E + the negative region of A 1 with respect to D o   min F 1 , E + .
(3) 
B N A 1 D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + the boundary region of A 1 with respect to D o   min F 1 , E + in information system IS .
(4) 
P O S A 1 D o   min F 1 , E = A 1 ̲ D o   min F 1 , E the positive region of A 1 with respect to D o   min F 1 , E
(5) 
N E G A 1 D o   min F 1 , E = U A 1 ¯ D o   min F 1 , E the negative region of A 1 with respect to D o   min F 1 , E .
(6) 
B N A 1 D o   min F 1 , E = A 1 ¯ D o   min F 1 , E A 1 ̲ D o   min F 1 , E the boundary region of A 1 with respect to D o   min F 1 , E in information system IS .
Theorem 2.
Let IS = U , V , f ˜ be the Middle East conflict situation. Then for any A 1 , A 2 U :
(1) 
A 1 ̲ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + ;
(2) 
̲ D o   min F 1 , E + = ¯ D o   min F 1 , E + = ;
(3) 
U ̲ D o   min F 1 , E + : = U ¯ D o   min F 1 , E + = U ;
(4) 
A 1 A 2 implies A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + ;
(5) 
A 1 A 2 implies A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + ;
(6) 
A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + ;
(7) 
A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + = A 1 A 2 ¯ D o   min F 1 , E + ;
(8) 
A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + . = A 1 ̲ D o   min F 1 , E + ;
(9) 
A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 A 2 ¯ D o   min F 1 , E + ;
Proof. 
These results follow from the respective definitions. □
The following theorems give a connection between topology and soft dominating/dominated definable sets.
Theorem 3.
Let IS = U , V , f ˜ be the Middle East conflict situation. Then the collection of soft dominating definable sets form a topology on U .
Proof. 
(i)
From Theorem 2:
̲ D o   min F 1 , E + = ¯ D o   min F 1 , E + =
and:
U ̲ D o   min F 1 , E + = U ¯ D o   min F 1 , E + = U .
(ii)
We prove that an arbitrary union of soft dominating definable sets is a soft dominating definable set. For this consider:
i A i ¯ D o   min F 1 , E + = i A i ¯ D o   min F 1 , E + = i A i ̲ D o   min F 1 , E + i A i ̲ D o   min F 1 , E + .
Similarly, i A i ̲ D o   min F 1 , E + i A i ¯ D o   min F 1 , E + .
Hence, i A i ̲ D o   min F 1 , E + = i A i ¯ D o   min F 1 , E + .
(iii)
Last, we prove a finite intersection of soft dominating definable sets is a soft dominating definable set. For this consider:
i n A i ¯ D o   min F 1 , E + i n A i ¯ D o   min F 1 , E + = i n A i ̲ D o   min F 1 , E + = i n A i ̲ D o   min F 1 , E + .
Similarly, i n A i ̲ D o   min F 1 , E + i n A i ¯ D o   min F 1 , E + . Therefore, i n A i ̲ D o   min F 1 , E + = i n A i ¯ D o   min F 1 , E + .
Theorem 4.
Let IS = U , V , f ˜ be the Middle East conflict situation. Then the collection of soft dominated definable sets form a topology on U .
Proof. 
The proof is similar to the proof of Theorem 3. □
Definition 6.
Let IS = U , V , f ˜ be the Middle East conflict situation. For any A 1 U , the approximate precisions ρ D o   min F 1 , E + A 1 and ρ D o   min F 1 , E A 1 of A 1 about D o   min F 1 , E + and D o   min F 1 , E are defined as:
ρ D o   min F 1 , E + A 1 = A 1 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + and ρ D o   min F 1 , E A 1 = A 1 ̲ D o   min F 1 , E A 1 ¯ D o   min F 1 , E ,
where A 1 : , and · denotes the cardinality of a set.
Let μ D o   min F 1 , E + A 1 = 1 ρ D o   min F 1 , E + A 1 and μ D o   min F 1 , E A 1 = 1 ρ D o   min F 1 , E A 1 . Then μ D o   min F 1 , E + A 1 and μ D o   min F 1 , E A 1 are called the rough degrees of A 1 about D o   min F 1 , E + and D o   min F 1 , E , respectively.
By definition 0 μ D o   min F 1 , E + A 1 1 and 0 ρ D o   min F 1 , E + A 1 1 . It can be seen that ρ D o   min F 1 , E + A 1 = 1 if and only if A 1 ̲ D o   min F 1 , E + = A 1 = A 1 ¯ D o   min F 1 , E + . Similarly, 0 μ D o   min F 1 , E A 1 1 and 0 ρ D o   min F 1 , E A 1 1 .
The following theorems describe the relationships of the precisions, ρ D o   min F 1 , E + A 1 and ρ D o   min F 1 , E A 1 , and rough degrees, μ D o   min F 1 , E + A 1 and μ D o   min F 1 , E A 1 , with the intersection and union of any subsets A 1 and A 2 of the universe U .
Theorem 5.
Let IS = U , V , f ˜ be the Middle East conflict situation and A 1 , A 2 U . Then the rough degree and precision of the sets A 1 , A 2 , A 1 A 2 , and A 1 A 2 satisfy the following relations:
(1) 
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + μ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
(2) 
ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + ρ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Proof. 
1 By definition of the rough degree, we have:
μ D o   min F 1 , E + A 1 A 2 = 1 A 1 ̲ D o   min F 1 , E + A 1 A 2 ¯ D o   min F 1 , E + = 1 A 1 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + 1 A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Thus we obtain:
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + .
Similarly:
μ D o   min F 1 , E + A 1 A 2 = 1 A 1 ̲ D o   min F 1 , E + A 1 A 2 ¯ D o   min F 1 , E + = 1 A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 A 2 ¯ D o   min F 1 , E + 1 A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Hence:
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + .
We know that for any sets A B = A + B A B . It follows that:
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Moreover by definition of the rough degree:
μ D o   min F 1 , E + A 1 = 1 A 1 ̲ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E +
and:
μ D o   min F 1 , E + A 2 = 1 A 2 ̲ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
We obtain the following relation:
μ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E +
and:
μ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + = A 2 ¯ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + .
Therefore:
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + A 2 ̲ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + = μ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + μ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
2 By definition of the rough degree μ D o   min F 1 , E + A 1 = 1 ρ D o   min F 1 , E + A 1 . Since:
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + μ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Therefore:
1 ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + 1 ρ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + 1 ρ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + 1 ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + + ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + = A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + + ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
By routine simplifications, we get:
ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 1 ¯ D o   min F 1 , E + + ρ D o   min F 1 , E + A 2 A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
Theorem 6.
Let IS = U , V , f ˜ be the Middle East conflict situation and A 1 , A 2 U . Then the rough degree and precision of the sets A 1 , A 2 , A 1 A 2 , and A 1 A 2 satisfy the following relations:
(1) 
μ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E μ D o   min F 1 , E A 1 A 1 ¯ D o   min F 1 , E + μ D o   min F 1 , E A 2 A 2 ¯ D o   min F 1 , E μ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E .
(2) 
ρ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E + ρ D o   min F 1 , E A 1 A 1 ¯ D o   min F 1 , E + ρ D o   min F 1 , E A 2 A 2 ¯ D o   min F 1 , E ρ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E .
Proof. 
The proof is similar to the proof of Theorem 5. □
Definition 7.
Let IS = U , V , f ˜ be the Middle East conflict situation. For any set A 1 U , the approximate quality γ D o   min F 1 , E + A 1 and γ D o   min F 1 , E A 1 of A 1 about D o   min F 1 , E + and D o   min F 1 , E are defined as follows:
γ D o   min F 1 , E + A 1 = A 1 ̲ D o   min F 1 , E + U and γ D o   min F 1 , E A 1 = A 1 ̲ D o   min F 1 , E U .
Clearly, 0 γ D o   min F 1 , E + A 1 1 and 0 γ D o   min F 1 , E A 1 1 .
The following theorem illustrate the relationship between the rough degree and approximate quality with respect to the intersection and union of sets A 1 and A 2 on the universe U .
Theorem 7.
Let IS = U , V , f ˜ be the Middle East conflict situation and A 1 , A 2 U . Then the rough degree and approximate quality of the sets A 1 , A 2 , A 1 A 2 , and A 1 A 2 satisfy the following relations:
(1) 
μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + A 1 ¯ D o   min F 1 , E + + A 2 ¯ D o   min F 1 , E + U γ D o   min F 1 , E + A 1 + γ D o   min F 1 , E + A 2 μ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
(2) 
μ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E U γ D o   min F 1 , E A 1 + γ D o   min F 1 , E A 2 μ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E .
Proof. 
The proof is similar to the proof of Theorem 5. □
The following theorem highlights the relationship between the approximate precision and approximate quality in regards to the intersection and union of two sets.
Theorem 8.
Let IS = U , V , f ˜ be the Middle East conflict situation and A 1 , A 2 U . Then the approximate quality and precision of the sets A 1 , A 2 , A 1 A 2 , and A 1 A 2 satisfy the following relations:
(1) 
ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + U γ D o   min F 1 , E + A 1 + γ D o   min F 1 , E + A 2 ρ D o   min F 1 , E + A 1 A 2 A 1 ¯ D o   min F 1 , E + A 2 ¯ D o   min F 1 , E + .
(2) 
ρ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E U γ D o   min F 1 , E A 1 + γ D o   min F 1 , E A 2 ρ D o   min F 1 , E A 1 A 2 A 1 ¯ D o   min F 1 , E A 2 ¯ D o   min F 1 , E .
Proof. 
The proof is similar to the proof of Theorem 5. □
Definition 8.
Let IS = U , V , f ˜ be the Middle East conflict situation. For any subset A 1 of U , the approximate accuracies ς u D o   min F 1 , E + A 1 and ς u D o   min F 1 , E A 1 of A 1 about u D o   min F 1 , E + and u D o   min F 1 , E , respectively, are defined by:
ς u D o   min F 1 , E + A 1 = u D o   min F 1 , E + A 1 u D o   min F 1 , E +
and:
ς u D o   min F 1 , E A 1 = u D o   min F 1 , E A 1 u D o   min F 1 , E .
It is routine to verify that 0 ς u D o   min F 1 , E + A 1 1 and 0 ς u D o   min F 1 , E A 1 1 . For any A 1 , A 2 U , the following properties hold:
(1) 
ς u D o   min F 1 , E + A 1 = 1 if and only if u A 1 ̲ D o   min F 1 , E + ,
(2) 
ς u D o   min F 1 , E + A 1 = 0 if and only if u A 1 ̲ c D o   min F 1 , E + ,
(3) 
ς u D o   min F 1 , E + A 1 A 2 = ς u D o   min F 1 , E + A 1 + ς u D o   min F 1 , E + A 2 ς u D o   min F 1 , E + A 1 A 2 ,
(4) 
ς u D o   min F 1 , E + A 1 = 1 ς u D o   min F 1 , E + A 1 ,
(5) 
If A 1 A 2 , then ς u D o   min F 1 , E + A 1 ς u D o   min F 1 , E + A 2 ,
(6) 
ς u D o   min F 1 , E + = 0 and ς u D o   min F 1 , E + U = 1 , for every u U , and
(7) 
ς u D o   min F 1 , E + A 1 + ς u D o   min F 1 , E + A 1 = 1 .
Using the soft preference relation we give an affirmative response to the aforesaid drawbacks of Sun et al.’s technique:
Let IS = U , V , f ˜ be the Middle East conflict situation and E V be a feasible strategy for resolving the conflict situation. Then for any A 1 = u U : f u , a 0 , a E U , denote:
The agreement subset = A S = A 1 ̲ D o   min F 1 , E + A 1 ̲ D o   min F 1 , E ,
The disagreement subset = D S = A 1 ̲ D o   min F 1 , E A 1 ̲ D o   min F 1 , E + and
The neutral subset = N S = U ( A S D S ) .
The relationships between the agreement, disagreement, and neutral subsets are:
i A S D S = i i A S N S = i i i D S N S =
i v A S D S N S = U .
Example 2. 
(Continued from Example 1) Consider the Information Table 1 for the Middle East conflict analysis. If E 1 = a 2 , a 3 , a 5 V , then the soft preference relation F : E 1 P U × U is defined by:
F a 2 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 1 , u 2 , u 1 , u 3 , u 1 , u 4 , u 1 , u 5 , u 1 , u 6 , u 2 , u 3 , u 2 , u 4 , u 2 , u 5 , u 3 , u 4 , u 3 , u 5 , u 4 , u 3 , u 4 , u 5 , u 5 , u 3 , u 5 , u 4 , u 6 , u 1 , u 6 , u 2 , u 6 , u 3 , u 6 , u 4 , u 6 , u 5 ,
F a 3 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 1 , u 2 , u 1 , u 3 , u 1 , u 4 , u 1 , u 5 , u 1 , u 6 , u 2 , u 3 , u 2 , u 4 , u 2 , u 5 , u 2 , u 6 , u 3 , u 2 , u 3 , u 4 , u 3 , u 5 , u 3 , u 6 , u 4 , u 2 , u 4 , u 3 , u 4 , u 5 , u 4 , u 6 , u 5 , u 2 , u 5 , u 3 , u 5 , u 4 , u 5 , u 6 , u 6 , u 2 , u 6 , u 2 , u 6 , u 4 , u 6 , u 5 ,
F a 5 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 1 , u 2 , u 1 , u 3 , u 1 , u 4 , u 1 , u 5 , u 1 , u 6 , u 2 , u 4 , u 2 , u 5 , u 3 , u 2 , u 3 , u 4 , u 3 , u 5 , u 4 , u 2 , u 4 , u 5 , u 5 , u 2 , u 5 , u 4 , u 6 , u 1 , u 6 , u 2 , u 6 , u 3 , u 6 , u 4 , u 6 , u 5 .
The soft dominance relation is given by:
D o   min F 1 , E 1 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 1 , u 2 , u 1 , u 3 , u 1 , u 4 , u 1 , u 5 , u 1 , u 6 , u 2 , u 4 , u 2 , u 5 , u 3 , u 4 , u 3 , u 5 , u 4 , u 5 , u 5 , u 4 , u 6 , u 2 , u 6 , u 3 , u 6 , u 4 , u 6 , u 5 .
The dominance classes from D o   min F 1 , E 1 are given in the Table 2.
Let A 1 = u 1 , u 4 , u 5 , u 6 U . Then A 1 ̲ D o   min F 1 , E 1 + = u 1 , u 6 and A 1 ̲ D o   min F 1 , E 1 = u 4 , u 5 .
By using the aforesaid definition, the agreement subset = u 1 , u 6 , disagreement subset = u 4 , u 5 and neutral subset = u 2 , u 3 . So we say that for the feasible strategy E 1 = a 2 , a 3 , a 5 V of the conflict situation, the agents u 4 and u 5 disagree with E 1 = a 2 , a 3 , a 5 , the agents u 1 and u 6 agree with E 1 = a 2 , a 3 , a 5 and the attitude of the agents u 2 and u 3 are neutral for the feasible strategy E 1 = a 2 , a 3 , a 5 . In order to provide some information to decision makers, it is more pertinent to distinguish the agreement and disagreement subsets of agents rather than to distinguish the neutral subset attitudes of the conflict situation. Hence, we disclose information about agreement and disagreement for any feasible strategy in the conflict situation by the agreement and disagreement subsets. Also, we ascertain the feasible consensus strategy E 1 = a 2 , a 3 , a 5 V for the conflict situation by choosing the maximum cardinality of the agreement subset. Thus, we have answered the question “How can a feasible consensus strategy be found?” by using the agreement subset.
Example 3. 
(Continued from Example 1) Let the feasible strategy E 2 = a 3 V . The soft dominance relation is given by:
D o   min F 1 , E 2 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 1 , u 2 , u 1 , u 3 , u 1 , u 4 , u 1 , u 5 , u 1 , u 6 , u 2 , u 3 , u 2 , u 4 , u 2 , u 5 , u 2 , u 6 , u 3 , u 2 , u 3 , u 4 , u 3 , u 5 , u 3 , u 6 , u 4 , u 2 , u 4 , u 3 , u 4 , u 5 , u 4 , u 6 , u 5 , u 2 , u 5 , u 3 , u 5 , u 4 , u 5 , u 6 , u 6 , u 2 , u 6 , u 2 , u 6 , u 4 , u 6 , u 5 .
The dominance classes from D o   min F 1 , E 2 are given in Table 3.
Let A 1 = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 . Then A 1 ̲ D o   min F 1 , E 2 + = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 and A 1 ̲ D o   min F 1 , E 2 = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 . Now
A S = , D S = , and N S = u 1 , u 2 , u 3 , u 4 , u 5 , u 6 .
Example 4. 
(Continued from Example 1) (iii) For the feasible strategy E 3 = A 1 , a 3 V . The soft dominance relation is given by:
D o   min F 1 , E 3 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 2 , u 3 , u 2 , u 4 , u 2 , u 5 , u 2 , u 6 , u 3 , u 2 , u 3 , u 4 , u 3 , u 5 , u 3 , u 6 , u 4 , u 6 , u 5 , u 2 , u 5 , u 3 , u 5 , u 4 , u 5 , u 6 , u 6 , u 4 .
The dominance classes from D o   min F 1 , E 3 are given in Table 4.
Let A 1 = u 1 , u 2 , u 3 , u 5 . Then A 1 ̲ D o   min F 1 , E 3 + = u 1 , u 2 , u 3 , u 5 , and A 1 ̲ D o   min F 1 , E 3 = u 1 .
A S = u 2 , u 3 , u 5 , D S = , and N S = u 1 , u 4 , u 6 .
Example 5. 
(Continued from Example 1) (iv) Let the feasible strategy E 4 = a 1 , a 2 , a 3 , a 4 , a 5 V . The soft dominance relation is given by:
D o   min F 1 , E 4 = u 1 , u 1 , u 2 , u 2 , u 3 , u 3 , u 4 , u 4 , u 5 , u 5 , u 6 , u 6 , u 2 , u 5 , u 3 , u 5 , u 6 , u 4 .
The dominance classes from D o   min F 1 , E 4 are given in the Table 5.
Let A 1 = u 1 , u 5 . Then by our proposed technique, the agreement subset = , the disagreement subset = u 5 and the neutral subset = u 1 , u 2 , u 3 , u 6 depict the real spirit of the conflict situation, while in this case Sun et al.’s technique concluded that the conflict table under consideration is neutral.
Next for any issue a i V , we can easily obtain attitude information for every agent with respect to issue a i V by using F a i which is a preference relation. F a i is more informative than the two set valued mappings of Reference [4] . Thus, we answered the question “What are the intrinsic conflict reasons?” by using F a i where a i V . In conclusion, we replied to Deja’s questions in the best way.
Now we present another methodology for determining the feasible consensus strategy of the conflict situation. The other representation of the Middle East conflict information table is given in Table 6.
According to Sun et al. [4], let g = g + , g be a set valued mapping from V to U , where:
g + : V P U , g + a = u U g a , u = + for all a V ,
g : V P U , g a = u U g a , u = for all a V .
Now for any combination of agents A 1 P U in a conflict situation, the approximations are defined as follows:
a p r ̲ g + A 1 = a V g + a A 1 , a p r ̲ g A 1 = a V g a A 1 ,
a p r ¯ g + A 1 = a V g + a A 1 , a p r ¯ g A 1 = a V g a A 1 .
Example 6.
Consider the Middle East conflict analysis of Table 6. Let A 1 = u 1 , u 2 , u 3 , u 5 U . Then, a p r ̲ g + A 1 = A 1 , a 3 , a 4 and a p r ̲ g A 1 = A 1 , a 4 .
According to Reference [4]:
The agreement subset = a 3 , the disagreement subset = , and
The neutral subset = A 1 , a 2 , a 4 , a 5 .
It is noted that for A 1 = u 1 , u 2 , u 3 , u 5 U in the conflict analysis of Table 5, a 3 and a 4 behave alike, while they have been placed in different alliances. Now, we propose a new and general algorithm for a conflict analysis model which is immaculate from the above flaw.
Definition 9.
Let S = U , V , g ˜ be the Middle East conflict situation and G : I P V × V be a set valued mapping from I to P V × V , where I U denotes the set of parameters or agents and P V × V the set of all subsets of V × V . If G u is a preference relation for all u I , then G , I is called a soft preference relation, where:
G u = a i a j g ˜ a i , u g ˜ a j , u , a i , a j V
and:
g ˜ : V × U , 0 , + ,
such that g ˜ a , u = w , where w , 0 , + and u U , a V . In fact g ˜ is more general than Sun et al.’s g of Reference [4].
Definition 10.
If G , I is a soft preference relation over V , then there is an associated dominance relation, denoted by D o m G , I , which is defined as:
D o   min G 1 , I = u I G u .
For any a V , define the soft dominance classes by:
a D o   min G 1 , I + = a i V : a i D o   min G 1 , I a
and:
a D o   min G 1 , I = a i V : a i D o   min G 1 , I a ,
which represent the G , I -dominating set and G , I -dominated set with respect to a V of the IS = U , V , g ˜ , respectively. The class a D o   min G 1 , I + describes the set of all those objects that dominate a and a D o   min G 1 , I describes the set of all those objects that are dominated by a, in terms of D o   min G 1 , I , where:
D o   min G 1 , I + = a V : a D o   min G 1 , I +
and:
D o   min G 1 , I = a V : a D o   min G 1 , I .
For A 2 V the lower and upper approximations with respect to the G 1 , I -dominating set and G 1 , I -dominated set are:
A 2 ̲ D o   min G 1 , I + = a V : u D o   min G 1 , I + A 2
A 2 ¯ D o   min G 1 , I + = a V : u D o   min G 1 , I A 2 : .
Similarly:
A 2 ̲ D o   min G 1 , I = a V : u D o   min G 1 , I A 2
A 2 ¯ D o   min G 1 , I = a V : u D o   min G 1 , I + A 2 : .
Now, the agreement subset = A 2 ̲ D o   min G 1 , I + A 2 ̲ D o   min G 1 , I ,
The disagreement subset = A 2 ̲ D o   min G 1 , I A 2 ̲ D o   min G 1 , I + , and
The neutral subset = V ( Agreement subset ∪ Disagreement subset).
Example 7.
Consider the Middle East conflict analysis of Table 6. Let I = u 1 , u 2 , u 3 , u 5 U . Then by our second proposed technique:
The agreement subset = , the disagreement subset = a 3 , a 4 , and
The neutral subset = A 1 , a 2 , a 5 .
Thus for I = u 1 , u 2 , u 3 , u 5 U in the conflict situation, the agents in I do not agree on a feasible strategy in universe V . The example of the Middle East conflict analysis does not necessarily reflect the present day situation in this region, but is used here only as an illustration of the basic ideas considered in this paper.

Aims and Advantages/Applications of the Proposed Model

(1)
The proposed model rightly classifies the agents.
(2)
The proposed model answers questions i and i i of Deja in a better way than Sun et al.
(3)
Another advantage of the proposed model is that, it can be used for ranking the feasible alternatives simpler than other existing techniques/models.
(4)
The proposed model can be used for reduction of attributes.
(5)
Using the proposed model, one can find two types of rough degree, precision and approximate quality, and their relationship.
(6)
The proposed model can be applied to multi-criteria and multi-decision conflict analysis problems.
(7)
As a real world world application, the proposed model can be applied to solve the problem of determining the governor election results in Indonesia.

4. Conclusions and Future Work

This paper aimed to mainly discuss the Middle East conflict. The proposed model was studied initially by Pawlak in Reference [3] with the help of rough set theory on a single universe. Subsequently, drawbacks were highlighted by Deja, where he put some questions related to conflict analysis. Sun et al. developed a new conflict analysis model and tried to answer the Deja’s questions with help of rough set theory over two universes. But their model carried some shortcomings that made the study of conflict analysis more ambiguous. In this paper, a new conflict analysis model is proposed to study the Middle East conflict analysis problem with the help of the soft preference relation and soft dominance relation. Further, attempted answers to Deja’s questions were made in a positive manner. The proposed model can be extended to study other conflicts around the world. The present conflict analysis model depicts the real spirit of the conflict situation. Beginning with some basic properties of soft dominance classes, we discussed Pawlak’s properties in the framework of the proposed new rough sets. A connection between the proposed new model and topology was established. Two types of approximate precision, rough degree, and their relationship were also discussed. Further, two types of approximate quality and the relationships between approximate quality and rough degree were also a part of the current paper. The same relation is established between approximate precision and approximate quality. Last, we answered the questions posed by Deja. We believe that this work would offer foundations for further study of the theory of conflict analysis.
In our future study of conflict analysis, the following topics might be considered:
(1)
To apply the proposed model to multigranulation decision theoretic rough sets.
(2)
To apply this model to labor-management negotiation conflict analysis.
(3)
To apply this model to game theory.

Author Contributions

All the authors of this paper contributed equally. They have read and approved the final version of the paper.

Funding

Sun Young Jang was supported by Basic Science Research Program through the National Research Foundation of Korea by the Ministry of Education, Science and Technology (NRF-2018-07042748) and Choonkil Park was supported by Basic Research Program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (NRF-2017R1D1A1B04032937).

Acknowledgments

We would like to express our sincere thanks to the anonymous referees of this paper for their interest in our work, and also for spending their valuable time in reading this manuscript carefully and giving their useful comments for improving the earlier version of the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nguyen, N.T. Consensus system for solving conflicts in distributed system. Inf. Sci. 2002, 147, 91–122. [Google Scholar] [CrossRef]
  2. Deja, R. Conflict analysis. Int. J. Intell. Syst. 2002, 17, 235–253. [Google Scholar] [CrossRef]
  3. Pawlak, Z. An inquiry into anatomy of conflicts. J. Inf. Sci. 1998, 109, 65–68. [Google Scholar] [CrossRef]
  4. Sun, B.; Ma, W.; Zhao, H. Rough set based conflict analysis model and method over two universes. Inf. Sci. 2016, 372, 111–125. [Google Scholar] [CrossRef]
  5. Molodtsov, D. Soft set theory-First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  6. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  7. Ali, M.I.; Feng, F.; Liu, X.Y.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef] [Green Version]
  8. Ali, M.I. Another view on reduction of parameters in soft sets. Appl. Soft Comput. 2012, 12, 1814–1821. [Google Scholar] [CrossRef]
  9. Alcantud, J.C.R.; de Andres Calle, R.; Torrecillas, M.J.M. Hesitant fuzzy worth: An innovative ranking methodology for hesitant fuzzy subsets. Appl. Soft Comput. 2016, 38, 232–243. [Google Scholar] [CrossRef]
  10. Alcantud, J.C.R.; Torra, V. Decomposition theorems and extension principles for hesitant fuzzy sets. Inf. Fusion 2018, 41, 48–56. [Google Scholar] [CrossRef]
  11. Cagman, N.; Enginoglu, S. Soft matrix theory and its decision making. Math. Appl. 2010, 59, 3308–3314. [Google Scholar]
  12. Cagman, N.; Enginoglu, S. Soft set theory and uni-int decision-making. Eur. J. Oper. Res. 2010, 207, 848–855. [Google Scholar] [CrossRef]
  13. Jiang, Y.; Liu, H.; Tanga, Y.; Chen, Q. Semantic decision-making using ontology based soft sets. Math. Comput. Model. 2011, 53, 1140–1149. [Google Scholar] [CrossRef]
  14. Ma, X.; Zhan, J.; Ali, M.I.; Mehmood, N. A survey of decision making methods based on two classes of hybrid soft set models. Artif. Intell. Rev. 2018, 49, 511–529. [Google Scholar] [CrossRef]
  15. Ma, X.; Liu, Q.; Zhan, J. A survey of decision making methods based on certain hybrid soft set models. Artif. Intell. Rev. 2017, 47, 507–530. [Google Scholar] [CrossRef]
  16. Roy, A.R.; Maji, P.K. A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef]
  17. Slowinski, R.; Greco, S.; Matarazzo, B. Rough-Set-Based Decision support. In Search Methodologies; Springer: Boston, MA, USA, 2014; pp. 557–607. [Google Scholar]
  18. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  19. Zhan, J.; Zhu, K. Reviews on decision making methods on (fuzzy) soft sets and rough soft sets. J. Intell. Fuzzy Syst. 2015, 29, 1169–1176. [Google Scholar] [CrossRef]
  20. Zhan, J.; Yu, B.; Fotea, V.E. Characterizations of two kinds of hemiring based on probability spaces. Soft Comput. 2016, 20, 637–648. [Google Scholar] [CrossRef]
  21. Zhan, J.; Liu, Q.; Zhu, W. Another approach to rough soft hemirings and corresponding decision making. Soft Comput. 2017, 21, 3769–3780. [Google Scholar] [CrossRef]
  22. Zhan, J.; Liu, Q.; Herawan, T. A novel soft rough set: Soft rough hemirings and its multicriteria group decion making. Appl. Soft Comput. 2017, 54, 393–402. [Google Scholar] [CrossRef]
  23. Zhan, J.; Zhu, K. A novel soft rough fuzzy set: Z-soft rough fuzzy ideals of hemirings and corresponding decision making. Soft Comput. 2017, 21, 1923–1936. [Google Scholar] [CrossRef]
  24. Zhan, J.; Ali, M.I.; Mehmood, N. On a novel uncertain soft set model: Z-soft fuzzy rough set model and corresponding decision making methods. Appl. Soft Comput. 2017, 56, 446–457. [Google Scholar] [CrossRef]
  25. Braszczynski, J.; Greco, S.; Slowinski, R. Multi-criteria classification a new scheme for application of dominance-based decision rules. Eur. J. Oper. Res. 2007, 181, 1030–1044. [Google Scholar] [CrossRef]
  26. Dubois, D.; Fargier, H.; Prade, H. Ordinal and probabilistic representations of acceptance. J. Artif. Intell. Res. 2004, 22, 23–56. [Google Scholar] [CrossRef]
  27. Orlowska, M.; Orlowski, M. Maintenance of knowledge in dynamic information systems. In Intelligent Decision Support, Handbook of Applications and Advances of the Rough Set Theory; Slowinski, R., Ed.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1992; pp. 315–330. [Google Scholar]
  28. Hu, Y.C.; Chiu, Y.J. Incorporating Grey Total Influence into Tolerance Rough Sets for Classification Problems. Appl. Sci. 2018, 8, 1173. [Google Scholar] [CrossRef]
  29. Azam, N.; Yao, J.T. Analyzing Uncertainties of Probabilistic Rough Set Regions with Game-theoretic Rough Sets. Int. J. Approx. Reason. 2014, 55, 142–155. [Google Scholar] [CrossRef]
  30. Zhang, Y. Optimizing Gini Coefficient of Probabilistic Rough Set Regions using Game-Theoretic Rough Sets. In Proceedings of the 26th Annual IEEE Canadian Conference on Electrical and Computer Engineering (CCECE’13), Regina, SK, Canada, 5–8 May 2013; Volume 5–8, pp. 699–702. [Google Scholar]
  31. Yao, Y.Y. The two sides of the theory of rough sets. Knowl.-Based Syst. 2015, 80, 67–77. [Google Scholar] [CrossRef]
  32. Arena, P.; Fazzino, S.; Fortuna, L.; Maniscalco, P. Game theory and non-linear dynamics: The Parrondo Paradox case study. Chaos Solitons Fractals 2003, 17, 545–555. [Google Scholar] [CrossRef]
Table 1. Information system for the Middle East conflict.
Table 1. Information system for the Middle East conflict.
U V a 1 a 2 a 3 a 4 a 5
u 1 ++++
u 2 +0
u 3 +0
u 4 00
u 5 +
u 6 0+0+
Table 2. The dominating classes u i D o   min F 1 , E 1 + and dominated classes u i D o   min F 1 , E 1 .
Table 2. The dominating classes u i D o   min F 1 , E 1 + and dominated classes u i D o   min F 1 , E 1 .
U u i D o   min F 1 , E + u i D o   min F 1 , E
u 1 u 1 u 1 , u 2 , u 3 , u 4 , u 5 , u 6
u 2 u 1 , u 2 , u 6 u 2 , u 5
u 3 u 1 , u 3 , u 6 u 3 , u 4 , u 5
u 4 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 4 , u 5
u 5 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 4 , u 5
u 6 u 1 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
Table 3. The dominating classes u i D o   min F 1 , E 2 + and the dominated classes u i D o   min F 1 , E 2 .
Table 3. The dominating classes u i D o   min F 1 , E 2 + and the dominated classes u i D o   min F 1 , E 2 .
U u i D o   min F 1 , E 2 + u i D o   min F 1 , E 2
u 1 u 1 u 1 , u 2 , u 3 , u 4 , u 5 , u 6
u 2 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
u 3 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
u 4 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
u 5 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
u 6 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 2 , u 3 , u 4 , u 5 , u 6
Table 4. The dominating classes u i D o   min F 1 , E 3 + and the dominated classes u i D o   min F 1 , E 3 .
Table 4. The dominating classes u i D o   min F 1 , E 3 + and the dominated classes u i D o   min F 1 , E 3 .
U u i D o   min F 1 , E 3 + u i D o   min F 1 , E 3
u 1 u 1 u 1
u 2 u 2 , u 3 , u 5 u 2 , u 3 , u 4 , u 5 , u 6
u 3 u 2 , u 3 , u 5 u 2 , u 3 , u 4 , u 5 , u 6
u 4 u 2 , u 3 , u 4 , u 5 , u 6 u 4 , u 6
u 5 u 2 , u 3 , u 5 u 2 , u 3 , u 4 , u 5 , u 6
u 6 u 1 , u 2 , u 3 , u 4 , u 5 , u 6 u 4 , u 6
Table 5. The dominating classes u i D o   min F 1 , E 4 + and the dominated classes u i D o   min F 1 , E 4 .
Table 5. The dominating classes u i D o   min F 1 , E 4 + and the dominated classes u i D o   min F 1 , E 4 .
U u i D o   min F 1 , E 4 + u i D o   min F 1 , E 4
u 1 u 1 u 1
u 2 u 2 u 2 , u 5
u 3 u 3 u 3 , u 5
u 4 u 4 , u 6 u 4
u 5 u 2 , u 3 , u 5 u 5
u 6 u 6 u 4 , u 6
Table 6. Information table for the Middle East conflict.
Table 6. Information table for the Middle East conflict.
V U u 1 u 2 u 3 u 4 u 5 u 6
a 1 ++0+0
a 2 +0+
a 3 +
a 4 +00
a 5 +0+

Share and Cite

MDPI and ACS Style

Rehman, N.; Shah, S.I.A.; Ali, A.; Jang, S.Y.; Park, C. Another View on the Middle East Conflict Analysis. Appl. Sci. 2018, 8, 1545. https://doi.org/10.3390/app8091545

AMA Style

Rehman N, Shah SIA, Ali A, Jang SY, Park C. Another View on the Middle East Conflict Analysis. Applied Sciences. 2018; 8(9):1545. https://doi.org/10.3390/app8091545

Chicago/Turabian Style

Rehman, Noor, Syed Inayat Ali Shah, Abbas Ali, Sun Young Jang, and Choonkil Park. 2018. "Another View on the Middle East Conflict Analysis" Applied Sciences 8, no. 9: 1545. https://doi.org/10.3390/app8091545

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop