Efficient networks in games with local complementarities
研究规划者在代理进行局部互补性博弈且链接有成本时寻找有效网络的问题，发现有效网络属于嵌套分割图类，并取决于成本函数的具体形式。
We address the problem of a planner looking for the efficient network when agents play a network game with local complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of Nested-Split Graphs. Next, we refine our results and find that, depending on the specification of the network cost function, complete networks, core-periphery networks, dominant group architectures, quasi-star and quasi-complete networks can be efficient.