Academia.eduAcademia.edu

Governance of Social Welfare in Networked Markets

2019, IEEE Transactions on Computational Social Systems

This paper aims to investigate how a central authority (e.g. a government) can increase social welfare in a network of markets and firms. In these networks, modeled using a bipartite graph, firms compete with each other à la Cournot. Each firm can supply homogeneous goods in markets which it has access to. The central authority may take different policies for its aim. In this paper, we assume that the government has a budget by which it can supply some goods and inject them into various markets. We discuss how the central authority can best allocate its budget for the distribution of goods to maximize social welfare. We show that the solution is highly dependent on the structure of the network. Then, using the network's structural features, we present a heuristic algorithm for our target problem. Finally, we compare the performance of our algorithm with other heuristics with experimentation on real datasets.

arXiv:1911.09152v1 [cs.GT] 20 Nov 2019 G OVERNANCE OF S OCIAL W ELFARE IN N ETWORKED M ARKETS MohammadAmin Fazli Department of Computer Engineering Sharif University of Technology Tehran, Iran [email protected] Alireza Amanihamedani Department of Computer Engineering Sharif University of Technology Tehran, Iran [email protected] A BSTRACT This paper aims to investigate how a central authority (e.g. a government) can increase social welfare in a network of markets and firms. In these networks, modeled using a bipartite graph, firms compete with each other à la Cournot. Each firm can supply homogeneous goods in markets which it has access to. The central authority may take different policies for its aim. In this paper, we assume that the government has a budget by which it can supply some goods and inject them into various markets. We discuss how the central authority can best allocate its budget for the distribution of goods to maximize social welfare. We show that the solution is highly dependent on the structure of the network. Then, using the network’s structural features, we present a heuristic algorithm for our target problem. Finally, we compare the performance of our algorithm with other heuristics with experimentation on real datasets. Keywords Networked Markets, Cournot Competition, Social Welfare, Governance, Optimization. 1 Introduction Cournot Competition in single-market setting has been vastly studied in the literature [1, 2, 3, 4]. In this oligopolistic model, each firm decides the quantity of the homogenous good it is willing to supply to the market. Then, according to the inverse demand function, the market-clearing price is determined based on the aggregate supply in the market. However, with the emergence of diverse and complicated economic scenarios, single-market models are inadequate for studying reality. In many settings, firms can compete in different markets, whether or not the good is identical in those markets. Typically, this situation is modeled using a bipartite graph in which one side of nodes represents firms and the other side depicts various markets. Each market is characterized by an inverse demand function. Multi-market competition is found abundantly in industries such as natural gas, water, electricity, airlines, cement, healthcare, etc [5, 6, 7, 8]. One question that arises naturally in the presence of strategic agents is the means by which it is possible to raise welfare measures [9, 10]. One such measure is social welfare, which aims to capture the aggregate well-being in the economic environment [11, 12]. In this case, it is typically the government that seeks and has the responsibility of higher social welfare. While there have been many studies on interactions between firms and equilibria in networked markets (See e.g. [13, 14, 15]), to the best of our knowledge, there is little work on how to govern and control social welfare in networked markets. The prevalence of networked markets in real-life experiences motivates us to study social welfare in this model. Our paper takes one step forward towards this objective. We consider a limited intervention budget for the government in the pursuit of higher social welfares. Therefore, we assume that the government is able to have a small amount of supply into every market. This small intervention setting enables us to use some techniques for the estimation of social welfare in terms of government’s supplies. The simple structure of the approximation leads to a strategy for the government. However, it is good to note that the actions taken by the government, are specified by the structure of the network. After all, this structure, along with the consumers’ behaviors, are sufficient statistics to specify the market. 1.1 Related Works Our work is in essence related to several groups of papers. First, there have been many attempts in studying the strategic behavior of firms and equilibria in the competition [16, 14, 17, 18]. One such study, which has been our first step-stone, is done by Bimpikis el al. [14], where they present a "characterization of the production quantities at the unique equilibrium of the resulting game for any given network", in terms of supply paths in the network. Furthermore, they introduce the price-impact matrix which enables them to explore the effect of changes in network structure on firms’ profits and consumer welfare. These changes include entering of a firm in a new market and also merging of two firms. Their results challenge the standard beliefs in Cournot oligopoly that more competition necessarily leads to higher welfare. Relatedly, Abolhassani et al. [15] turn their focus on finding algorithms that compute pure Nash equilibria in Cournot competitions in networks. In [13], the impact of monopolies on social welfare in a certain model of Bertrand network competition is studied. Another thread of studies relevant to ours is the ones analyzing interactions in the networks and their impact on aggregate measures [19, 20, 21, 22]. Most relatedly, Acemoglu et al. [20] have proposed a framework that paves the way to examine equilibria in such inter-dependent agents setting and discover the effect of small microeconomic shocks on the economy’s aggregate performance. Acting as our main inspiring study, they use Taylor expansion to acquire insights on the impact of shocks. Their examinations yield different results about the economy’s ex ante aggregate performance in the case of linear and non-linear worlds. To understand how the structure of the network shapes the economy’s performance, they demonstrate that the Bonacich centrality measure can capture this effect when the nature of the interactions is linear. Such analysis is prevalent in economics. For example, the general notion of production networks demands consideration of dependencies and network effects [23]. Lastly, following the connections found between Bonacich centrality and network effects in network Cournot competition [14, 24], studies about controlling centrality measures in networks can be considered related to ours. Generally, with an established relationship between centrality measures and social welfare in our setting, one might use these methods to change the structure of the competition such that social welfare increases. As such articles, [25, 26, 27] model the centrality control problem as an optimization problem and presents an algorithm to solve it. 2 Problem Formulation Consider a netwok game G which consists of n firms F = {f1 , · · · , fn } and m markets M = {m1 , · · · , mm } in which the firms compete. Each firm has access to a set of markets, meaning that it can supply the goods only in those specific markets. For firm fi , let Mi be the set of those markets. Similarly, let Fj denote the set of firms that have access to market mj . The amount of good that firm fi supplies in mj is shown by qij . Moreover, firm fi would incur the production cost Ci (q) (q is the vector of all qij s). We consider the inverse demand functions of the markets as linear. More specifically, market mj is governed by the relation X qij . (1) Pj (q) = αj − βj fi ∈Fj Additionally, Ci (q) = ci · ( X qij )2 . (2) mj ∈Mi For the sake of our analysis, we at first, suppose that for all mi ∈ M , αi = α and βi = β and for all fj ∈ F , cj = c. We model this economy with a bipartite graph G = (V, E). An example of this graph can be seen in Figure 1. Figure 1: A Graph for a Networked Market 2 Briefly speaking, we can consider each fi ’s profit as a combination of the afformentioned components: X qik · Pk (q) − Ci (q) πi (q) = (3) mk ∈Mi So given a network market graph G, each fi in competition with other firms solves the following optimization problems for computing its best response.  maximize πi q i , q −i qi (4) subject to qik ≥ 0 for mk ∈ Mi qik = 0 for mk ∈ / Mi where qi and q−i denotes the vector of production quantities of fi and its competitors, respectively. Bimpikis et al. [14], have focused on the equilibrium analysis of this model and their main result about the unique Nash equilibrium of this game is adopted as the foundation of this research. Theorem 1. [Adopted from Bimpikis et al. [14]] The unique Nash equilibrium of the game is given by q ∗ = [I + γW ]−1 γ ᾱ, 1 where γ = 2(c+β) , ᾱ is a |E| × 1 vector such that for every edge (i, k) ∈ E we have ᾱik = αk and W is an |E| × |E| matrix whose entries are ( 2c if i1 = i2 , k1 6= k2 β if i1 6= i2 , k1 = k2 wi1 k1 ,i2 k2 = 0 otherwise The matrix [I + γW ]−1 is called the Leontief inverse. We assume that the matrix [I + γW ] is inversible. For a given realistic economy, this assumption is shown to be true [28, 29]. In this paper, we propose and formalize the problem of optimized governance of the afformentioned network market (networked cournot competition) with the objective of maximizing the social welfare. Social welfare (SW ) in cournot competitions is defined as the sum of consumer surplus (CS) and firms’ total profit. The consumer surplus in the Nash equilibrium is computed by the following formula (see [30, 14]): X (αk − Pk (q ∗ ))2 CS = . (5) 2β mk ∈M Therefore the social welfare’s formula is: SW P ∗ = Pfi ∈F πP i (q ) + CS ∗ = fi ∈F [ mk ∈Mi qik · Pk (q ∗ ) − Ci (q ∗ )] P 2 + mk ∈M 2/β · (αk − Pk (q ∗ )) (6) Now, assume that an additional node which is called the government and has access to all markets is added to the network. This node’s target is to maximize the social welfare without concerning its own utility. It has been provided with a budget of B and can use this budget to provide some shocks to each market. In this paper, each shock to market mk is defined as provisioning some goods (ǫk ≤ q t ) to this market alongside the competing firms. q t is a threshold that is forced by external entities such as law or social pressure. Firms compete until they reach an equilibrium. The equilibrium can be computed by the following theorem. Theorem 2. The unique Nash equilibrium of the game G in the presence of shocks {ǫi }m i=1 is given by q ∗ = [I + γW ]−1 γ(ᾱ − βǫ), where W and α are defined as in Theorem 1 and βǫ is a |E| × 1 vector such that for every edge (i, k) ∈ E we have ¯ = βk · ǫ k βǫ ik Proof. In the presence of shocks we can rewrite the firms’ utility functions: P Ci (q) πi (q, ǫ) = Pmk ∈Mi qik · Pk (q) −P = mk ∈Mi qik [αk − βk ( fj ∈Fk qjk + ǫk )] P −ci · ( mk ∈Mi qik )2 . P P = mk ∈Mi qik [(αk − βk ǫk ) + βk fj ∈Fk qjk ] P −ci · ( mk ∈Mi qik )2 3 Assume that we have a new game G ′ where everything is the same as the previous setting (G) except that the values of αk s have changed to αk − βk ǫk . By Theorem 1 , we will have the following formula for the Nash equilibrium point: q ∗ = [I + γW ]−1 γ(ᾱ − βǫ) Equilibria in G in the presence of shocks are equal to equilibria of G ′ because πi s computed by the above formula is exactly what must be for G ′ . So by following the method used in [14] for proving Theorem 1, our desired target will be achieved. Note that for each mk ∈ M , we must have ǫk < α/β, because if not, the price function Pk will be negative and it is not acceptable. Now we can write the formulation of social welfare. The SW function in the presence of shocks can be recalculated as follows: SW P (q ∗ , ǫ) + CS = fi ∈F π  iP  P ∗ ∗ ∗ = fi ∈F mk ∈Mi qik · Pk (q , ǫ) − Ci (q ) 2 P + mkh∈M 2/βk · αk − Pk (q ∗ , ǫ)  P P P ∗ ∗ = fi ∈F fj ∈Fk qjk − βǫ mk ∈Mi qik αk − β i  P ∗ 2 −c mk ∈Mi qik h P 2 i P ∗ + βǫ + mk ∈M 2/β · β fj ∈Fk qjk P  P ∗ q α = mk ∈M k fi ∈Fk ik 2 P P ∗ q −(β/2) · mk ∈M fi ∈Fk ik 2 P P ∗ q −c fi ∈F   mk ∈Mi ik P P ∗ ǫk − mk ∈M (β/2) · ǫ2k + fi ∈Fk qik Therefore, we have the following vectorized formula, SW = q ∗ T α − (β/2 + c)q ∗ T q ∗ − (1/2)q ∗ T W q ∗ (7) T −βǫ q ∗ − (β/2)ǫT ǫ, where ǫ is a m × 1 vector whose kth component is equal to ǫk and other things are defined as before (see Theorem 1 and Theorem 2). By the above formulation the problem of governing social welfare with market shocks can be modeled by the optimization problem described in Definition 1. Definition 1. The problem of governing (maximizing) social welfare with shocks in a networked market G (M axSW (G)) is defined as the following optimization problem: Maximize q ∗ T α − (β/2 + c)q ∗ T q ∗ − (1/2)q ∗ T W q ∗ T −βǫ q ∗ − (β/2)ǫT ǫ subject to q ∗ = X [I + γW ]−1 γ(ᾱ − βǫ) ǫk )2 ≤ B c·( mk ∈M 0 ≤ ǫk ≤ q t ∀mk ∈ M T All the elements of the sum depicted in the SW formula are concave except −βǫ q ∗ which makes the convex optimization frameworks unusable. In the next section, we devise a heuristic algorithm for this optimization problem. This is done by proposing a linear estimation for the social welfare and an optimization algorithm for maximizing it. Then in Section 4, by experimentation on real and synthetic data, the good performance of this heuristic algorithm is shown. 3 Solution Estimation In this section, we provide some insights about the social welfare function and by linearizing it with Taylor expansion, we propose an algorithm called the Linear heuristic for the M axSW (G) problem. More precisely in this section, we 4 propose a metric that can be computed by the network structure and we analytically show that picking the markets with larger amounts of it can (approximately) maximize the social welfare. In the next section by running experiments on real and synthetic datasets, we will demonstrate the superiority of this metric over other metrics. The main idea for this aim is to use the first order multivariate Taylor expansion [31] to create a linear approximation for the social welfare function. This approximation leads to a linear combination of ǫi s: SW (ǫ) = SW (0) + ζ1 ǫ1 + ζ2 ǫ2 + ... + ζm ǫm . Keeping in mind that the government has a limited budget for its interventions, we can consider the shocks small (∀mk ∈M ǫk ≤ q t ), so this approximation may be valid. The coefficient of each ǫi (ζi ) can be considered as the afformentioned metric. Since SW is a differentiable function, we can write SW as follows: SW (ǫ) ≈ SW (0) + ǫ · ∇SW (0) m X ∂SW ǫr = SW (0) + |ǫ=0 ∂ǫr r=1 (8) So, the amount of social welfare added by shocks is a linear combination of ǫr s whose coefficients are ζr = ∂SW ∂ǫr |ǫ=0 . So to maximize the amount of social welfare, markets should be supplied in order of their ζr s. The structure of this algorithm can be seen in Algorithm 1. Here’s how to calculate the coefficients. Using Theorem 2 and expanding the formula derived for q ∗ , we have: P P ∗ ∗ αk − 2c mℓ ∈Mi ,mℓ 6=mk qiℓ − β fj ∈Fk qjk ∗ qik = 2(β + c) X αk ∗ − (γW )ik,jℓ qjℓ = 2(β + c) (9) (j,ℓ)∈E(G) If we define function f (z) = γα − γz, ∗ qij = f( X ∗ wij,kℓ qkℓ + γβǫj ) (10) k, l denotes the amount firm fi supplies in market mj in equilibrium under the presence of shock ǫj . Moreover, from Equation 7 with h(x) = αx − ( β2 + c)x2 and u(qij , qkℓ ) = wij,kℓ qij qkℓ , X X ∗ h(ǫk ) )+ SW = h(qij mk ∈M i, j (11) m X X 1 X ∗ ∗ ∗ − qjk u(qij , qkℓ )−β ǫk 2 j i, j, k ,ℓ k=1 is the social welfare under the circumstances discussed so far. We start our analysis by calculating ∗ ∂qij ∂ǫr ∗ ∂qij ∂ǫr . By the idea used in [20],   X ∗ wij,kℓ qkℓ + γβǫj  · = f′  i, j, k ,ℓ   X wij,kℓ i, j, k ,ℓ ∗ ∂qkℓ ∂ǫr  (12) + γβ1{r = j} Evaluating this equation using the matrix form at the point ǫ = (ǫ1 , · · · , ǫ|E| ) = 0, which is the absence of the government, yields ∂q ∗ (13) |ǫ=0 = −γβ(I + γW )−1 er , ∂ǫr where er is a |E| × 1 vector, with ones for edges connecting to market mr and zeros elsewhere. Thus, we have: ∗ X ∂qij |ǫ=0 = −γβ λij,kr , ∂ǫr k 5 (14) where λij,kr is the corresponding element to edges ij and kr of matrix (I + γW )−1 . Setting our sights on social welfare, we have: ∗ ∂ SW X ′ ∗  ∂qij = + α − (β + 2c)ǫr h qij ∂ǫr ∂ǫr i,j " # ∗ ∗ ∗ X X ∂qjk ∂u ∂qkℓ 1 X ∂u ∂qij + . − β ǫ − k ∗ ∂ǫ 2 ∂qij ∂qkℓ ∂ǫr ∂ǫr r j k i,j,k,ℓ Considering h′ (x) = α − (β + 2c)x and (15) ∂u(qij ,qkℓ ) ∂qij = wij,kℓ qkℓ , we get: ∗ ∂qij ∂ SW X ∗ (α − (β + 2c)qij ) = + ∂ǫr ∂ǫr i,j   ∗ ∗ ∂qij 1 X ∗ ∗ ∂qkℓ wij,kℓ qkℓ − + wij,kℓ qij 2 ∂ǫr ∂ǫr (16) i,j,k,ℓ −β X k Thus, we evaluate equation (16) at ǫ = 0: ǫk ∗ X ∂qjk j ∂ǫr + α − (β + 2c)ǫr ) ∗ X ∂qij ∂ SW ∗ |ǫ=0 = |ǫ=0 (α − (β + 2c)qij |ǫ=0 ) ∂ǫr ∂ǫr i,j ∗ ∂qij 1 X h ∗ |ǫ=0 wij,kℓ qkℓ |ǫ=0 2 ∂ǫr i,j,k,ℓ i ∂q ∗ ∗ +wij,kℓ qij |ǫ=0 kℓ |ǫ=0 + α) ∂ǫr − (17) ∗ qij |ǫ=0 has been studied in [14]. Based on their results, we can deduce the following in our setting: ∗ qij |ǫ=0 = γα X λij,kℓ . (18) kℓ Using equation (14) and (18), we get: X X X ∂ SW λij,kr − λij,kℓ ) (α − γα(β + 2c) |ǫ=0 = −γβ ∂ǫr ij k kℓ X X X X (γα λij,kℓ ( wij,kℓ γβλkℓ,tr )) + α i,j kℓ kℓ (19) t Since we have derived a formula for computing ζr = ∂SW ∂ǫr |ǫ=0 s, we can state the final algorithm. This algorithm is shown in Algorithm 1. In the first four lines of this algorithm ζr s are computed from the network structure and Leontief matrix. After that a set T is initialized to the set of all markets and a variable S is initialized to 0. In the next while loop, T is to be the set of markets that have not been supplied with shocks so far and S is defined as the total goods supplied by the government. So the loop execution will continue until either all markets are supplied with shocks or the cost of shock supplies exceeds the budget intended for this purpose (B). In each iteration of the while loop, the market with maximum ζr is chosen from T and extracted from this set. Then the maximum possible shock is computed as ǫr and is added to S. Note that for computing ǫr , three upper bounds must be considered: 1. q t is the upper bound defined in Definition 1. 6 β is the upper bound defined by the price function. If ǫr > α , the price will be negative at that market and it is acceptable. q B 3. cr − S is the amount of goods that can be provided by the remaining budget. 2. β α Input: A network market G alongside with parameters α, β and γ Output: The amount of shocks ǫ1 , ǫ2 , ..., ǫm which makes the maximum social welfare Set λij,kr equal to the corresponding elements to edges ij and kr of matrix (I + γW )−1 for r ← 1 to mP do P P P P P P ζr ← −γβ ij (α − γα(β + 2c) kℓ λij,kℓ ) k λij,kr − i,j (γα kℓ λij,kℓ ( kℓ wij,kℓ t γβλkℓ,tr )) + α end T ←MS←0 while T 6= ∅ and c · S 2 < B do Set r to the index of the market mr ∈ T with maximum ζr T ← T \ mr q ǫr ← min{q t , αβrr , cBr − S} S ← S + ǫr end return ǫr s Algorithm 1: The Linear Heuristic for solving M axSW (G) 4 Empirical Study We evaluate the performance of our proposed measure and method on the synthetic data and a real-world dataset of different pharmaceutical companies as our firms and different markets for drugs. For example, Aspirin and its users define a market in which players are companies that produce this drug. We collect this dataset from different 135 drug companies that produce 603 drugs altogether. Additionally, we use identical parameters α, β, c for all the firms and markets, as we are considering the symmetric case. These parameters are set in a way to be close to real-life values. The synthetic data also has 603 markets and 135 firms, which has been chosen randomly. The characteristics of this dataset are shown in Table 1. A subgraph of this network is shown in Figure 2. Figure 2: A Subgraph of the Drug Company Dataset 4.1 Competitor Benchmark The essence of competitors we consider is that the government takes on a measure to rank the markets. Next, it supplies goods to markets in that order, as much as possible and as long as permissible. Naively, it is possible to choose the markets at random. No measure, to the best of our knowledge, has been presented for picking the markets yet. Nevertheless, centrality measures are natural candidates for us to use as benchmarks. As for the centrality measures we consider, we use the followings: 7 Table 1: Summary of Dataset’s Characteristics Drug Companies Dataset Characteristic Value #Markets 603 #Firms 135 #Firm-Market pairs (edges) 2049 Table 2: Summary of proposed algorithms in the competitor benchmark Heuristic Description Linear AscDeg DescDeg AscBet DescBet AscCL DescCL Random Descending order of ζi Ascending order of d(mi ) Descending order of d(mi ) Ascending order of b(mi ) Descending order of b(mi ) Ascending order of cl(mi ) Descending order of cl(mi ) Random order of mi • Degree. The simplest centrality measure is the degree of a node, which in our model, is the number of firms competing in a market: d(mi ) = |Fi |. • Betweenness. Generally speaking, betweenness centrality is a quantity for determining the impact of a node over the flow of information in a graph [32]. The betweenness of a node is an indicator for the fraction of shortest paths in a graph that pass through this vertex. In our setting: X b(mi ) = fj ,fk ∈F σjk (mi ) , σjk where σjk is the total number of shortest paths from firm fj to firm fk and σjk (mi ) is the total number of those paths that include market mi . • Closeness. Closeness centrality is an aggregate measure of a node’s proximity to other nodes. More precisely, closeness of node v is defined as the inverse of sum of distances of node v from other nodes. Considering our model: X cl(mi ) = fj ∈F 1 , dist(mi , fj ) where dist(mi , fj ) is the distance between market mi and firm fj in the graph. Regardless of the measure one picks, it is possible to adopt the ascending or the descending order. Thus, we consider both choices, however, the ascending order empirically shows better performance with these benchmark centrality measures. In conclusion, we present our studied strategies in Table 2. After having our graph, we use Theorem 2 to calculate the equilibrium of the game with our parameters α, β, and c. Subsequently, we pick a policy A for governance of social welfare from Table 2. Then, the government begins supplying the amount q t of the commodity into the markets in the corresponding order, until the supplies violate the jq k B constraints in Definition 1. Thus, the government would supply up to C , where B is the budget that innates to the M axSW (G) problem. Altering B gives us a trajectory for social welfare. Let SWA (B) be the social welfare obtained by applying strategy A on M axSW (G) with parameter B. In the next subsection, we compare trajectories SWA (B) for policies in Table 2. 4.2 General performance Our empirical results are indicated in Figures 3, 4, 5, 6, 7 and 8. For each policy A of Table 2, we plot the difference between the amount of social welfare which can be obtained by our Linear algorithm and the social welfare which can be obtained by the heuristic A, i.e. SWLinear (B) − SWA (B). 8 Figure 3: The difference between the social welfare obtained by the Linear heuristic and competitor structural heuristics with ascending order in the dataset of drug companies Figure 4: The difference between the social welfare obtained by the Linear heuristic and competitor structural heuristics with descending order in the dataset of drug companies We observe that our proposed measure is strictly better than other mentioned quantities. For the random case, we use the average results over 50 different realizations to extract the expected performance. It is good to note that picking the markets according to ascending order of a centrality measure seems to be better than the reverse order. This is intuitive, since markets with lower centralities are generally more monopolized and government’s interventions have more impact on them. This observation is in accordance with the general belief in economics that higher competition leads to higher social welfare []. In addition, the difference in social welfare obtained by the Linear heuristics and other methods tend to rise, until a certain point at which drops. Since the end point of the plots suggests the government to supply in almost all markets by each method, the last points have y coordinates close to zero. All the plots are strictly above the horizontal line y = 0, except beginning points which indicates the superiority of our proposed approach over other mentioned strategies. Figure 5: The difference between the social welfare obtained by the Linear heuristic and the random heuristic in the dataset of drug companies 9 Figure 6: The difference between the social welfare obtained by the Linear heuristic and competitor structural heuristics with ascending order in the synthetic dataset Figure 7: The difference between the social welfare obtained by the Linear heuristic and competitor structural heuristics with descending order in the synthetic dataset Figure 8: The difference between the social welfare obtained by the Linear heuristic and the random heuristic in the synthetic dataset 10 References [1] David M Kreps and Jose A Scheinkman. Quantity precommitment and bertrand competition yield cournot outcomes. The Bell Journal of Economics, pages 326–337, 1983. [2] Yaner Fang and Biying Shou. Managing supply uncertainty under supply chain cournot competition. European Journal of Operational Research, 243(1):156–176, 2015. [3] Fabio Tramontana, AA Elsadany, Baogui Xin, and HN Agiza. Local stability of the cournot solution with increasing heterogeneous competitors. Nonlinear Analysis: Real World Applications, 26:150–160, 2015. [4] Christos Constantatos and Ioannis N Pinopoulos. Accommodation effects with downstream cournot competition. Managerial and Decision Economics, 40(1):119–124, 2019. [5] Petter Skantze, Marija Ilic, and Jeffrey Chapman. Stochastic modeling of electric power prices in a multi-market environment. In 2000 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No. 00CH37077), volume 2, pages 1109–1114. IEEE, 2000. [6] Arnold A Heggestad and Stephen A Rhoades. Multi-market interdependence and local market competition in banking. The Review of Economics and Statistics, pages 523–532, 1978. [7] Scott Gilbert. Multi-Market Antitrust Economics. Springer, 2017. [8] Marcelo J Villena and Axel A Araneda. Dynamics and stability in retail competition. Mathematics and Computers in Simulation, 134:37–53, 2017. [9] Richard E Just and Darrell L Hueth. Welfare measures in a multimarket framework. The American Economic Review, 69(5):947–954, 1979. [10] Ian J Bateman, Brett H Day, Stavros Georgiou, and Iain Lake. The aggregation of environmental benefit values: welfare measures, distance decay and total wtp. Ecological economics, 60(2):450–460, 2006. [11] Amartya Sen. Collective choice and social welfare. Harvard University Press, 2018. [12] John Clarke and Janet Newman. The managerial state: Power, politics and ideology in the remaking of social welfare. Sage, 1997. [13] Elliot Anshelevich and Shreyas Sekar. Price competition in networked markets: How do monopolies impact social welfare? In International Conference on Web and Internet Economics, pages 16–30. Springer, 2015. [14] Kostas Bimpikis, Shayan Ehsani, and Rahmi Ilkilic. Cournot competition in networked markets. In EC, page 733, 2014. [15] Melika Abolhassani, Mohammad Hossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, and Anshul Sawant. Network cournot competition. In International Conference on Web and Internet Economics, pages 15–29. Springer, 2014. [16] Francesco Nava. Quantity competition in networked markets. Technical report, mimeo: University of Chicago, 2009. [17] Elliot Anshelevich and Shreyas Sekar. Price competition in networked markets: How do monopolies impact social welfare? In International Conference on Web and Internet Economics, pages 16–30. Springer, 2015. [18] John ZF Pang, Hu Fu, Won I Lee, and Adam Wierman. The efficiency of open access in platforms for networked cournot markets. In IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pages 1–9. IEEE, 2017. [19] Matthew O Jackson. Social and economic networks. Princeton university press, 2010. [20] Daron Acemoglu, Asuman Ozdaglar, and Alireza Tahbaz-Salehi. Networks, shocks, and systemic risk. Technical report, National Bureau of Economic Research, 2015. [21] Seyyed Hadi Sajadi, MohammadAmin Fazli, and Jafar Habibi. The affective evolution of social norms in social networks. IEEE Transactions on Computational Social Systems, 5(3):727–735, 2018. [22] Peng Zhang, Jinliang Wang, Xiaojia Li, Menghui Li, Zengru Di, and Ying Fan. Clustering coefficient and community structure of bipartite networks. Physica A: Statistical Mechanics and its Applications, 387(27):6869– 6875, 2008. [23] Vasco M Carvalho and Alireza Tahbaz-Salehi. Production networks: A primer. 2018. [24] Rahmi Ilkilic. Cournot competition on a network of markets and firms. 2009. [25] Vincenzo Nicosia, Regino Criado, Miguel Romance, Giovanni Russo, and Vito Latora. Controlling centrality in complex networks. Scientific reports, 2:218, 2012. 11 [26] Yang-Yu Liu, Jean-Jacques Slotine, and Albert-László Barabási. Control centrality and hierarchical structure in complex networks. Plos one, 7(9):e44459, 2012. [27] Phillip Bonacich, Amalya Oliver, and Tom AB Snijders. Controlling for size in centrality scores. Social networks, 20(2):135–141, 1998. [28] Michael Sonis, JD Hewings, and Jiemin Guo. A new image of classical key sector analysis: minimum information decomposition of the leontief inverse. Economic Systems Research, 12(3):401–423, 2000. [29] Frederick V Waugh. Inversion of the leontief matrix by power series. Econometrica: Journal of the Econometric Society, pages 142–154, 1950. [30] Peter J Hammond. Essential Mathematics for Economic Analysis. Financial Times/Prentice Hall, 2002. [31] Konrad Königsberger. Analysis 2. Springer-Verlag, 2013. [32] Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163–177, 2001. 12