Matrix Expression of Shapley Value in Graphical Cooperative Games

Wang, Yuanhua; Alsaadi, Fuad E.; Liu, Zheng; Wu, Xiaomeng; Liu, Xiyu

doi:https://doi.org/10.1155/2020/2045654

Mathematical Problems in Engineering

On this page

Abstract Introduction Preliminaries Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Control Problems of Nonlinear Systems with Applications 2020

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 2045654 | https://doi.org/10.1155/2020/2045654

Matrix Expression of Shapley Value in Graphical Cooperative Games

Yuanhua Wang,¹Fuad E. Alsaadi,²Zheng Liu,¹Xiaomeng Wu,¹and Xiyu Liu¹

Guest Editor: Rongwei Guo

Received11 Mar 2020

Accepted31 Mar 2020

Published22 May 2020

Abstract

This paper studies a class of cooperative games, called graphical cooperative games, where the internal topology of the coalition depends on a prescribed communication graph among players. First, using the semitensor product of matrices, the value function of graphical cooperative games can be expressed as a pseudo-Boolean function. Then, a simple matrix formula is provided to calculate the Shapley value of graphical cooperative games. Finally, some practical examples are presented to illustrate the application of graphical cooperative games in communication-based coalitions and establish the significance of the Shapley value in different communication networks.

1. Introduction

Game theory provides a formal mathematical formation to describe the complex interactions among rational players [1]. In general, game theory can be divided into two branches: noncooperative games and cooperative games. In noncooperative game theory, the fundamental unit of study is the individual player, and the theory studies the strategic choices in the interactions among competing players. By contrast, the fundamental unit in cooperative game theory is the set of players or coalition, and the theory studies the behaviour of rational players when they cooperate. The fundamental problem in cooperative game theory is how to allocate the profit or value of a coalition to its individual players in such a way that players are encouraged to cooperate. A fair allocation that has been widely used is the Shapley value [2].

In recent years, there has been an increasing amount of research on using graph theory to cooperative games, where the players are interconnected and communicate with others in a network graph. For modelling the communication graph, cooperative games in the graph form, called graphical cooperative games or graphical coalitional games, are introduced by Myerson in [3]. These are games where the internal structure of the coalition is described by a network. In the network, nodes represent players and two players are interpreted to have an edge between them if and only if they can communicate with each other. In such games, unlike the value of a coalition depending solely on the members of that coalition in canonical cooperative games, the value function will be dependent of how the players are interconnected within the coalition. In [4–6], the formation and stability of coalitions given an underlying communication graph are studied, and its applications to communication networks have been investigated. In [7], the graphical coalitional games are studied with applications to economic and social networks, and the authors have analyzed the stability of networks when players can choose to form and maintain the links between them. This game model is also used to study biologic networks [8] and so on.

It is pointed out in [3] that the Shapley value is the only possible function that provides a fair allocation in graphical coalitional games. However, its computational complexity becomes an obstacle both in practical applications and theoretical deductions [9]; a remark is also presented in [6] to state that “the Shaple value is computationally expensive, but for fairly large structures one time computation is still affordable. For such a graph that even one time computation is not affordable, approximations can be used for its computation.” In our recent work [10], a simple matrix formula is obtained to calculate the Shapley value and the basic mathematical method is the semitensor product of matrices (STP), which is a generalization of the traditional matrix product [11]. This method has been successfully applied in the analysis and control problems of logical networks [12–25], and then it has been used in finite game theory [26–30], evolutionary games [31–38], finite automata [39, 40], graph theory [41], etc. Unlike the canonical cooperative games being considered in [10], this paper studies a new class of cooperative games, called graphical cooperative games. Wang et al. [10] have provided the matrix formulas to calculate the symmetric and weighted Shapley values for canonical cooperative -person games. However, this paper proposes a simple formula to calculate the Shapley value of graphical cooperative games, and it is more computationally complex than the formulas in [10].

The paper is organized as follows. A brief review for the STP method and graphical cooperative games is presented in Section 2. In Section 3, the matrix formula of the Shapley value in graphical cooperative games is presented. Section 4 discusses the practical applications of graphical cooperative games to some communication networks. Section 5 is a brief conclusion.

