We consider a Sender-Receiver game in which the Sender can choose between sending a cheap-talk message, which is costless, but also not verified and a costly verified message. While the Sender knows the true state of the world, the Receiver does not have this information, but has to choose an...

We consider a Sender-Receiver game in which the Sender can choose between sending a cheap-talk message, which is costless, but also not verified and a costly verified message. While the Sender knows the true state of the world, the Receiver does not have this information, but has to choose an...

In this paper we extend the basic model of Cournot competition to the case where both the demand function and the cost functions of each firm depend on the amounts produced by competitors. In this modified setting, proving existence of equilibria becomes harder. We develop a generalization of...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

This paper studies the properties of convexity (concavity) and strategic complements (substitutes) in network formation and the implications for the structure of pairwise stable networks. First, different definitions of convexity (concavity) in own links from the literature are put into the...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...