We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

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

Theoretical models on network formation focus mostly on the stability and efficiency of equilibria, but they cannot deliver an understanding of why specific equilibrium networks are selected or whether they are all actually reachable from any starting network. To study factors affecting...

In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of...

This paper proposes a tractable model that allows us to analyze how agents' perception of relationships with others determines the structures of networks. In our model, agents are endowed with their own multidimensional characteristics and their payoffs depend on the social distance between...

We study network formation with n players and link cost α 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player ν incorporates the expected number of players to which ν will become disconnected. We focus on...

We consider the dynamic network formation problem under the requirement that the whole network be connected and remain connected after q nodes are destroyed. We propose the concept of dynamic Cq-stability and characterize dynamic Cq-stable networks for any q≥0. Comparison with the outcome in...

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

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs....