This paper provides an explicit characterization of correlations that are implicitly captured by partition models for incomplete information games. The main result of this paper shows that every partition model for incomplete information can be decomposed into the conjunctions of a unique...

Congestion games are multi-player games in which players' costs are additive over a set of resources that have anonymous cost functions, with pure strategies corresponding to certain subsets of resources. In a splittable congestion game, each player can choose a convex combination of subsets of...

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

This paper analyzes the private provision of public goods where consumers interact within a fixed network structure and may benefit only from their direct neighbors' provisions. We present a proof of the existence and uniqueness of a Nash equilibrium for general networks and best-reply...

We consider a two-player Prisoner's Dilemma type game with continuous actions, where players choose how much to contribute to a public project. This game is played infinitely many times and actions are irreversible: players cannot decrease their actions over time. While it is strictly dominant...

This paper provides a flexible strategic framework to analyze bargaining and values in environments with coalitional externalities. Within this framework we propose a new value that extends the Shapley value to partition function form games, the so-called Rational Belief Shapley (RBS) value. We...

In a setting where an infinite population of players interact locally and repeatedly, we study the impacts of payoff structures and network structures on contagion of a convention beyond 2×2 coordination games. First, we consider the “bilingual game”, where each player chooses one of two...

This paper considers general games in which multiple informed principals simultaneously compete to influence the decisions of a common agent. It shows that we can characterize all outcomes of any game in which principals delegate the final decisions to the agent using arbitrary mechanisms, by...

Bayesian Nash equilibria that fail to be hindsight-(or, alternatively, ex-post) stable do not provide reliable predictions of outcomes of games in many applications. We characterize a family of large Bayesian games (with many players) in which all equilibria are asymptotically hindsight-stable,...

We consider a sequential decision problem where the decision maker is informed of the actual payoff with delay. We introduce a new condition, which generalizes the condition given by Blackwell and ensures that the decision maker can approach a fixed closed and convex set under delay. We show how...