Skip to content
Publicly Available Published by De Gruyter December 12, 2017

Quantum Symmetric Cooperative Game with a Harmonious Coalition

  • A.S. Elgazzar EMAIL logo and H.A. Elrayes

Abstract

The concept of forming harmonious coalitions is introduced to both classical and quantum symmetric cooperative games. In both the cases, players are motivated to form coalitions. Also, the main feature of the cooperative game is conserved.

1 Introduction

Game theory [1], [2] is the study of mathematical models of conflict and cooperation between rational individuals. It had been formalised by Neumann and Morgenstern [1]. Game theory is applied to many areas especially social and biological sciences [2].

Cooperative game [2] is an interesting element of game theory. Players can form coalitions, binding agreements, etc. Therefore, it is important to investigate forming coalitions in a cooperative game. The main feature of a cooperative game is the characteristic function of a coalition. It is the payoff which a coalition assures for itself for all strategies of the opponent. Classical cooperative game is a zero-sum game, and players are found to be motivated to form a coalition.

There is an increasing interest in applying some concepts of quantum mechanics to many scientific fields. For example, in quantum information theory [3], quantum mechanics offers new possibilities for the communication and processing information. Superposition principle and entanglement are the fundamental concepts in quantum information theory.

A combination of game theory and concepts of quantum information theory leads to quantum game theory [4], [5]. Quantisation of games allows to expand the strategy space to a Hilbert space of strategies instead of a set of few pure classical strategies. Also, linear superpositions between strategies are allowed. The Marinatto–Weber’s scheme [5] is simple and straight forward. It is applied to quantise many classical games [6], [7], [8].

Iqbal and Toor [6] had studied a quantum symmetric cooperative game. In their scheme, players are not motivated to form a coalition, and the zero-sum property is lost.

In many situations, individuals are allowed to have binding agreements and form a coalition beforehand. This is obvious in sport competitions and political party formation. Therefore, we modified the Iqbal and Toor’s scheme [6] by assuming coalitions beforehand. Also, the concept of harmonious coalition is introduced. Harmonious coalition means players in the same coalition use the same strategy (pure or a superposition of strategies). Marinatto–Weber’s scheme [5] is used. Players are found to be motivated to form a coalition, and the zero-sum property of the game is conserved.

2 Classical Form

A classical three-player and zero-sum cooperative game [6] with pure strategies is given as:

(1)Γ=N={1,2,3},UN={F,E},PN:U1×U2×U3,

where N is the number of players, U is the strategy and P is the payoff. Let Q={A, B, C} be the set of players. Each player chooses one strategy F or E. If the three players choose the same strategy, then every player gets zero of money. The two players who choose the same strategy get one unit of money each from the single player. Then, the payoff matrix is given as follows:

where the left payoff is for player A, the middle is for player B and the right is for player C.

Let ξ be a subset of Q. The players in ξ form a harmonious coalition. The coalition appears as a single player with the same strategy. Suppose ξ={B, C}, then Qξ={A}, and Γξ is the coalition game given by the following payoff matrix:

where the left payoff is for player A, and the right payoff is for the coalition ξ.

It is often useful and more realistic to expand the strategy space to include mixed strategies. Consider player A may play strategy F with probability p and strategy E with probability 1−p, and the coalition ξ may play strategy F with probability q and strategy E with probability 1−q. Then the expected payoff of Qξ is:

(2)PQξ=4pq2p2q.

At an equilibrium, the expected payoff cannot depend on the probability q, then its partial derivative with respect to q must be set to zero. This gives p=12, and the optimal mixed strategy for Qξ becomes 12[F]+12[E]. Similarly, for the coalition ξ the optimal mixed strategy is 12[FF]+12[EE].

The coalition ξ is guaranteed to gain a payoff 1 for all strategies of the single player. Then, the characteristic function of the coalition ξ is υξ)=1. Also, the characteristic function of the single player Qξ is υQξ)=−1. Therefore, for any single player,

(3)υ({A})=υ({B})=υ({C})=1.

And for any coalition,

(4)υ({A, B})=υ({B, C})=υ({C, A})=1.

Because the characteristic function of a coalition is the highest, players are motivated to form a coalition.

3 Quantum Form

We use Marinatto–Weber’s scheme [5] to quantise the symmetric cooperative game with harmonious coalition. A harmonious coalition with players B and C is assumed. This means players B and C have to choose the same strategy. Therefore, we suppose an entangled initial quantum state as follows:

(5)|ψin=CFFF|FFF+CEFF|EFF+CFEE|FEE+CEEE|EEE,

where the coefficients CFFF, CEFF, CFEE, CEEE∈ℂ, such that

(6)|CFFF|2+|CEFF|2+|CFEE|2+|CEEE|2=1.

The ket |FFF〉 means player A plays strategy |F〉, player B plays strategy |F〉, and player C plays strategy |F〉, i.e. |FFF〉=|F〉⊗|F〉⊗|F〉. Because of the harmony of the coalition the terms containing |EEF〉, |EFE〉, |FFE〉, and |FEF〉 are excluded from the initial state.

