Network Formation with Asymmetric Players and Chance Moves

: We propose a model of network formation as a two-stage game with chance moves and players of various types. First, the leader suggests a connected communication network for the players to join. Second, nature selects a type vector for players based on the given probability distribution, and each player decides whether or not to join the network keeping in mind only his own type and the leader’s type. The game is of incomplete information since each player has only a belief over the payoff functions of others. As a result, the network is formed, and each player gets a payoff related to both the network structure and his type. We prove the existence of the Bayesian equilibrium and propose a new definition of the stable partially Bayesian equilibrium defining the network to be formed and prove its existence. The connection between the stable partially Bayesian equilibrium and the Nash equilibrium in the game is examined. Finally, we investigate the characteristics of the network structures under the stable partially Bayesian equilibrium in a three-player game with the major player as well as in the n -player game with a specific characteristic function. approaches


Introduction
The network formation process has been widely examined since network games became a hot topic in game theory. There exist many approaches modeling the network formation. Aumann and Myerson [1] were the first to model the network formation as a game, describing it by an extensive-form game using the theory of cooperative games with communication structures. Jackson and Watts [2] propose a model of dynamic network formation process and mainly focus on characterizing the set of stable networks. Goyal and Vega-Redondo [3] develop the dynamic network game to examine the interaction between a partner's choice and his individual behavior in coordination games. The network constructed influences the players' payoffs that is a result of a position in the formed network or the information the players access (see Möhlmeier et al. [4]). In some competition models, the network is a basis for interaction among players. The network is formed at the first stage of the game, and then the players are involved in the game and their payoffs are affected by the network structure formed before. The models of the network formation are described by Mazalov and Chirkova [5]. Multistage network games with perfect information are considered by Petrosyan and Sedakov [6], where players can change the network structure at each stage, and the equilibrium is found in this class of dynamic games. Cooperative two-stage network games are studied by Gao et al. [7], where first players form the network following some rules, and then realize cooperative strategies. Perc and Szolnoki [8] investigate the coevolution of strategy and network, exploring how and why network structures influence the evolution of cooperation. In addition, Wang et al. [9] model friendship relationships by means of complex networks and study how network formation can be affected by various games and rules. Two approaches to the endogenous The rest of the paper is organized as follows. In Section 2 basic definitions and notations are briefly introduced. In Section 3, the model of the two-stage network formation game with non-symmetric players and chance moves is presented. A special form of a two-stage game in an extensive form is described and investigated in Section 4. In Section 5 we introduce the main results, providing the proof of the Bayesian equilibrium existence in any subgame. The definition of the stable partially Bayesian equilibrium and its existence are provided in Section 5, in which we also show the connection between the stable partially Bayesian equilibrium and the Nash equilibrium. A three-player game with a major player is investigated in Section 6. Then an n-player game with two projects for the leader is considered in Section 7. We briefly conclude in the last section.

Preliminaries
Let the set of players be N = {1, . . . , n}, n ≥ 3. Suppose there is a player called the leader. We give a brief description of a cooperative game with a communication structure. A cooperative game with transferable utility is a pair (N, v), where v : 2 N → R is a characteristic function that assigns the worth v(S) to every coalition S ⊆ N, with v(∅) = 0. For the simplicity of notation and if no ambiguity appears, we write v when we refer to game (N, v). It is natural to allow the formation of not only a grand coalition, but also any coalition S ⊆ N. Denote by v S a cooperative game within coalition S ⊆ N while considering limited cooperation within S, where v S : 2 S → R, and v S (S ) = v(S ), S ⊆ S.
The communication structure on N is specified by graph (N, Γ), where Γ ⊆ Γ c N = {ij | i, j ∈ N, i = j} is a collection of unordered pairs of nodes (links). For ease of notation and if no ambiguity appears, we write Γ when we refer to the graph (N, Γ). Moreover, for any graph Γ and any coalition S ⊆ N, the subgraph of Γ on S is denoted by Γ S , where We say two nodes are connected, if there exists a path from one node to another. The graph is connected, if any two nodes are connected. Given graph Γ, S ⊆ N is connected, if Γ S is connected. Denote by C Γ the set of maximally connected coalitions, called components of graph Γ, and let C Γ (i) be the component containing Player i.
Given the characteristic function v(S), S ⊆ N, and graph Γ, determine the new characteristic function using the following approach [17]: Given v(S), S ⊆ N, and Γ, vector ξ(Γ) = (ξ 1 (Γ), . . . , ξ n (Γ)) is defined as a payoff vector determined for cooperative game v with graph Γ. Moreover, ξ i (Γ S ) denotes the payoff to Player i ∈ S in game v S with graph Γ S . For instance, if the Myerson value Y(Γ) is chosen as a cooperative solution [17], then [23] Let the communication structure be given by Γ = {12, 13}.

