A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

In an individual experimentation problem a decision maker learns only from his own experience. It is well known that an optimal experimentation strategy for such problems sometimes results in the best alternative being dropped altogether, which is the so-called “Rothschild effect.” Many...

This paper shows that in private value environments, strategy-proofness and the rectangular property are necessary conditions for (full) robust implementation (Bergemann and Morris, 2011). As corollaries, we obtain the equivalence between robust and secure implementation (Saijo et al., 2007),...

We consider the problem of adjudicating conflicting claims, and characterize the family of rules satisfying four standard invariance requirements, homogeneity, two composition properties, and consistency. It takes as point of departure the characterization of the family of two-claimant rules...

Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (“online correlation”). In this paper we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose...

In repeated games, subgame perfection requires all continuation strategy profiles must be effective to enforce the equilibrium; they serve as punishments should deviations occur. It does not require whether a punishment can be justified for the deviation, which creates a great deal of freedom in...

In many economic contexts, an elusive variable of interest is the agent's belief about relevant events, e.g. about other agents' behavior. A growing number of surveys and experiments asks participants to state beliefs explicitly but little is known about the causal relation between beliefs and...

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 show that in multi-sender communication games where senders imperfectly observe the state, if the state space is large enough, then there can exist equilibria arbitrarily close to full revelation of the state as the noise in the senders' observations gets small. In the case of replacement...

We extend the result from Bossert and Sprumont (2013) that every single-valued choice function is backwards-induction rationalizable via strict preferences to the case of choice correspondences via weak preferences.