The Architecture of Strict Nash Networks of Network Formation Games with One-Way Flow Inside and Two-Way Flow Outside

We make some preliminary study on the architecture of strict Nash networks of non-complete cooperative mixed-flow network formation games for the first time. In these networks, the way of information exchange between agents within the same coalition is one-way flow; otherwise, it is two-way flow. The costs of forming links within the coalition are lower as compared to costs of forming links across the coalitions. Agents within the same coalition first form efficient networks, on non-complete cooperative mixed-flow network formation games for the first time. In these networks, the way of information exchange between agents within the same coalition is one-way flow; otherwise, it is two-way flow. The costs of forming links within the coalition are lower as compared to costs of forming links across the coalitions. Agents within the same coalition first form efficient networks, on this basis, we study the architecture of strict Nash networks of mixed-flow models with decay and without decay respectively.