Players of Various Types
We assume that there can be a finite number of players' types. In addition, with all other similar situations the payoffs to the players of various types are defined in different ways. Let T = {I 1 , . . . , I l } denote a finite set of types for any player i, i ∈ N. The set of type vectors over N is denoted byT = × i∈N T. Let p ∈ (T) be a probability distribution over the set of type vectors that satisfies The probability distribution p is common knowledge for all players.
With characteristic function v(S), S ⊆ N, and graph Γ formed, the payoff to Player i of type I k , 1 ≤ k ≤ l, denoted as K i (Γ, I k ), is assumed to be defined.

Remark 1.
Payoff K i (Γ, I k ), a function of both the network structure and the type of player i ∈ N, can be defined in different ways. For instance, it can be defined as where ξ i (Γ, I k ) is the payoff value of Player i determined by some cooperative solution relative to type I k in game v C Γ (i) , and θ i (Γ, I k ) is a kind of extra encouragement or punishment to Player i of type I k in network Γ.

Example 2.
Consider the three-player game presented in Example 1. Now we demonstrate how we define the payoff function assuming that ξ i (Γ, I 1 ) is the ith component of the Myerson value with the given network Γ, and θ i (Γ, I 1 ) is the number of direct links Player i possesses in network Γ. As a result, the payoff to Player 2 of type I 1 is K 2 (Γ, I 1 ) = 7 6 + 1 = 13 6 .

Games with Chance Moves and Players of Various Types
The transition from one stage to another in a dynamic game is accomplished by the players' actions. It is possible to produce the situations in which the dynamic game proceeds by some chance factors. These sorts of transitions are chance moves. Player 0, being nature, selects a type vector t = (t 1 , t 2 , . . . , t n ) ∈T according to some given probability distribution p, then the game process proceeds to the next stage. We should notice that the whole game does not start from the nature move in our model. With vector t, Player i knows the type t i which has been selected for him, also he knows the type of the leader, but does not know the types of other players. Hence, Player i has a belief over the types of other players, which is defined by a conditional probability distribution. Thus, the network formation game with the chance moves and unknown players' types is of incomplete information under the given assumptions.

Two-Stage Network Formation Game
The two-stage network formation game with the chance moves, players of various types and the leader takes places as follows: Stage 1. The leader, say Player 1, chooses network (graph) Γ from set U 0 (e.g., he proposes a joint project), where U 0 is the subset of undirected connected graphs without loops on N. The cooperative game v representing the power of any coalition S is given and known for all players.

Remark 2.
We assume that Player 1 is determined as the leader before the game starts, and in fact, the case, where Player i ∈ N, i = 1, is set to be the leader can be described in the same way. Moreover, any player who is set as the leader possesses a unique type, I ∈ T in the game, which is known for all players.
Stage 2. Based on the proposal from Player 1 of the network structure, players N \ {1} and nature choose actions at the second stage.
Nature selects a type vector t = (t 1 , . . . , t n ) according to p(·|t 1 = I ), which is the conditional probability distribution based on the fact that Player 1 is determined as the leader. The set of all possible type vectors nature is able to select is {t | t 1 = I }, which is denoted bȳ T(1). Indeed, Player i, i ∈ N \ {1}, knows the type t i that has been selected for him and the type of the leader, I , but does not know types t j , j ∈ N \ {1, i} of other players.
The players from N \ {1}, knowing the proposed network and their respective types selected by nature, simultaneously and independently choose the actions from their common action set A, which is {accept, reject}. By choosing the action 'accept', player i ∈ N \ {1} joins the network. Otherwise, if he chooses the action 'reject', he starts playing as an individual player. Please note that in the following part, we denote the action 'accept' by 'a', and the action 'reject' by 'r'.
We denote by Γ u the network which is finally formed, where u = (u 2 , . . . , u n ) is the vector of actions that have been selected by players N \ {1} at the second stage, and it is specified as , and the leader, Player 1, gets payoff K 1 (Γ u , I ).

Two-Stage Game as Game in Extensive Form
The described two-stage game with the chance moves and players of various types can be considered to be the extensive-form game Φ with the set of players N ∪ {0} on a game tree describing the game process and denoted by Z.

