Abstract
We concentrate on discussing a class of twoperson zerosum games with rough payoffs. Based on the expected value operator and the trust measure of rough variables, the expected equilibrium strategy and trust maximin equilibrium strategy are defined. Five cases whether the game exists trust maximin equilibrium strategy are discussed, and the technique of genetic algorithm is applied to find the equilibrium strategies. Finally, a numerical example is provided to illustrate the practicality and effectiveness of the proposed technique.
1. Introduction
Game theory is widely applied in many fields, such as, economic and management problems, social policy, and international and national politics since it is proposed by von Neumann and Morgenstern [1]. Peski [2] presented the simple necessary and sufficient conditions for the comparison of information structures in zerosum games and solved an problem, which is how to find the value of information in zerosum games. Owena and McCormick [3] analyzed a “manhunting” game involving a mobile hider and consider a deductive search game involving a fugitive, then developed a model based on a baseline model. The traditional game theory assumes that all data of a game are known exactly by players. However, there are some games in which players are not able to evaluate exactly some data in our realistic situations. In these games, the imprecision is due to inaccuracy of information and vague comprehension of situations by players. For these uncertain games, many scholars have made contribution and got some techniques to find the equilibrium strategies of these games. Some scholars, such as, Berg and Engel [4], EinDor and Kanter [5], Takahashi [6], discussed a twoperson zerosum matrix game with random payoffs. Xu [7] made use of linear programming method to discuss twoperson zerosum game with grey number payoff matrix. Harsanyi [8] made a great contribution in treating the imprecision of probabilistic nature in games by developing the theory of Bayesian games. Dhingra et al. [9] combined the cooperative game theory with fuzzy set theory to yield a new optimization method to herein as cooperative fuzzy games and proposed a computational technique to solve the multiple objective optimization problems. Then Espin et al. [10] proposed an innovative fuzzy logic approach to analyze person cooperative games and theoretically and experimentally examined the results by analyzing threecase studies.
Although many cooperative and noncooperative games with uncertain payoffs are researched much by many scholars, there is still a kind of games with uncertain payoffs to be discussed little, that is, games with rough payoffs. Since rough set theory is proposed and studied by Pawlak [11, 12], it is drastic to be applied into many fields, such as, data mining and neural network. Nurmi et al. [13] introduced three uncertainty events in social choice such as the impreciseness of a probabilistic, fuzzy, and rough type, further explored difficult issues of how diverse types of impreciseness can be combined, and in particular the combination of roughness with randomness and fuzziness in voting games. Liu [14] proposed a new concept of rough variable which is a measurable function from rough space to . Based on the concept of rough variable, a game with rough payoffs is studied in this paper.
In game theory, it is an important task to define the concepts of equilibrium strategies and investigate their properties. However, in these games with uncertain payoffs, there are no concepts of equilibrium strategies to be accepted widely. Campos [15] has proposed several methods to solve fuzzy matrix games based on linear programming but has not defined explicit concepts of equilibrium strategies. As the extension of the idea of Campos [15], Nishizaki and Sakawa [16] discussed multiobjective matrix game with fuzzy payoffs. Maeda [17] has defined Nash equilibrium strategies based on possibility and necessity measures and investigated its properties.
In this paper, based on the concept of rough variable proposed by Liu [14], we discuss a simplest game, namely, the game in which the number of players is two and rough payoffs which one player receives are equal to rough payoffs which the other player loses. We defined two kinds of concepts of maximin equilibrium strategies and investigate their properties. The rest of this paper is organized as follows. In Section 2, we recalls some definitions and properties about twoperson zerosum game and the rough variable. Then two concepts of equilibrium strategies of twoperson zerosum game with rough payoffs are introduced and then their properties are deduced in Section 3. In Section 4, we proposed the technique of GA to solve some complicated game problems with rough payoffs which can be converted into crisp programming problem. Then a numerical example is discussed to show the effectiveness of the prosed theory and algorithm in Section 5. Finally, the conclusion has been made in Section 6.
2. Basic Concepts of TwoPerson ZeroSum Game and Rough Variable
In this section, let us recall the basic definitions of the twoperson zerosum game in [18]. The concept and properties of rough variable proposed by Liu [14] is also reviewed.
2.1. TwoPerson ZeroSum Game
In the game theory, the decision makers realize sufficiently the affection of their actions to others. The twoperson zerosum game is the simplest case of game theory in which how much one player receives is equal to how much the other loses. When we assume that both players give pure, mixed strategies (see Parthasarathy and Raghavan [19]), such a game has been well resolved. But in our realistic world, there are also some noncooperative cases though more cooperation may exist in games. In reality, the noncooperation between players may be vague. This paper mainly deals with the kind of games with rough payoffs.
In the twoperson zerosum game, what one player receives is equal to how much the other loses which could be illustrated by the following matrix: where denotes the payoff matrix of player I, is the payoff of player I when player I proposes the strategy , and player II proposes the strategy . Then, the payoff matrix of player II is .
Definition 2.1. A vector in is said to be a mixed strategy of player I if it satisfies the following condition: where the components of are greater than or equal to 0; is an vector, whose every component is equal to 1. The mixed strategy of the player II is defined similarly. Particularly, a strategy is called a pure strategy of player I. Thereinto, the th component of is only equal to 1, the other components are equal to 0.
Definition 2.2. If the mixed strategies and are proposed by players I and II, respectively, then the expected payoff of player I is defined by According to Definition 2.2, we have the definition of optimal strategies of players.
Definition 2.3. In one twoperson zerosum game, player I’s mixed strategy and player II’s mixed strategy are said to be optimal strategies if and for any mixed strategies and .
2.2. Rough Variable
Since Pawlak [11] initialized the rough set theory, it has been well developed and applied in a wide variety of uncertainty surrounding real problems.
Definition 2.4 (Slowinski et al. [20]). Let be a universe and a set representing a concept. Then its lower approximation is defined by and the upper approximation is defined by where is the similarity relationship on . Obviously, we have .
Definition 2.5 (Pawlak [11]). The collection of all sets having the same lower and upper approximations is called a rough set, denoted by . Its boundary is defined as follows:
Liu [14] also gave a new concept about rough variable. This paper mainly refers to this book. The following results will be used extensively.
Definition 2.6. Let be a nonempty set, a algebra of subsets of an element in , and a nonnegative, realvalued, additive set function. Then () is called a rough space.
Definition 2.7. A rough variable on the rough space () is a function from to the real line such that for every Borel set of , we have The lower and the upper approximations of the rough variable are then defined as follows: Liu [14] also defined the trust measure of event by , where denotes the upper trust measure of event , defined by , and denotes the lower trust measure of event , defined by .
When we do not have information enough to determine the measure for a reallife problem, we can assumes that all elements in are equally likely to occur. For this case, the measure may be viewed as the Lebesgue measure. In this paper, we only consider the rough variable such for all , where .
Definition 2.8. Let be a rough variable on the rough space (). The expected value of is defined by
Remark 2.9. Let be a rough variable with . Then we have
Remark 2.10. Assume that and are both variables with finite expected values. Then for any real numbers and , we have
3. Two Kinds of Equilibrium Strategies of TwoPerson ZeroSum Game with Rough Payoffs
Let consider the following example before defining the twoperson zerosum game with rough payoffs. When playing a Chinese poker, there are two teams which are constructed by two persons. Without loss of generality, we assume that Team A is the dealer, then its rule is as follows.
(1)If the score Team B gets is less than 40, Team A goes on being a dealer and rises of one grade, denoted as +1.(2)If the score Team B gets is between 40 and 80, Team B becomes the dealer, denoted as 0.(3)If the score Team B gets is more than 80, Team B becomes the dealer and rises of one grade, denoted as −1.From the description, we know that the rule has determined a kind of classification which is regard as an equivalent relation by Pawlak [12] on the universe . This means that obtaining 45 or 75 expresses the same meaning, and they are equivalent or indiscernible. Thus, the rough variable is applied to describe the above process and its trust measure expresses the probability that Team A obtains +1, or 0, or −1 in every game. In the following part, we will only consider the rough variable which is combined by the payoff.
Let the rough variable represent the payoff that the player I receives or player II loses, then a rough payoff matrix is presented as follows to denote a twoperson zerosum game:
When player I and player II, respectively, choose the mixed strategies and , the rough payoffs of player I are
3.1. Basic Definition of Two Kinds of Equilibrium Strategies
Because of the vagueness of rough payoffs, it is difficult for players to choose the optimal strategy. Naturally, we consider how to maximize players’ or minimize the opponent’s rough expected payoffs. Based on this idea, we propose the following maximin equilibrium strategy.
Definition 3.1. Let rough variable () represent the payoffs that the player receives or player II loses when player I gives the strategy and player II gives the strategy . Then is called a rough expected maximin equilibrium strategy if where is defined by (3.1).
Remark 3.2. Since the rough variables are independent, then for any mixed strategies and , according to Remark 2.10, we have that
According to the definition of trust measure of rough variable, we can get another way to convert the rough variable into a crisp number. Then we propose another definition of Nash equilibrium to this game.
Definition 3.3. Let rough variable () represent the payoffs that the player receives or player II loses when player I gives the pure strategy and player II gives the pure strategy is the predetermined level of the payoffs, . Then is called the trust maximin equilibrium strategy if where is defined by (3.1).
3.2. The Existence of Two Kinds of Equilibrium Strategies
In the following part, we will introduce the equilibrium strategy under the expected operator and the trust measure, respectively.
3.2.1. The Existence of Expected Maximin Equilibrium Strategies
When the players’ payoffs are crisp numbers, we know that the game surely has a mixed Nash equilibrium point. Then we will discuss if there is an expected maximin equilibrium strategy when the payoffs are characterized as rough variables.
Lemma 3.4. Let () be rough variables with finite expected values. Then strategy is an expected maximin equilibrium strategy to the game if and only if for every pure strategy () of player I and () of player II, one has where is defined by (3.1).
Proof. The necessity is apparent. Now we only consider the sufficiency. According to (3.6), for every ,
Suppose that is any one mixed strategy of player I. In (3.7), for every , we multiply to every inequality. Then
Similarly, we can prove
Thus, the strategy is an expected maximin equilibrium strategy to the game. This completes the proof.
Theorem 3.5. In a twoperson zerosum game, rough variables () represent the payoffs player I receives or player II loses, and the payoff matrix is defined by (3.1). Then there at least exists an expected maximin equilibrium strategy to the game.
Proof. Suppose that is any one mixed strategy of player I. For every pure strategy () and any strategy , we define
For every (), we define
Obviously, (), . Thus, is a mixed strategy of player I and is a continous function about . According to Brouwer’s fixedpoint theorem, there exists a point satisfying
Now, we will prove . For any mixed strategy , let . Then
Namely, there exists a pure strategy satisfying . Thus, for , there exists a pure strategy such that . According to (3.10), we have .
For the strategy () of player , according to (3.12), we have
By the definition of , we know that is nonegative. Therefore, for every . Then
Similarly, we can prove for every pure strategy of player II. By Lemma 3.4, we know that is an expected maximin equilibrium strategy to the game. This completes the proof.
3.3. The Existence of Trust Maximin Equilibrium Strategies
Through the proof of Theorem 3.5, we know that there at least exists an expected maximin equilibrium strategy to any twoperson zerosum game with rough payoffs. Now we will discuss the existence of trust maximin equilibrium strategy to this kind of game.
Lemma 3.6. Let rough variable ( represent the payoffs that the player receives or player II loses when player I gives the strategy and player II gives the strategy . Suppose that is a given number and rough variable (), then one has where
Proof. According to [14], we have Suppose that then thus we have This completes the proof.
Because of , we can easily have . Then let us discuss the existence of trust maximin equilibrium strategy and consider two simple cases firstly.
Theorem 3.7. If for all then all strategies are trust maximin equilibrium strategies.
Proof. Suppose , then
Because , then all strategies satisfy , according to Lemma 3.6, we have
We choose any strategy , for all strategy ,
Thus, all strategies are trust maximin equilibrium strategies. This completes the proof.
Theorem 3.8. If for all , then all strategies are trust maximin equilibrium strategies.
Proof. The proof is similar with that of Theorem 3.7.
After discussing two particular cases, let us consider the usual case if there exists trust maximin equilibrium strategy .
Theorem 3.9. In a twoperson zerosum game, rough variables () represent the payoffs player I receives or player II loses, and the payoff matrix is defined by (3.1). For a predetermined number , if for all , they cannot satisfy anyone of the following conditions: () , () , () , () , () , then there does not exist one trust maximin equilibrium strategy.
Proof. Let us only discuss one of five cases, the others are considered similarly. Suppose and . If not all , then without loss of generality we can suppose other . If there exists a trust maximin equilibrium strategy in , according to Lemma 3.6, we have
Since , then for the strategy , there exists strategy such that , then according to Lemma 3.6, we have
It is apparent that . Namely, . This is in conflict with the definition of trust maximin equilibrium strategy.
Similarly, if , according to Lemma 3.6, we have
Since , then for the strategy , there exists strategy such that , then
It is apparent that . Namely, . This is in conflict with the definition of trust maximin equilibrium strategy too. Then there does not exist a trust maximin equilibrium strategy in this case.
The other cases can be proved in the same way. This completes the proof.
According to Theorem 3.9, we know that this game exists trust maximin equilibrium strategy only if all strategies are in some section, for example, . Next let us discuss the following case that all strategies are in some section.
Theorem 3.10. For all strategies satisfying , the game exists a trust maximin equilibrium strategy if and only if linear programming problems (3.29) and (3.30) have optimal solutions, where problems (3.29) and (3.30) are separately characterized as follows: where is any fixed vector, where is any fixed vector.
Proof. For all strategies satisfying , the trust measure function of payoffs matrix is characterized by the following equation:
Suppose . According to the definition of trust maximin equilibrium strategy, whether the game equilibrium has an equilibrium strategy in is equal to the following two problems.
For any fixed ,
For any fixed ,
We know that only if the two problems have optimal solution, the game exists an equilibrium strategy. Because problems (3.32) and (3.33) are similar, then let us only discuss problem (3.32). For a fixed , let . Then problem (3.32) is converted into a linear programming problem
Similarly, problem (3.33) can be converted into the following problem, for any fixed ,
where .
For problems (3.29) and (3.30), we can make use of MATLAB to get optimal solution of the programming problem by turning them a bilevel programming problem. Here, we do not give the detail description. Then we go on to discuss another case that . Similarly, we can get the following conclusion.
Theorem 3.11. For all strategies satisfying , the game exists a trust maximin equilibrium strategy if and only if linear programming problems (3.36) and (3.37) have optimal solutions, where problems (3.36) and (3.37) are characterized as follows: where is any fixed vector, where is any fixed vector.
Proof. It can be proved similarly as Theorem 3.10.
We have discussed many simple cases; there is still a more complicated case that . For this case, according to Lemma 3.6, we have that Right now, the problem to find if the game has the trust maximin equilibrium strategy is converted into the following two problems: where is any fixed vector, and
where is any fixed vector. The two problems are nonlinear programming problems. We can make use of many traditional methods to solve them, for example, methods of feasible directions (see Polak [21]), FrankWolfe methods (see Meyer and Podrazik [22]). However, the solutions we got through these methods are usually local optimal solutions, not the global optimal solutions. In the following section, we will introduce an algorithm to solve the nonlinear programming such as problems (3.39) and (3.40). Then we can get the trust minmax equilibrium strategy of the game.
4. Genetic Algorithm
For many complex problems such as problem (3.39) and (3.40), it is difficult to obtain its optimal solution by the traditional technique. Therefore, GA is an efficient tool to obtain the efficient solution by its global searching ability. Take problem (3.39) as an example and we will list the detailed procedure to illustrate how the genetic algorithm introduced by Gen and Cheng [23] works. Let express the objective function and express the feasible set.
() Initializing process: the initial population is formed by chromosomes associated with basic feasible solutions of problem (3.39). Hence any general procedure to get them can be applied. Therefore, we can take the solution as a chromosome. Randomly generate the feasible solution in . Repeat the above process times, then we have initial feasible chromosomes .
() Evaluation function: in this case, we only attempt to obtain the best solution, which is absolutely superior to all other alternatives by comparing the objective function. Then we can construct the evaluation function by the following procedure: (i) compute the objective value , (ii) the evaluation function is constructed as follows: which expresses the evaluation value of the th chromosome in current generation.
() Selection process: The selection process is based on spinning the roulette wheel times. Each time a single chromosome for a new population is selected in the following way. Calculate the cumulative probability for each chromosome : Generate a random number in and select the chromosomes such that (). Repeat the above process times and obtain copies of chromosomes.
() Crossover operation: the goal of crossover is to exchange information between two parent chromosomes in order to produce two new offspring for the next population. The uniform crossover of Genetic operator proposed by Li et al. [24] in this paper. The detail is as follows. Generate a random number and if , then the chromosome is selected as a parament, where the parameter which is the probability of crossover operation. Repeat this process times and we get parent chromosomes to undergo the crossover operation. The crossover operator on and will produce two children as follows: The children of chromosomes and can be generated as above. They are feasible if they are both in and then we replace the parents with them. Or else we keep the feasible one if it exists. Redo the crossover operator until we obtaine two feasible children or a given number of cycles is finished.
() Mutation operation: a mutation operator is a random process where one genotype is replaced by another to generate a new chromosome. Each genotype has the probability of mutation, , to change from 0 to 1. Let be selected as parent. Choose a mutation direction randomly. is an appropriate large positive number. We replace the parent with the child If are infeasible, we set as a random number between 0 and until it is feasible and then replace with it.
Above all, it can be simply summarized in Procedure 1.

5. Numerical Example
Game theory is widely applied in many fields, such as, economic and management problems, social policy, and international and national politics; sometimes players should consider the state of uncertainty. A kind of games are usually characterized by rough payoffs. In this section, we give an example of twoperson zerosum game with rough payoffs to illustrate the effectiveness of the algorithm introduced above. There is a game between player I and player II. When player I gives strategy and player II gives strategy , player II will give some money to player I which is at least between and , or at most between and . The payoff matrix of player I is as follows where rough variables () are characterized as
Firstly, let us consider the expected maximin equilibrium strategy of this game. According to Remarks 2.9 and 3.2, we have that where
Then, we can get the equilibrium strategy that when player I gives the mixed strategy and player II gives the mixed strategy , player I gets the most payoff 20 which is the least payoffs player II loses.
Next, let us consider if this game has the trust maximin equilibrium strategy. According to Lemma 3.6, we have
Then we give five predetermined numbers and discuss if the game exists a trust maximin equilibrium strategy.
Case 1 (). Apparently, and . Thus, for all , they satisfy . Based on Theorem 3.7, we know that all are 5trust maximin equilibrium strategy of this game.
Case 2 (). Similarly, and . Thus, for all , they satisfy . Based on Theorem 3.8, we know that all are 40trust maximin equilibrium strategy of this game.
Case 3 (). Because and , for , not all satisfy . According to Theorem 3.9, we know that this game does not exist a trust maximin equilibrium strategy.
Case 4 (). Apparently, and . Thus, for , all satisfy . Based on Theorem 3.11, we can get the following two problems
where is any fixed strategy,
where is any fixed strategy, .
Then we can make use of simplex method to get the optimal solutions of problems (5.6) and (5.7). The optimal solutions is
Case 5 (). Apparently, and . Thus, for , all satisfy . Then we can get two nonlinear programming problems.
For any fixed
For any fixed ,
For problems (5.8) and (5.9), we can solve them by using the rough simulationbased genetic algorithm. Let the number of chromosomes in every generation be 20, the probability of crossover 0.85 and of mutation 0.1. Then after a run of a genetic algorithm computer program (5000 generations), we get the optimal solution and the objective value as shown in Figure 1.
6. Conclusion
In this paper, we have considered a class of twoperson zerosum matrix games with rough payoffs. Firstly, we have given the definition of the game with rough payoffs and then proposed two kinds of equilibrium strategy. Secondly, we have discussed wether the twoperson zerosum matrix games with rough payoffs exist the equilibrium strategy. Thirdly, we proposed the genetic algorithm to solve the most complicated case. It is an available and efficient way to search the equilibrium of this kind of games with rough payoffs. Lastly, the numerical example illustrated well our research methods. We have only considered one kind of games with uncertain payoffs. Of course, there are many other games with uncertain payoffs which need to be researched.
Acknowledgments
This research has been supported by the Key Program of NSFC (Grant no. 70831005) and the National Science Foundation for Distinguished Young Scholars, China (Grant no. 70425005).