We study the endogenous network formation of bilateral and multilateral trade agreements by means of hypergraphs and introduce the equilibrium concept of multilateral stability. We consider multi-country settings with a firm in each country that produces a homogeneous good and competes as a...

This paper studies a noncooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An \textit{underlying state} determines payoffs from different actions. Agents decide which others to form a costly \textit{communication link} with,...

The paper discusses community enforcement in infinitely repeated, two-action games with local interaction and uncertain monitoring. Each player interacts with and observes only a fixed set of opponents, of whom he is privately informed. The main result shows that when beliefs about the...

This paper develops a simple model in which a social hierarchy emerges endogenously when agents form a network for complementary interaction (``activity''). Specifically, we assume that agents are ex ante identical and their best response activity, as well as their value function, increases...

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...

We provide a model that allows for a transition between the simplest variation of two basic models of strategic network formation: Bala and Goyal's one-way flow model without decay, where links can be unilaterally formed, and a version without decay of Jackson and Wolinsky's connections model...

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller pieces, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of summarizing complex strategic...

Bi and branching networks are two classes of minimal networks often found in the literatures of two-way flow Strict Nash networks. Why so? In this paper, we answer this question by establishing a generalized condition that holds together many models in the literature, and then show that this...