Before ending this section, we present some notations used in this paper. . , where is the th column of the identity matrix . is the dimensional Euclidean space. denotes the set of real matrices. () is the set of columns (rows) of and () is the th column (row) of . . A matrix is called a logical matrix if the columns of are of the form of , that is, . Denote by the set of logical matrixes.

2. Preliminaries

2.1. Semitensor Product of Matrices

The basic technique used in this paper is the STP of matrices. We can refer to [11] for details.

Definition 1. Let , , and be the least common multiple of and . The STP of and is defined aswhere is the Kronecker product. As a generalization of the conventional matrix product, the STP of matrices keeps the useful properties of the conventional matrix product available. For convenience, the symbol ”” may be omitted without confusion.
Next, we present some properties of the STP used in this paper.

Proposition 1. Let be a column and be a matrix. Then,The STP has pseudocommutative properties, and the swap matrix is defined as follows.

Definition 2. The matrix , defined byis called the th dimensional swap matrix.

Proposition 2. Let and be two columns. Then,If is a logical variable, then . To use vector expression of logical values, we identify and . Now, a pseudological (or logical) function can be expressed as an algebraic form.

Theorem 1. Let (or ) be a pseudological (or logical) function. Then, there exists a unique vector (or matrix) (or ), such thatwhere is called the structure vector (or matrix) of , which can be calculated as

2.2. Graphical Cooperative Games

In essence, a canonical cooperative game involves a set of players, denoted by , who seek to form cooperative groups in order to strengthen their positions in the game. Any subset of is called a coalition, and is called the grand coalition. The second fundamental concept of the canonical cooperative game is the characteristic function or value function, denoted by with , which quantifies the worth of a coalition in a game. Therefore, a canonical cooperative game can be denoted by a pair [4]. In general, we can identify a cooperative game with its value function , since for every a different game may be defined.

Next, we give the definition of graphical cooperative games.

Definition 3. (see [6]). A graphical cooperative game is denoted by , where(1) is an undirected graph with a finite nonempty set of players and a set of edges. The elements of are also called nodes or vertices. The number of elements in is called the order or size of and is denoted as . In this paper, we only consider that is a simple graph, that is, does not contain self-loops and multiple edges. Let be a graph such that and ; then, is called a subgraph of . If contains all the edges with , then is called an induced subgraph of and denoted as .(2) is called the value function or characteristic function with , where is the collection of all the induced subgraphs of . It should be noted that is required to satisfy four axioms of value [6].For every induced subgraph , that is, , the value function can be expressed as a pseudological function by using the logical variables; then, we havewhere is a logical variable andDefine a lexicographic order aswhere is a decimal number corresponding to each induced subgraph , and its binary number is . That is, we can describe , , , , .
Using Theorem 1, for every pseudological function , we can find its structure vector , such that equation (7) can be expressed into its matrix form aswhere and , . Because of , the last element of is 0, that is, .

3. Matrix Formula of the Shapley Value in Graphical Cooperative Games

In this section, we give a matrix formula to calculate the Shapley value in graphical cooperative games in order to reduce the computational complexity. First, we define the Shapley value of player in graphical cooperative games.

Definition 4. (see [6]). Consider a graphical cooperative game ; the Shapley value of player is defined aswhere means is an induced subgraph of , and is an induced subgraph of that contains all the players in and player .
Since , then we havePlugging it into (11) yieldsAccording to (10), we have the matrix expression aswhere , and in vector form,It follows thatAccording to Definition 2, we haveThen, we obtain thatwhereSimilar to the construction in [10], we construct a vector as follows:Let , , where denotes the th element of . Use to construct a new column vector , whereSet , and we divide into equal blocks as follows:That is, when , then can be divided into two equal blocks , , and when , then .
Based on the abovementioned derivation, the Shapley value (13) can be written asThen, we have the following result for calculating the Shapley value in graphical cooperative games.

Theorem 2. Consider a graphical cooperative game , its Shapley value can be calculated by the following matrix formula:where

