Production and Network Formation Games with Content Heterogeneity

Online social networks (e.g. Facebook, Twitter, Youtube) provide a popular, cost-effective and scalable framework for sharing user-generated contents. This paper addresses the intrinsic incentive problems residing in social networks using a game-theoretic model where individual users selfishly trade off the costs of forming links (i.e. whom they interact with) and producing contents personally against the potential rewards from doing so. Departing from the assumption that contents produced by difference users is perfectly substitutable, we explicitly consider heterogeneity in user-generated contents and study how it influences users’ behavior and the structure of social networks. Given content heterogeneity, we rigorously prove that when the population of a social network is sufficiently large, every (strict) non-cooperative equilibrium should consist of either a symmetric network topology where each user produces the same amount of content and has the same degree, or a two-level hierarchical topology with all users belonging to either of the two types: influencers who produce large amounts of contents and subscribers who produce small amounts of contents and get most of their contents from influencers. Meanwhile, the law of the few disappears in such networks. Moreover, we prove that the social optimum is always achieved by networks with symmetric topologies, where the sum of users’ utilities is maximized. To provide users with incentives for producing and mutually sharing the socially optimal amount of contents, a pricing scheme is proposed, with which we show that the social optimum can be achieved as a non-cooperative equilibrium with the pricing of content acquisition and link formation.

💡 Research Summary

The paper develops a game‑theoretic model of online social networks in which each user simultaneously decides how much original content to produce and with whom to form links (subscriptions) to acquire others’ content. Unlike most prior work, the authors abandon the assumption that all users’ contents are perfectly substitutable. Instead, they adopt a public‑goods style utility that captures heterogeneity: a user’s benefit depends not only on the total amount of content consumed but also on the diversity of content types, parameterized by a “diversity exponent” r (0 < r ≤ 1). When r→1 the model collapses to the perfectly substitutable case; smaller r values reflect stronger preferences for varied content.

Formally, each user i chooses a production level x_i ≥ 0 and a set of friends F_i. The perceived amount of content is X_i = (x_i^r + ∑_{j∈F_i} x_j^r)^{1/r}. The benefit is v(X_i), where v(·) is increasing, twice‑differentiable, strictly concave, and satisfies standard saturation conditions. Production incurs a linear cost c x_i, and each undirected link costs a fixed amount g. The utility is
u_i = v(X_i) − c x_i − g |F_i|.

The authors first establish basic equilibrium properties. In any strict Nash equilibrium, no pair of users maintains reciprocal links (otherwise one link is redundant and can be dropped to increase payoff), and every user produces a strictly positive amount of content. The marginal benefit of production equals marginal cost at equilibrium: v′(X_i)·X_i^{1‑r} = c.

The core analytical contribution concerns the structure of equilibria when the population size n becomes large. Under the stated assumptions, the authors prove that any strict equilibrium must be of one of two forms:

1. Symmetric topology – all users choose the same production level x* and have the same degree d*. The network is regular and fully homogeneous.

2. Two‑level hierarchical topology – users split into “influencers” (high production, high degree) and “subscribers” (low production, low degree). Crucially, the fraction of influencers does not vanish as n grows; it remains Θ(1). Hence the classic “law of the few” (a vanishing core) disappears. Moreover, a pure star network can never be an equilibrium under content heterogeneity.

The paper then examines the socially optimal configuration, defined as the profile maximizing total welfare Σ_i u_i. By solving the planner’s problem, the authors show that the welfare‑maximizing network is always a symmetric regular graph. The intuition is that equalizing production and link degrees eliminates wasteful redundancy and fully exploits the diversity benefit.

To bridge the gap between selfish equilibria and the social optimum, the authors propose a simple pricing mechanism. They introduce a per‑unit price p_c for acquiring others’ content and a per‑link price p_g for establishing a friendship. The modified utility becomes
u_i′ = v(X_i) − c x_i − p_c ∑_{j∈F_i} x_j − (p_g + g) |F_i|.
By appropriately choosing (p_c, p_g) – derived from the first‑order conditions of the planner’s problem – the induced Nash equilibrium coincides exactly with the welfare‑maximizing symmetric network. The authors prove existence and uniqueness of such prices and discuss how a platform could implement them (e.g., subscription fees, content‑access charges).

Overall, the paper makes four major contributions: (i) a novel production‑and‑network formation game that explicitly models content heterogeneity; (ii) a rigorous characterization of equilibrium network structures in large populations, showing the disappearance of the “law of the few” and ruling out star topologies; (iii) a proof that the social optimum is always achieved by a symmetric network; and (iv) a pricing scheme that aligns individual incentives with the social optimum. These results provide theoretical guidance for the design of online platforms that wish to encourage diverse content creation while avoiding excessive concentration of influence.