We study coalitional one-deviation principle in a framework a la Chwe (1994). The principle requires that an active coalition or any of its subcoalition will not benefit from a single deviation to a strategy that specifies, for each history of coalitional moves, an active coalition and its move....

We study auction design when parties cannot commit to the mechanism. The seller may change the rules of the game any number of times and the buyers may choose their outside option at any stage of the game. A dynamic consistency condition and an optimality condition property are defined to...

We study the existence of pure strategy Markov perfect equilibria in two-person perfect information games. There is a state space X and each period player's possible actions are a subset of X. This set of feasible actions depends on the current state, which is determined by the choice of the...

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 relations. A sufficient condition for the existence is given without any topological assumptions when the dominance relation is finite valued. The condition says that there is a point such that all dominance sequences starting from this...

We study coalition formation processes of Konishi and Ray (2003) [27]. It is shown that an absorbing and deterministic process of coalition formation that also forms an equilibrium - satisfies a coalitional one-deviation property - does exist if one allows the process to be history dependent....

We study repeated prize allocation when the discount factors of the agents are unequal. The feasible set of payoffs behaves badly: the Pareto frontier is everywhere discontinuous and there is an open subset of (high) discount factors under which the feasible set is totally disconnected.

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