Construction of a Tree Graph
Let X = X 0 ∪ X 1 ∪ . . . ∪ X n ∪ X n+1 be the finite set of vertices, where X 0 denotes the set of vertices at which nature makes the chance moves, X 1 = {x 0 } is a unique vertex of the leader, X i is the set of vertices at which player i ∈ N \ {1} makes moves and X n+1 = {x : F x = ∅} is the set of terminal vertices. For any vertex x ∈ X \ X n+1 , F x is the set of those vertices which can be realized immediately after the vertex x has been realized. For any set V ⊆ X, We denote the vertex to which the game process moves after Player 1 suggests network denote the personal vertex of Player 2 at which the game process arrives after nature selects the type vector t ∈T(1) at x Γ . In terms of the incomplete information players get, the set of personal vertices of player i ∈ N \ {1} is partitioned into finite number of subsets X (Γ,j) i , Γ ∈ U 0 , j ∈ {1, . . . , l}, which are referred to as the information sets of player Player i does not know the vertex itself, but knows that such a vertex is in a certain information set X (Γ,j) i ⊂ X i . For Player 1, there is a unique information set, X 1 .

Two-Stage Game on a Tree Graph
Before we describe how a two-stage game proceeds on the finite tree graph constructed above, we first define each player's behavior strategy in extensive-form game. Th behavior strategy of the leader (Player 1) in game Φ is function b 1 which is a mapping from X 1 to a probability distribution over set U 0 , b 1 : We denote the terminal vertex which can be reached with probability 1 from vertex The two-stage network formation game on the finite tree graph Z proceeds as follows. At vertex x 0 , the leader (Player 1) chooses the network Γ ∈ U 0 , then the game process moves to vertex x Γ . At x Γ , nature (Player 0) selects the type vector t ∈T(1) according to the conditional probability distribution p(·|t 1 = I ) which is a common belief of all players. Because of the incomplete information over the type vector chosen by nature, the game process moves to the information sets X (Γ,j(2)) 2 , . . ., X (Γ,j(n)) n simultaneously, where I j(i) = t i for i = 2, . . . , n. Then each player i ∈ N \ {1} chooses an action u i ∈ A for the corresponding information set independently. Finally, the game process terminates at vertex x u (Γ, t) , and Player i ∈ N gets the payoff H i (x u (Γ, t) ).

