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 study collective choice via an endogenous agenda setting process. At each stage, a status quo is implemented unless it is replaced by a majority (winning coalition) with a new status quo outcome. The process continues until the prevailing status quo is no longer challenged. We impose a...

We study the existence of undominated elements of acyclic and irreflexive relations. A sufficient condition for the existence is given in the general case without any topological assumptions. Sufficient conditions are also given when the relation in question is defined on a compact Hausdorff...

We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one...