We discuss (dis)incentives for fair cooperation related to delegating macroprudential policy decisions to a supranational body, as well as their welfare implications. The question is studied by means of a signaling game of imperfect information between two national regulators. The model...

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...

We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...

The availability of knowledge is an essential factor for an economy in global competition. Companies realise innovations by creating and implementing new knowledge. Sources of innovative ideas are partners in the production network but also new employees coming from another company or academia....

In a recent paper, Jäger, Metzger, and Riedel (2011) study communication games of common interest when signals are simple and types complex. They characterize strict Nash equilibria as so-called Voronoi languages that consist of Voronoi tesselations of the type set and Bayesian estimators on...

This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies.

A product set of pure strategies is a prep set (prep is short for preparation) if it contains at least one best reply to any consistent belief that a player may have about the strategic behavior of his opponents. Minimal prep sets are shown to exists in a class of strategic games satisfying...

The issue of the order-dependence of iterative deletion processes is well-known in the game theory community, and meanwhile conditions on the dominance concept underlying these processes have been detected which ensure order-independence (see e.g. the criteria of Gilboa et al., 1990 and Apt,...

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The 'TASP' (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We...