The Expected Payoff in the Extensive-Form Game Φ
Combining the probability distribution over type vectors selected by nature and the players' behavior strategies, below we investigate the expected payoff of each player in the extensive-form game Φ.
The behavior strategy b i of player i ∈ N \ {1} satisfies the following: ; u i ) is the probability that player i chooses the action . Then we consider subgames Φ(x Γ ), Γ ∈ U 0 . If the behavior strategy vector of players N \ {1} is b −1 = (b 2 , . . . , b n ), and the type vector selected by nature is t ∈T(1), then the action vector u = (u 2 , . . . , u n ) is chosen with the probability where I j(k) = t k for k ∈ N \ {1}. Now consider the conditional probability distribution over the type vectors selected by nature. The expected payoff to Player i ∈ N in subgame Φ(x Γ ) with the chosen vector b −1 can be defined as follows: where p(t −1 |t Moreover, the expected payoff to Player i ∈ N \ {1} of type t i ∈ T in subgame Φ(x Γ ) can be defined since Player i does not know the types of players from the set N \ {1, i}, and it is defined aŝ where The following proposition shows the correlation between the expected payoffsĒ i where p(t i |t Then we may simplify the following equation as Consequently, the following relationship is obtained: Finally, we define the expected payoff to any player in the extensive-form game Φ. Below we consider only Player 1's behavior strategies under which a certain element from the set U 0 is chosen with probability 1 that is b 1 (X 1 ) = (0, . . . , 1, . . . , 0).
Given behavior strategy profile b = (b 1 , . . . , b n ), the expected payoff to Player i ∈ N in game Φ is defined as

Main Results
As the two-stage game is represented in an extensive form, in every subgame Φ(x Γ ), Γ ∈ U 0 , each type t i ∈ T corresponds to the information set X (Γ,j) i , I j = t i . Since there are various types for each player, below we consider the Bayesian equilibrium which provides the actions for players of different types. Definition 1. Behavior strategy vectorb Γ −1 of players from N \ {1}, is the Bayesian equilibrium in subgame Φ(x Γ ), Γ ∈ U 0 , if for any player i ∈ N \ {1}, any type t i ∈ T, and any possible action u i ∈ A the following inequality holds: Proposition 2. Every subgame Φ(x Γ ), Γ ∈ U 0 of the extensive-form game Φ on tree graph Z admits the Bayesian equilibrium.
Proof. It follows from [24], in which it is stated stating that every game with the incomplete information in which the set of types is finite and the set of actions of each type is finite has the Bayesian equilibrium (in behavior strategies). Indeed, in each subgame Φ(x Γ ) of game Φ, every player does not know the payoffs of other players except the leader's payoff since he knows only the leader's type and his own type chosen by nature. Thus, the game is of incomplete information. Moreover, the leader has a unique type, other players possess a finite number of types, and for any player of any type the set of actions, A, is finite. Above all, at least one Bayesian equilibriumb Γ −1 can be found in each subgame Φ(x Γ ), Γ ∈ U 0 .
As the existence of the Bayesian equilibrium in each subgame is proved in Proposition 2, we investigate the connection between the Nash equilibrium and the Bayesian equilibrium in any subgame of the extensive-form game Φ.

Proof.
We prove it based on [25] that in a game with the incomplete information in which the number of each player's types is finite, each Bayesian equilibrium is also the Nash equilibrium, and conversely every Nash equilibrium is also a Bayesian equilibrium. Each subgame Φ(x Γ ) is of incomplete information since players N \ {1} do not know the exact payoffs of others, and T, the common set of types for each player is also finite. Thus, we can directly get the result.
Combining the results from Proposition 2 and Proposition 3, we can get Theorem 1 below. Theorem 1. Every subgame Φ(x Γ ), Γ ∈ U 0 , of the extensive-form game Φ on tree graph Z admits the Nash equilibrium.
Obtaining the Bayesian equilibrium (if there are many Bayesian equilibria, then we can choose one randomly) in each subgame, we can get the strategy profile of players N \ {1} in the extensive-form game. Below, we propose a new concept of the stable partially Bayesian equilibrium for game Φ taking into account the leader's strategy.

Definition 3.
Behavior strategy profile b * = (b * 1 , . . . , b * n ), where network Γ * ∈ U 0 is chosen with probability 1 under b * 1 , is called the stable partially Bayesian equilibrium in game Φ if the following two conditions are satisfied:
for any strategy b 1 of the leader (Player 1).

Theorem 2.
There exists the stable partially Bayesian equilibrium in the extensive-form game Φ.
Proof. By Proposition 2, at least one vector (b * ) −1 can be found such that (b * ) Γ −1 is the Bayesian equilibrium in subgame Φ(x Γ ) for any Γ ∈ U 0 . Let b * 1 be the behavior strategy of Then the strategy profile b * constructed above satisfies both conditions in Definition 3, thus it is the stable partially Bayesian equilibrium in the extensive-form game Φ.

Remark 3.
We call the equilibrium concept as the stable partially Bayesian equilibrium to highlight that in any subgame starting from stage 2, the equilibrium concept is the Bayesian equilibrium and the expected payoff of the leader is larger when he chooses strategy b * 1 rather than any other strategy b 1 . In addition, the set of all stable partially Bayesian equilibria in game Φ is denoted by SPBE. The theorem below shows the connection between the stable partially Bayesian equilibrium and the Nash equilibrium in the extensive-form game Φ. Theorem 3. Each stable partially Bayesian equilibrium is also the Nash equilibrium in the extensive-form game Φ, and the converse is not necessarily true.
Proof. Letb be the stable partially Bayesian equilibrium in game Φ, and Γ * is chosen with probability 1 underb 1 . Then by condition 2 of Definition 3, we know that for Player 1, and any strategy b 1 , Then for any player i ∈ N \ {1}, first consider any strategy b i such that b Γ * i =b Γ * i , and we obtain that Then consider any strategy b i such that b Γ * i =b Γ * i , and from Proposition 3 we have Above all, for any player i ∈ N and any strategy b i , the inequality holds. Therefore,b is also the Nash equilibrium in game Φ. Conversely, letb be the Nash equilibrium in game Φ, while it cannot be guaranteed thatb Γ −1 is the Bayesian equilibrium in subgame Φ(x Γ ) for any Γ ∈ U 0 . Thus, the converse is not necessarily true.

Three-Player Game with Major Player
Below we investigate a three-player game with a major player where the major player (Player 1) differs from other players, and other players are supposed to be identical, that indicates that conditions: are satisfied. Following [26], the characteristic function in the game is defined in the following form: where α and β are positive constants. The possible interpretation of the characteristic function (13) is shown further. Player 1 can be the leader and he/she gets funding for the project. Without Player 1, coalition S can obtain nothing. As other players are identical, their contributions into any coalition are equal. In addition, if Player 1 belongs to coalition S, the productivity or payoff of any Player 2 or 3 is measured by α > 0, and the productivity β > 0 of the leader, Player 1, is divided by the number of coalition members. Thus, Player 1's productivity decreases over the size of coalition S. If we assume the productivity of the leader is larger than the one of other players, we may set α < β that has been supposed in [26], but we will not use this condition in the calculations.
The set of network structures which can be proposed by the leader is 13, 23} shown in Figure 1. We assume the player can be of two types. The payoff function for Player i of type I 1 is defined as where Y i (Γ) is a component of the Myerson value [17], and for Player i of type I 2 , it is defined as where ES i (Γ) is the component of the ES value [27] for Player i in game (N, v Γ ). We assume type I 1 for the leader. The following two propositions characterize the features of the network structures formed under the stable partially Bayesian equilibria in the game above for the case where the probability distribution of the chance move is uniform.

Proposition 4.
When α > β 2 and the probability distribution over the set of type vectors is uniform, then the set of networks formed in SPBE is {Γ 1 , Γ 4 }.
Proof. For each subgame x Γ , Γ ∈ U 0 in the extensive-form game, the corresponding strategic form is shown in Tables 1-4, in which the payoff vector is the expected payoffs to Players 2 and 3 for the corresponding situation in the subgame when the distribution of the chance move is uniform. Please note that under strategy (a, r), Player i of type I 1 chooses the action 'a', and Player i of type I 2 chooses the action 'r'. In Tables 1-4, Player 2 chooses the rows, and Player 3 chooses the columns.
; a = 1, i = 2, 3, j = 1, 2, is the unique Bayesian equilibrium in subgame x Γ for any Γ ∈ U 0 . The inequality where network Γ k is chosen with probability 1 under the leader's strategy b k 1 . Summarizing we obtain that strategy profiles (b 1 1 ,b 2 ,b 3 ) and (b 4 1 ,b 2 ,b 3 ) form the set of all stable partially Bayesian equilibria in the extensive-form game, under which only networks Γ 1 and Γ 4 can be formed.

Proposition 5.
When α < β 6 and the probability distribution over the set of type vectors is uniform, the empty network is a unique network that can be formed under the stable partially Bayesian equilibria.
Proof. When α < β 6 , strategy (r, r) Player i, i = 2, 3 strictly dominates strategies (a, a), (r, a) and (a, r) in each game defined in Tables 1-4. Thus, strategy profile (r, r), (r, r) is the unique Nash equilibrium in each game. Then by Proposition 3, we can obtain that profile ; r = 1, i = 2, 3, j = 1, 2, is the unique Bayesian equilibrium in subgame x Γ for any Γ ∈ U 0 . Therefore, for k = 1, . . . , 4, where network Γ k is chosen with probability 1 under strategy b k 1 . Summarizing we obtain that when α < β 6 , any strategy profile (b k 1 ,b 2 ,b 3 ), k = 1, . . . , 4 is the stable partially Bayesian equilibrium in the extensive-form game, under which only the empty network can be formed.

Special n-Player Game
We introduce an n-player game with the characteristic function defined in the following way: where k is a positive constant, s = |S|, n = |N|. The set of network structures which can be proposed by the leader as the joint projects is 13, . . . , 1n}, the star network with the leader, say Player 1, being in the central position, and Γ 2 = {ij | i, j ∈ N, i = j}, the complete network of set N. In addition, there are two types for each player: types I 1 and I 2 . The payoff function for Player i of type I 1 is defined as where Y i (Γ) is the component of the Myerson value, and for Player i of type I 2 , it is defined as where ES i (Γ) is the component of the ES value for Player i in game (N, v Γ ).
The following theorems characterize the features of the network structures formed under the stable partially Bayesian equilibria. Proposition 6. When for any player i ∈ N and any network Γ, θ i (Γ, I 1 ) = 0, then independently of the leader's type, there exist at least three stable partially Bayesian equilibria in the extensive-form game regardless of the probability distribution of the chance move.
Proof. First note that the proof below is conducted assuming the type for the leader is I 1 skipping the case of type I 2 to save the space for which the proof is similar. For any player i ∈ N \ {1}, consider strategyb i such thatb i (X (Γ,j) i ; r) = 1 for Γ ∈ {Γ 1 , Γ 2 } and j = 1, 2. Consider the truncation of strategyb i to subgame x Γ 1 , and the calculations show that for player i ∈ N \ {1} and networkΓ = {1i} which is formed when only player i accepts network Γ 1 or Γ 2 , we obtain expressions: then for any Γ ∈ {Γ 1 , Γ 2 } and any strategy b Γ i of Player i, we havē which indicates that strategy profile (b Γ 2 , . . . ,b Γ n ) is the Bayesian equilibrium in subgame x Γ , Γ ∈ {Γ 1 , Γ 2 }. Therefore, regardless of the leader's type, we get where networks Γ 1 and Γ 2 are chosen with probability 1 respectively under strategies b 1 1 and b 2 1 . By Definition 3, we conclude that both strategy profiles (b 1 1 ,b 2 , . . . ,b n ) and (b 2 1 ,b 2 , . . . ,b n ) are the stable partially Bayesian equilibria in the extensive-form game. Next for Player i ∈ N \ {1}, we consider another strategyb i such thatb i (X ; r) = 1 for j = 1, 2. From the proof above, it follows that strategy profile As a result, While in networkΓ 1 = Γ 1 \ {1i} which is formed when only player i rejects joining network Γ 1 , we have Therefore, for any strategy b which shows thatb Γ 1 −1 is the Bayesian equilibrium in subgame x Γ 1 , no matter which type is defined for the leader, By Definition 3, we obtain that strategy profile (b 2 1 ,b 2 , . . . ,b n ) is also the stable partially Bayesian equilibrium in the extensive-form game.
In conclusion, given any probability distribution of the chance move, strategy profiles (b 1 1 ,b 2 , . . . ,b n ), (b 2 1 ,b 2 , . . . ,b n ) and (b 2 1 ,b 2 , . . . ,b n ) are all stable partially Bayesian equilibria in the extensive-form game no matter which type is defined for the leader.