The unitary operators are defined as follows: the identity operator I=(1001), and pauli-spin flip operator σ=(0110), where

(7)σ|F=|E,σ|E=|F,σ=σ=σ1,I|F=|F,I|E=|E,I=I=I1.

After the initial state was introduced to players, the single player {A} and the coalition {B, C} carry out their strategies with probabilities p and q with the identity operator, and 1−p and 1−q with the Pauli-spin flip operator, respectively, on the initial state.

The initial density matrix of ψin is

ρin=|ψinψin|.

(8)ρin=[CFFF|FFF+CEFF|EFF+CFEE|FEE+CEEE|EEE]·[CFFFFFF|+CEFFEFF|+CFEEFEE|+CEEEEEE|].

Then,

(9)ρin=(|CFFF|200CFFFCFEECFFFCEFF00CFFFCEEE0000000000000000CFEECFFF00|CFEE|2CFEECEFF00CFEECEEECEFFCFFF00CEFFCFEE|CEFF|200CEFFCEEE0000000000000000CEEECFFF00CEEECFEECEEECEFF00|CEEE|2).

The final density matrix after players have played their strategies can be written as

(10)ρfin=pqIAIBICρinIAIBIC+p(1q)IAσBσCρinIAσBσC+(1p)qσAIBICρinσAIBIC+(1p)(1q)σAσBσCρinσAσBσC.

The payoff operators for players A, B and C are

(11)PA,B,C=a1,b1,c1|FFFFFF|+a2,b2,c2|EFFEFF|+a3,b3,c3|FEEFEE|+a4,b4,c4|EEEEEE|.

where the constants ai, bi and ci, i=1, 2, 3, 4 are the classical payoffs. The expected payoff functions of players A, B and C are

(12)$A,B,C=Tr[PA,B,Cρfin].

From the classical payoff of players A, B and C in Tables 1 and 2 the constants in (11) become

Table 1:

Payoff matrix for the cooperative game, when player C plays strategy F.

Player B: FPlayer B: E
Player A: F(0,0,0)(1,−2,1)
Player A: E(−2,1,1)(1,1,−2)
Table 2:

Payoff matrix for the cooperative game, when player C plays strategy E.

Player B: FPlayer B: E
Player A: F(1,1,−2)(−2,1,1)
Player A: E(1,−2,1)(0,0,0)
(13)a1=a4=0,a2=a3=2,b1=b4=0,b2=b3=1,c1=c4=0,c2=c3=1.

Then

(14)$A(p,q)=[|CFFF|2+|CEEE|2][4pq2p2q]+[|CFEE|2+|CEFF|2][4pq+2p+2q2].
(15)$B,C(p,q)=[|CFFF|2+|CEEE|2][2pq+p+q]+[|CFEE|2+|CEFF|2][2pqpq+1].

From (14) and (15), it is obvious that $A(p, q)+$B(p, q)+$C(p, q)=0. This ensures the zero-sum property of the quantum game in our scheme.

To investigate how the quantum aspect affects the outcome of the game, the expected payoffs $A and $B,C are plotted with respect to both the probabilities p and q at different values for the constants |CFFF|2, |CEFE|2, |CFEE|2, and |CEEE|2 that correspond to different initial states. In Figure 1, |CFFF|2=1, the initial state is non-entangled. The classical game payoffs appear as limiting points of the payoffs of the quantum version for non-entangled initial states. Figure 2 shows the relation between both $A and $B,C and the probabilities p and q for an entangled initial state. The payoffs for the maximally entangled initial state are shown in Figure 3. Because of the zero-sum property, the behavior of $B+$C is the inverse of the behavior of $A in all cases. Figures 13 clearly show the dependence of the expected payoff in the quantum version on the initial quantum state and the players strategies.

Figure 1: The expected payoffs of players when |CFFF|2=1. (a) The expected payoff for player A. (b) The expected payoff for players B and C.
Figure 1:

The expected payoffs of players when |CFFF|2=1. (a) The expected payoff for player A. (b) The expected payoff for players B and C.

Figure 2: The expected payoffs of players when |CFFF|2=0.1, |CEFF|2=0.4, |CFEE|2=0.3 and |CEEE|2=0.2. (a) The expected payoff for player A. (b) The expected payoff for players B and C.
Figure 2:

The expected payoffs of players when |CFFF|2=0.1, |CEFF|2=0.4, |CFEE|2=0.3 and |CEEE|2=0.2. (a) The expected payoff for player A. (b) The expected payoff for players B and C.

Figure 3: The expected payoffs of players when |CFFF|2=|CEFF|2=|CFEE|2=|CEEE|2=1/4. (a) The expected payoff for player A. (b) The expected payoff for players B and C.
Figure 3:

The expected payoffs of players when |CFFF|2=|CEFF|2=|CFEE|2=|CEEE|2=1/4. (a) The expected payoff for player A. (b) The expected payoff for players B and C.