Remark 1. In the conversional formula of the Shapley value (13), the computational complexity is . Using the STP method, a simple matrix form of the Shapley value is provided in Theorem 2. Observing (24), in order to calculate the Shapley value, we just need to discuss the computational complexity of matrix . Obviously, the dimension of is and with the help of MATLAB, the matrix can be easily obtained by using the recursive algorithm, which is the major advantage of Theorem 2.

4. Practical Examples of Graphical Cooperative Games

In this section, we consider some practical examples of graphical cooperative games, which are presented in [6]. These examples show the applications of graphical cooperative games to communication network of sensor nodes. Nodes communicate with each other through links.

Example 1. Assume that the value of a communication network is the number of nodes pairs which can communicate with each other; then, the value function for a connected graph of size isThree different communication networks between six nodes are shown in Figure 1.
Using (10), the value function of graph shown in Figure 1(a) can be expressed aswhere is a row vector; using (26), it is easy to calculate thatThen, we construct a column vector asAccording to (21), a new column vector can be calculated asNow, we divide into equal blocks, where .
Using Theorem 2, we haveAccording to (24), we can easily obtain its Shapley value by using MATLAB software, which is presented asSimilarly, the Shapley value of each node in Figures 1(b) and 1(c) can also be given bywhereIt is shown that, in three network graphs, the only difference is the structure vector of value function, which is dependent of its corresponding communication graph. Therefore, for a communication network with the same number of nodes, the matrix is the same. Besides, it is to be noted that our computational results coincide with the values presented in [6].
Based on the above calculated Shapley values, it can be seen that the more a node is involved in the communication network, the more is its Shapley value. For example, in Figure 1(a), node 2 is more vital than any of the nodes 4, 5, and 6, since node 2 exclusively supports the communication between nodes 1 and 3. Comparing Figures 1(b) and 1(c), the addition of new link between nodes 1 and 5 in Figure 1(c) can support the communication between nodes 1 and 5, which is exclusively supported by the link between nodes 2 and 4 in Figure 1(b); hence, it assigns more Shapley values to nodes 2 and 4 in Figure 1(b).
The following example presented in [6] shows that, for some communication networks with special structure topologies, the Shapley value can be simple to calculate regardless of the number of players.

(a)

(b)

(c)

Example 2. Consider a network with nodes, the structure topology between them is a star graph with node 1 as the star point. In [6], a simple formula to compute the Shapley value of each node is given and this formula holds for any number of nodes. Using our matrix formula (24) in Theorem 2, it is also easy to calculate the Shapley value, and it is shown that, for the star graph between nodes, the computational complexity between the formula in [6] and our matrix formula (24) is the same. Moreover, it is obvious that, in a star graph for the structure vector of value function in (10), the last elements of are all 0, since . For example, when , the network graph is described in Figure 2, and its structure vector can be calculated thatUsing (24), where is the same as in example 1, we have its Shapley value asIt is established that node 1 is the most vital node in this communication graph.
From these two simple examples, it is worth noting the advantage of our result in Theorem 2. Regardless of the structure topology for communication networks, we only need to calculate the matrix , which is easily obtained by using recursive algorithm with the help of MATLAB. However, it is pointed in [6] that the Shapey value is computationally expensive and for a fairly large graph even one time computation is not affordable.

5. Conclusion

This paper considers a new class of cooperative games, called graphical cooperate games. Using the STP method, the value function is presented as a pseudo-Boolean function, and a corresponding formula is obtained to calculate the Shapley value for graphical cooperate games. Then, the worth of each player in a coalition based on its connectivity in communication network can be explored. Some examples are given to demonstrate the theoretical results. In our future work, we will study more useful properties of graphical cooperative games based on the Shapley value.

With the rapid development of science, the game-theoretic approach will be a promising new method for studying more control problems in the future, such as synchronization [42–49], and consensus problems [50–53].

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by the National Natural Science Foundation (NNSF) of China under Grants 61903236, 61876101, 61773371, and 71701115.

References

