We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into convex categories. We give a full characterization of...

Two individuals are involved in a conflict situation in which preferences are ex ante uncertain. While they eventually learn their own preferences, they have to pay a small cost if they want to learn their opponent's preferences. We show that, for sufficiently small positive costs of information...

We examine multistage information transmission with voluntary monetary transfer in the framework of Crawford and Sobel (1982). In our model, an informed expert can send messages to an uninformed decision maker more than once, and the uninformed decision maker can pay money to the informed expert...

We analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of...

It is shown that the n-player lottery contest admits a best-response potential (Voorneveld, 2000, Economics Letters). This is true also when the contest technology reflects the possibility of a draw. The result implies, in particular, the existence of a non-trivial two-player zero-sum game that...

We consider network games in which players simultaneously form partnerships and choose actions. Players are heterogeneous with respect to their action preferences. We characterize pairwise Nash equilibria for a large class of games, including coordination and anti-coordination games, varying the...

It is shown that the n-player lottery contest admits a best-response potential (Voorneveld, 2000, Economics Letters). This is true also when the contest technology reflects the possibility of a draw. The result implies, in particular, the existence of a nontrivial example of a strictly...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

Payoff security combined with reciprocal upper semicontinuity is sufficient for better-reply security, and consequently for the existence of a pure strategy Nash equilibrium in compact, quasiconcave games by Reny's (1999) theorem. Analogously, diagonal payoff security combined with upper...

As pointed out by Sion and Wolfe (1957), a non-cooperative game on the unit square need not admit a Nash equilibrium, neither in pure nor in randomized strategies. In this paper, we consider finite approximations of the Sion-Wolfe game. For all parameter constellations relevant for the limit...