We investigate how information goods are priced and diffused over links in a network. A new equivalence relation between nodes captures the effects of network architecture and locations of sellers on the division of profits, and characterizes the topology of competing (and potentially...

I develop a theory of intermediation in a market where agents meet bilaterally to trade and buyers cannot commit to payments. Some agents observe the past trading history of traders in the market. These informed agents can secure trades by punishing traders who previously defaulted. The...

The paper proposes a game of weighted network formation in which each agent has a limited resource to form links of possibly different intensities with other agents and to use for private purposes. We show that every equilibrium is either "reciprocal" or "non-reciprocal". In a reciprocal...

In a general model of trading networks with bilateral contracts, we propose a suitably adapted chain stability concept that plays the same role as pairwise stability in two-sided settings. We show that chain stability is equivalent to stability if all agents' preferences are jointly fully...

We analyze boundedly rational learning in social networks within binary action environments. We establish how learning outcomes depend on the environment (i.e., informational structure, utility function), the axioms imposed on the updating behavior, and the network structure. In particular, we...

We study a sequential-learning model featuring a network of naive agents with Gaussian information structures. Agents apply a heuristic rule to aggregate predecessors' actions. They weigh these actions according the strengths of their social connections to different predecessors. We show this...

This paper analyzes the formation of networks in which each agent is assumed to possess some information of value to the other agents in the network. Agents derive payoff from having access to the information of others through communication or spillovers via the links between them. Linking...

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 study the information flows that arise among a set of agents with local knowledge and directed payoff interactions, which differ among pairs of agents. First, we study the equilibrium of a game where, before making decisions, agents can invest in pairwise active communication (speaking) and...

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