J. Von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, Princeton, NJ, USA, 1944.
L. S. Shapley, “17. A value for n-person games,” Contributions to the Theory of Games (AM-28), Volume II, vol. 2, no. 28, pp. 307–318, 1953.
View at: Publisher Site | Google Scholar
R. B. Myerson, “Graphs and cooperation in games,” Mathematics of Operations Research, vol. 2, no. 3, pp. 225–229, 1977.
View at: Publisher Site | Google Scholar
W. Saad, Z. Han, M. Debbah et al., “Coalitional game theory for communication networks: a tutorial,” IEEE Signal Processing Magazine, vol. 26, no. 5, pp. 77–97, 2009.
View at: Publisher Site | Google Scholar
W. Saad, Z. Han, T. Başar et al., “Coalition formation games for collaborative spectrum sensing,” IEEE Transactions on Vehicular Technology, vol. 60, no. 1, pp. 276–297, 2011.
View at: Publisher Site | Google Scholar
M. Aurangzeb and F. L. Lewis, “Internal structure of coalitions in competitive and altruistic graphical coalitional games,” Automatica, vol. 50, no. 2, pp. 335–348, 2014.
View at: Publisher Site | Google Scholar
M. O. Jackson and A. Watts, “The evolution of social and economic networks,” Journal of Economic Theory, vol. 106, no. 2, pp. 265–295, 2002.
View at: Publisher Site | Google Scholar
S. Moretti, V. Fragnelli, F. Patrone et al., “Using coalitional games on biological networks to measure centrality and power of genes,” Bioinformatics, vol. 26, no. 21, pp. 2721–2730, 2010.
View at: Publisher Site | Google Scholar
J. R. Marden and A. Wierman, “Distributed welfare games,” Operations Research, vol. 61, no. 1, pp. 155–168, 2013.
View at: Publisher Site | Google Scholar
Y. Wang, D. Cheng, and X. Liu, “Matrix expression of Shapley values and its application to distributed resource allocation,” Science China Information Sciences, vol. 62, no. 2, pp. 222011–11, 2019.
View at: Publisher Site | Google Scholar
D. Cheng, H. Qi, and Z. Li, Analysis and Control of Boolean Networks - A Semi-tensor Product Approach, Springer, London, UK, 2011.
H. Li, X. Xu, and X. Ding, “Finite-time stability analysis of stochastic switched Boolean networks with impulsive effect,” Applied Mathematics and Computation, vol. 347, pp. 557–565, 2019.
View at: Publisher Site | Google Scholar
J. Zhong, Y. Liu, K. I. Kou, L. Sun, and J. Cao, “On the ensemble controllability of Boolean control networks using STP method,” Applied Mathematics and Computation, vol. 358, pp. 51–62, 2019.
View at: Publisher Site | Google Scholar
Y. Liu, Y. Zheng, H. Li, F. E. Alsaadi, and B. Ahmad, “Control design for output tracking of delayed Boolean control networks,” Journal of Computational and Applied Mathematics, vol. 327, pp. 188–195, 2018.
View at: Publisher Site | Google Scholar
Q. Zhu, Y. Liu, J. Lu et al., “Further results on the controllability of Boolean control networks,” IEEE Transactions on Automatic Control, vol. 64, no. 1, pp. 440–442, 2019.
View at: Publisher Site | Google Scholar
J. Lu, J. Zhong, C. Huang et al., “On pinning controllability of Boolean control networks,” IEEE Transactions on Automatic Control, vol. 61, no. 6, pp. 1658–1663, 2016.
View at: Publisher Site | Google Scholar
H. Li, L. Xie, and Y. Wang, “Output regulation of Boolean control networks,” IEEE Transactions on Automatic Control, vol. 62, no. 6, pp. 2993–2998, 2017.
View at: Publisher Site | Google Scholar
J. Lu, H. Li, Y. Liu et al., “Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2040–2047, 2017.
View at: Publisher Site | Google Scholar
Y. Li, H. Li, and W. Sun, “Event-triggered control for robust set stabilization of logical control networks,” Automatica, vol. 95, pp. 556–560, 2018.
View at: Publisher Site | Google Scholar
X. Xu, Y. Liu, H. Li et al., “Robust set stabilization of Boolean control networks with impulsive effects,” Nonlinear Analysis: Modelling and Control, vol. 23, no. 4, pp. 553–567, 2018.
View at: Publisher Site | Google Scholar
G. Zhao and S. Fu, “Matrix approach to trajectory control of higher-order k-valued logical control networks,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2110–2115, 2017.
View at: Publisher Site | Google Scholar
Y. Li, H. Li, and X. Ding, “Set stability of switched delayed logical networks with application to finite-field consensus,” Automatica, vol. 113, 2020.
View at: Google Scholar
Y. Zheng, H. Li, X. Ding, and Y. Liu, “Stabilization and set stabilization of delayed Boolean control networks based on trajectory stabilization,” Journal of the Franklin Institute, vol. 354, no. 17, pp. 7812–7827, 2017.
View at: Publisher Site | Google Scholar
Y. Wang, X. Zhang, and Y. Hao, “Robust controllability and observability of boolean control networks under different disturbances,” Mathematical Problems in Engineering, vol. 2019, Article ID 1813594, 2019.
View at: Google Scholar
H. Li and Y. Wang, “Lyapunov-based stability and construction of Lyapunov functions for Boolean networks,” SIAM Journal on Control and Optimization, vol. 55, no. 6, pp. 3437–3457, 2017.
View at: Publisher Site | Google Scholar
D. Cheng and T. Xu, “Application of STP to cooperative games,” in Proceedings of the 10th IEEE ICCA, pp. 1680–1685, Zhejiang, China, 2013.
View at: Google Scholar
D. Cheng, “On finite potential games,” Automatica, vol. 50, no. 7, pp. 1793–1801, 2014.
View at: Publisher Site | Google Scholar
Y. Wang, T. Liu, and D. Cheng, “From weighted potential game to weighted harmonic game,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2161–2169, 2017.
View at: Publisher Site | Google Scholar
H. Li, X. Ding, Q. Yang et al., “Algebraic formulation and Nash equilibrium of competitive diffusion games,” Dynamic Games and Applications, vol. 8, no. 2, pp. 423–433, 2018.
View at: Publisher Site | Google Scholar
Y. Hao, S. Pan, Y. Qiao et al., “Cooperative control via congestion game approach,” IEEE Transactions on Automatic Control, vol. 63, no. 12, pp. 4361–4366, 2018.
View at: Publisher Site | Google Scholar
H. Li, X. Ding, A. Alsaedi et al., “Stochastic set stabilization of n-person random evolutionary Boolean games and its applications,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2152–2160, 2017.
View at: Publisher Site | Google Scholar
G. Zhao, H. Li, W. Sun, and F. E. Alsaadi, “Modelling and strategy consensus for a class of networked evolutionary games,” International Journal of Systems Science, vol. 49, no. 12, pp. 2548–2557, 2018.
View at: Publisher Site | Google Scholar
P. Guo, H. Zhang, F. E. Alsaadi et al., “Semi-tensor product method to a class of event-triggered control for finite evolutionary networked games,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2140–2145, 2017.
View at: Publisher Site | Google Scholar
X. Ding, H. Li, Q. Yang, Y. Zhou, A. Alsaedi, and F. E. Alsaadi, “Stochastic stability and stabilization of n -person random evolutionary Boolean games,” Applied Mathematics and Computation, vol. 306, pp. 1–12, 2017.
View at: Publisher Site | Google Scholar
S. Fu, H. Li, G. Zhao et al., “Modelling and strategy optimisation for a kind of networked evolutionary games with memories under the bankruptcy mechanism,” International Journal of Control, vol. 91, no. 5, pp. 1104–1117, 2018.
View at: Publisher Site | Google Scholar
G. Zhao, Y. Wang, and H. Li, “A matrix approach to the modeling and analysis of networked evolutionary games with finite memories,” IEEE/CAA Journal of Automatica Sinica, vol. 5, no. 4, pp. 818–826, 2018.
View at: Publisher Site | Google Scholar
T. Liu, J. Wang, X. Zhang et al., “Game theoretic control of multiagent systems,” SIAM Journal on Control and Optimization, vol. 57, no. 3, pp. 1691–1709, 2019.
View at: Publisher Site | Google Scholar
J. Wang, X. Gao, and Y. Xu, “Intermittent control for demand-side management of a class of networked smart grids,” IET Control Theory & Applications, vol. 13, no. 8, pp. 1166–1172, 2019.
View at: Publisher Site | Google Scholar
Y. Yan, Z. Chen, and Z. Liu, “Semi-tensor product approach to controllability and stabilizability of finite automata,” Journal of Systems Engineering and Electronics, vol. 26, no. 1, pp. 134–141, 2015.
View at: Publisher Site | Google Scholar
W. Dou, H. Li, and F. E. Alsaadi, “Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata,” Mathematical Problems in Engineering, vol. 2019, Article ID 8021750, 2019.
View at: Google Scholar
J. Zhong, J. Lu, C. Huang, L. Li, and J. Cao, “Finding graph minimum stable set and core via semi-tensor product approach,” Neurocomputing, vol. 174, pp. 588–596, 2016.
View at: Publisher Site | Google Scholar
E. Alzahrani, H. Akca, X. Li et al., “New synchronization schemes for delayed chaotic neural networks with impulses,” Neural Computing and Applications, vol. 28, no. 9, pp. 2823–2837, 2017.
View at: Publisher Site | Google Scholar
R. Guo, “Projective synchronization of a class of chaotic systems by dynamic feedback control method,” Nonlinear Dynamics, vol. 90, no. 1, pp. 53–64, 2017.
View at: Publisher Site | Google Scholar
X. Li, R. Rakkiyappan, and N. Sakthivel, “Non-fragile synchronization control for Markovian jumping complex dynamical networks with probabilistic time-varying coupling delays,” Asian Journal of Control, vol. 17, no. 5, pp. 1678–1695, 2015.
View at: Publisher Site | Google Scholar
X. Xu, Y. Liu, H. Li et al., “Synchronization of switched Boolean networks with impulsive effects,” International Journal of Biomathematics, vol. 11, no. 6, 2018.
View at: Google Scholar
Z. Wang and R. Guo, “Hybrid synchronization problem of a class of chaotic systems by an universal control method,” Symmetry, vol. 10, no. 11, p. 552, 2018.
View at: Publisher Site | Google Scholar
X. Li, P. duan, J. Cao et al., “Exponential synchronization of neural networks via feedback control in complex environment,” Complexity, vol. 1, pp. 1–13, 2018.
View at: Google Scholar
Y. Li, P. Duan, and H. Li, “Synchronization of switched logical control networks via event-triggered control,” Journal of The Franklin Institute, vol. 355, no. 12, pp. 5203–5216, 2018.
View at: Publisher Site | Google Scholar
X. Zhang, X. Lv, and X. Li, “Sampled-data-based lag synchronization of chaotic delayed neural networks with impulsive control,” Nonlinear Dynamics, vol. 90, no. 3, pp. 2199–2207, 2017.
View at: Publisher Site | Google Scholar
X. Tan, J. Cao, X. Li et al., “Leader-following mean square consensus of stochastic multi-agent systems with input delay via event-triggered control,” IET Control Theory & Applications, vol. 12, no. 2, pp. 299–309, 2018.
View at: Publisher Site | Google Scholar
Y. Li, H. Li, X. Ding, and G. Zhao, “Leader-follower consensus of multiagent systems with time delays over finite fields,” IEEE Transactions on Cybernetics, vol. 49, no. 8, pp. 3203–3208, 2019.
View at: Publisher Site | Google Scholar
X. Tan, J. Cao, X. Li et al., “Consensus of leader-following multiagent systems: a distributed event-triggered impulsive control strategy,” IEEE Transactions on Cybernetics, vol. 49, no. 3, pp. 792–801, 2019.
View at: Publisher Site | Google Scholar
Y. Li, H. Li, X. Xu et al., “A semi-tensor product approach to minimal-agent consensus control of networked evolutionary games,” IET Control Theory & Applications, vol. 12, no. 16, pp. 2269–2275, 2018.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Yuanhua Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1070

Downloads

756

Citations