We introduce a framework for modeling pairwise interactive beliefs and provide an epistemic foundation for Nash equilibrium in terms of pairwise epistemic conditions locally imposed on only some pairs of players. Our main result considerably weakens not only the standard sufficient conditions by...

The best shot game applied to networks is a discrete model of many processes of contribution to local public goods. It generally has a wide multiplicity of equilibria that we refine through stochastic stability. We show that, depending on how we define perturbations – i.e., possible mistakes...

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players...

This paper experimentally analyzes the effect of network structures on individualsʼ decisions in a game of strategic substitutes. The theoretical basis for our experiment is the model of Bramoullé and Kranton (2007). As predicted, we find that individuals are able to coordinate on equilibria,...

We conduct an experiment in continuous time: every subject can change her links to others and her action in a Hawk–Dove game, which she plays bilaterally with each of her linked partners, at any time. We hypothesize that norms exist regarding who establishes and thus pays for links, and that...

We study network games under strategic complementarities. Agents are embedded in a fixed network. They choose a positive, continuous action and interact with their network neighbors. Interactions are positive and actions are bounded from above. We first derive new sufficient conditions for...

We ask how to share the cost of finitely many public goods (items) among users with different needs: some smaller subsets of items are enough to serve the needs of each user, yet the cost of all items must be covered, even if this entails inefficiently paying for redundant items. Typical...

We propose a model of price competition where consumers exogenously differ in the number of prices they compare. Our model can be interpreted either as a non-sequential search model or as a network model of price competition. We show that (i) if consumers who previously just sampled one firm...

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning...

Network formation games capture two conflicting objectives of selfish nodes in a network: such nodes wish to form a well-connected network and, at the same time, to minimize their cost of participation. We consider three families of such models where nodes avoid forming edges beyond those...