On the Structure of Equilibria in Basic Network Formation

We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest path distances to the other nodes, we use the probabilistic method to provide a new, structural characterization of equilibrium graphs. We show how to use this characterization in order to prove upper bounds on the diameter of equilibrium graphs in terms of the size of the largest $k$-vicinity (defined as the the set of vertices within distance $k$ from a vertex), for any $k \geq 1$ and in terms of the number of edges, thus settling positively a conjecture of Alon et al. in the cases of graphs of large $k$-vicinity size (including graphs of large maximum degree) and of graphs which are dense enough. Next, we present a new swap-based network creation game, in which selfish costs depend on the immediate neighborhood of each node; in particular, the profit of a node is defined as the sum of the degrees of its neighbors. We prove that, in contrast to the previous model, this network creation game admits an exact potential, and also that any equilibrium graph contains an induced star. The existence of the potential function is exploited in order to show that an equilibrium can be reached in expected polynomial time even in the case where nodes can only acquire limited knowledge concerning non-neighboring nodes.Comment: 11 pages, 4 figure

Media, Aggregators, and the Link Economy: Strategic Hyperlink Formation in Content Networks

A defining property of the World Wide Web is a content site's ability to place virtually costless hyperlinks to third-party content as a substitute or complement to its own content. Costless hyperlinking has enabled new types of players, usually referred to as content aggregators, to successfully enter content ecosystems, attracting traffic and revenue by hosting links to the content of others. This, in turn, has sparked a heated controversy between content creators and aggregators regarding the legitimacy and costs/benefits of uninhibited free linking. To our knowledge, this work is the first to model the complex interplay between content and links in settings where a set of sites compete for traffic. We develop a series of analytical models that distill how hyperlinking affects the (a) incentives of content nodes to produce quality content versus link to third-party content, (b) profits of the various stakeholders, (c) average quality of content that becomes available to consumers, and (d) impact of content aggregators. Our results provide a nuanced view of the so-called link economy, highlighting both the beneficial consequences and the drawbacks of free hyperlinks for content creators and consumers.This paper was accepted by Lorin Hitt, information systems

On a Bounded Budget Network Creation Game

We consider a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In our model, each link has unit price and each agent tries to minimize its cost, which is either its local diameter or its total distance to other players in the (undirected) underlying graph of the created network. Two versions of the game are studied: in the MAX version, the cost incurred to a vertex is the maximum distance between the vertex and other vertices, and in the SUM version, the cost incurred to a vertex is the sum of distances between the vertex and other vertices. We prove that in both versions pure Nash equilibria exist, but the problem of finding the best response of a vertex is NP-hard. We take the social cost of the created network to be its diameter, and next we study the maximum possible diameter of an equilibrium graph with n vertices in various cases. When the sum of players' budgets is n-1, the equilibrium graphs are always trees, and we prove that their maximum diameter is Theta(n) and Theta(log n) in MAX and SUM versions, respectively. When each vertex has unit budget (i.e. can establish link to just one vertex), the diameter of any equilibrium graph in either version is Theta(1). We give examples of equilibrium graphs in the MAX version, such that all vertices have positive budgets and yet the diameter is Omega(sqrt(log n)). This interesting (and perhaps counter-intuitive) result shows that increasing the budgets may increase the diameter of equilibrium graphs and hence deteriorate the network structure. Then we prove that every equilibrium graph in the SUM version has diameter 2^O(sqrt(log n)). Finally, we show that if the budget of each player is at least k, then every equilibrium graph in the SUM version is k-connected or has diameter smaller than 4.Comment: 28 pages, 3 figures, preliminary version appeared in SPAA'1

HedN Game, a Relational Framework for Network Based Cooperation

This paper proposes a new framework for cooperative games based on mathematical relations. Here cooperation is defined as a supportive partnerships represented by a directed network between players (aka hedonic relation). We examine in a specific context, modeled by abstract games how a change of supports induces a modification of strategic interactions between players. Two levels of description are considered: the first one describes the support network formation whereas the second one models the strategic interactions between players. Both are described in a unified formalism, namely CP~game. Stability conditions are stated, emphasizing the connection between these two levels. We also stress the interaction between updates of supports and their impact on the evolution of the context.Cooperative Game, Network, Stability, Hedonic Relation

Stability and Equilibrium Selection in a Link Formation Game

In this paper we use a non cooperative equilibrium selection approach as a notion of stability in link formation games. Specifically, we follow the global games approach first introduced by Carlsson and van Damme (1993), to study the robustness of the set of Nash equilibria for a class of link formation games in strategic form with supermodular payoff functions. Interestingly, the equilibrium selected is in conflict with those predicted by the traditional cooperative refinements. Moreover, we get a conflict between stability and efficiency even when no such conflict exists with the cooperative refinements. We discuss some practical issues that these different theoretical approaches raise in reality. The paper also provides an extension of the global game theory that can be applied beyond network literature.Global Games, Equilibrium Selection, Networks.

Global Games with Strategic Substitutes

In this paper we use a non cooperative equilibrium selection approach as a notion of stability in link formation games. Specifically, we follow the global games approach first introduced by Carlsson and van Damme (1993), to study the robustness of the set of Nash equilibria for a class of link formation games in strategic form with supermodular payo. functions. Interestingly, the equilibrium selected is in conflict with those predicted by the traditional cooperative refinements. Moreover, we get a conflict between stability and e.ciency even when no such conflict exists with the cooperative refinements. We discuss some practical issues that these di.erent theoretical approaches raise in reality. The paper also provides an extension of the global game theory that can be applied beyond network literature.Games, Networks, Equilibrium Selection.

Social Network Formation with Consent

We investigate the equilibria of game theoretic models of network formation that are based on individual actions only.Our approach is grounded in three simple and realistic principles: (1) Link formation should be a binary process of consent.(2) Link formation should be costly.(3) The class of network payoff functions should be as general as possible.It is accepted that these consent models have a very large number of equilibria.However, until now no characterization of these equilibria has been established in the literature.We aim to fill this void and provide characterizations of stable networks or the cases of two-sided and one-sided link formation costs.Furthermore, we provide a comparison of Nash equilibria with potential maximizers for a certain specification.game theory;general equilibrium

Network Formation and Social Coordination

This paper develops a simple model to examine the interaction between partner choice and individual behavior in games of coordination. An important ingredient of our approach is the way we model partner choice: we suppose that a player can establish ties with other players by unilaterally investing in costly pair-wise links. In this context, individual efforts to balance the costs and benefits of links are shown to lead to a unique equilibrium interaction architecture. The dynamics of network formation, however, has powerful effects on individual behavior: if costs of forming links are below a certain threshold then players coordinate on the risk-dominant action, while if costs are above this threshold then they coordinate on the efficient action. These findings are robust to a variety of modifications in the link formation process. For example, it may be posited that, in order for a link to materialize, the link proposal must be two-sided (i.e. put forward by both agents); or that, in case of a unilateral proposal, the link may be refused by the other party (if, say, the latter's net payoff is negative); or that a pair of agents can play the game even if connected only through indirect links.Networks, Links, Coordination games, Equilibrium selection, Risk dominance, Efficiency