We show that in quasisupermodular games that satisfy strict single crossing property the least and greatest undominated Nash-equilibrium can be reached by iteratively eliminating dominated strategies. In the first round all weakly dominated strategies are eliminated. In the successive rounds all...

In this paper we study the number of pure strategy Nash equilibria in large finite n-player games. A distinguishing feature of our study is that we allow general - potentially multivalued - best reply correspondences. Given the number K of pure strategies to each player, we assign to each player...

We construct a centralised market where agents can trade voting rights. Text book markets do not work but the situation is strategic, and there are many equilibria. In an equilibrium where trading takes place the minimum efficiency gain, i.e. the probability with which an efficient outcome is...

In 1980 three Finnish companies established a research joint venture as a separate firm in order to develop semiconductors. This enterprise terminated in 1992 when the firm was sold. We study the RJV from the point of view of incomplete contacts, focusing on hold-up problems. Of particular...

We study information aggregation problems where to a set of measures a single measure of the same dimension is assigned. The collection of measures could represent the beliefs of agents about the state of the world, and the aggregate would then represent the beliefs of the population. Individual...