Search

We examine the coalition-proof equilibria of a participation game in the provision of a (pure) public good. We study which Nash equilibria are achieved through cooperation, and we investigate coalition-proof equilibria under strict and weak domination. We show that under some incentive condition, (i) a profile of strategies is a coalition-proof equilibrium under strict domination if and only if it is a Nash equilibrium that is not strictly Pareto-dominated by any other Nash equilibrium and (ii) every strict Nash equilibrium for non-participants is a coalition-proof equilibrium under weak domination. [ABSTRACT FROM AUTHOR]

This article examines individual incentives to produce information on communication networks. In our setting, efforts are strategic complements along communication paths with convex decay. We analyze the relationship between efforts and centrality on a set of networks which are unambiguous in terms of ordinal centrality. We first show that in both dominant and dominated equilibria central agents exert more effort. Second, we explore the issue of social coordination induced by our game. [ABSTRACT FROM AUTHOR]

Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and sufficient conditions on the network link marginal payoffs such that the set of pairwise stable, pairwise-Nash and proper equilibrium networks coincide, where pairwise stable networks are robust to one-link deviations, while pairwise-Nash networks are robust to one-link creation but multi-link severance. Under these conditions, proper equilibria in pure strategies are fully characterized by one-link deviation checks. [ABSTRACT FROM AUTHOR]

We demonstrate that, if there are sufficiently many players, any Bayesian equilibrium of an incomplete information game can be “ ε-purified” . That is, close to any Bayesian equilibrium there is an approximate Bayesian equilibrium in pure strategies. Our main contribution is obtaining this result for games with a countable set of pure strategies. In order to do so we derive a mathematical result, in the spirit of the Shapley–Folkman Theorem, permitting countable strategy sets. Our main assumption is a “large game property,” dictating that the actions of relatively small subsets of players cannot have large affects on the payoffs of other players. [ABSTRACT FROM AUTHOR]