Now, let the coalition ξ play the mixed strategy s[FF]+(1−s)[EE], and the single player Qξ play the mixed strategy t[F]+(1−t)[E]. In this case the payoff of the coalition ξ is obtained as

(16)Pξ=stPξ[FFF]+s(1t)Pξ[EFF]+(1s)tPξ[FEE]+(1s)(1t)Pξ[EEE],

where Pξ[FFF] is the payoff of ξ when all players play the strategy [F], i.e. p=1 and q=1. Now from (15), we get

(17)Pξ[FFF]=PB[11]+PC[11]=2[|CFEE|2+|CEFF|2]=Pξ[EEE],
(18)Pξ[EFF]=PB[01]+PC[01]=2[|CFFF|2+|CEEE|2]=Pξ[FEE].

Therefore, from (16), we get

(19)Pξ=2st[|CFEE|2+|CEFF|2]+2s(1t)[|CFFF|2+|CEEE|2]+21s)t[|CFFF|2+|CEEE|2]+21s)(1t)[|CFEE|2+|CEFF|2].

To get the optimal payoff, the partial derivative with respect to t must be set to zero. It gives s=12. Similarly, for the single player t=12. Therefore, the characteristic function of the coalition ξ becomes

(20)υ(Γξ)=υ({B,C})=|CFFF|2+|CEFF|2+|CFEE|2+|CEEE|2=1.

Similarly, the payoff of the single player Qξ is

(21)PQξ=stPQξ[FFF]+s(1t)PQξ[EFF]+(1s)tPQξ[FEE]+(1s)(1t)PQξ[EEE].

From (14), we get

(22)PQξ[FFF]=PA[11]=2[|CFEE|2+|CEFF|2]=PQξ[EEE],
(23)PQξ[EFF]=PA[01]=2[|CFFF|2+|CEEE|2]=PQξ[FEE].

Then

(24)υ(ΓQξ)=υ({A})=[|CFFF|2+|CEFF|2+|CFEE|2+|CEEE|2]=1.

From (20) and (24), the quantised game is a zero-sum game, and the players have the advantage to form a coalition.

A harmonious coalition with players A and B can be assumed using the following initial state:

(25)|ψin=CFFF|FFF+CFFE|FFE+CEEF|EEF+CEEE|EEE.

Using the same procedures, we get:

(26)υ({A, B})=1andυ({C})=1.

Similarly, for a coalition with players A and C, we have

(27)υ({A, C})=1andυ({B})=1.

These findings conserve the results of the classical form. But these results are in disagreement with the results of Iqbal and Toor [6] that both the motivation for forming coalition and the zero-sum property are lost in the quantised version.

The differences between Iqbal and Toor’s scheme [6] and ours are summarized in the following. We assume an initial state that allows to form a coalition beforehand. Introducing the concept of harmonious coalition that makes the coalition behave as a single player (Tab. 3).

Table 3:

Payoff matrix for the cooperative game, when players B and C form a coalition.

Coalition ξ: FFCoalition ξ: EE
Player A: F(0,0)(−2,2)
Player A: E(−2,2)(0,0)

4 Conclusion

Both classical and quantum versions of the cooperative game may have similar features; but they differ in details. The classical version depends only on a set of few pure classical strategies. In quantum version, the strategy space is extended to a Hilbert space of strategies. The initial quantum state prepared by an arbiter plays a crucial role in the quantum form. For some initial states, cooperation and forming a coalition are very important. For some other initial states, cooperation is useless [6].

The payoff in the quantum version depends on both the initial state and the players strategies (see Figs. 13). The classical version of the game appears as a limiting point of the quantum version (see Fig. 1). The initial quantum state acts like a social contract that organizes the relations between quantum players.

Acknowledgements

We would like to thank the referees for their helpful comments.

References

[1] J. V. Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, New Jersey 1944.Search in Google Scholar

[2] A. M. Colman, Game Theory and Its Applications in the Social and Biological Sciences, Butterworth-Heinemann, Oxford 1995.Search in Google Scholar

[3] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge 2000.Search in Google Scholar

[4] D. A. Meyer, Phys. Rev. Lett. 82, 152 (1999).10.1103/PhysRevLett.82.1052Search in Google Scholar

[5] L. Marinatto and T. Weber, Phys. Lett. A 272, 291 (2000).10.1016/S0375-9601(00)00441-2Search in Google Scholar

[6] A. Iqbal and A. Toor, Phys. Lett. A 293, 103 (2002).10.1016/S0375-9601(02)00003-8Search in Google Scholar

[7] S. Khan and M. K. Khan, Chin. Phys. Lett. 28, 070202 (2011).10.1088/0256-307X/28/7/070202Search in Google Scholar

[8] P. Frackiewicz, Int. J. Quantum Inform. 10, 1250048 (2012).10.1142/S0219749912500487Search in Google Scholar

Received: 2017-06-26
Accepted: 2017-11-09
Published Online: 2017-12-12
Published in Print: 2017-12-20

©2018 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 2.6.2024 from https://www.degruyter.com/document/doi/10.1515/zna-2017-0226/html
Scroll to top button