Proposition 7.
When θ i (Γ, I 1 ) = 0 is satisfied for any player i ∈ N and any network Γ, there are two cases: 1.
If the leader's type is I 1 , then, regardless of the probability distribution of the chance move, the empty network ∅ can be realized under SPBE; 2.
If the leader's type is I 2 , then, whatever the probability distribution over the set of type vectors is given, networks Γ 1 and ∅ can be realized under SPBE.
Proof. 1. From Proposition 6, we know that if the leader's type is I 1 (or I 2 ), then strategy profiles (b 1 1 ,b 2 , . . . ,b n ), (b 2 1 ,b 2 , . . . ,b n ) and (b 2 1 ,b 2 , . . . ,b n ) are all stable partially Bayesian equilibria in the extensive-form game regardless of the probability distribution by the chance move. In addition, under any of the three equilibria, the empty network can be formed.
2. For the empty network, the result can be obtained similarly to Item 1. Then for network Γ 1 consider strategy profile (b 1 1 ,b 2 , . . . ,b n ), when the type for the leader is I 2 , so we have Thus, profile (b 1 1 ,b 2 , . . . ,b n ) is the stable partially Bayesian equilibrium in the game, under which network Γ 1 is formed.
Then we turn to set θ i (Γ, I 1 ) = n i (Γ)/(n − 1), where n i (Γ) is the number of neighbors of Player i in network Γ. Table 5 below summaries the resulting networks (the last column in Table 5) which can be formed under the stable partially Bayesian equilibria by different conditions for any given probability distribution of the chance move. Table 5. Summary of the results with θ i (Γ, I 1 ) = n i (Γ)/(n − 1).

Conclusions
We propose a model of the network formation when players are non-symmetric in their payoff functions or types. The players' types are the private information. First, one player is assigned to be the leader and he proposes a network to be formed to other players. Second, other players make decisions to accept or reject the network simultaneously. After that, the network is formed by the given rule. We prove the existence of an equilibrium called the stable partially Bayesian equilibrium in the network formation game with the incomplete information about players' types. We examine the relation between the equilibrium and the Nash equilibrium. The three-player game with a major player with the specific characteristic function is considered to be an example of our model. We also examine an n-player game with the particular characteristic function and two projects, the star network and the complete network are investigated if they can be formed under the stable partially Bayesian equilibria. As a direction for future research, we mention an interesting problem of defining the steady network which can be formed with the positive probability as a result of the stable partially Bayesian equilibrium regardless of the appointed leader.

Funding:
The work of the second author was supported by the Russian Science Foundation (grant no. 17-11-01079).