We study a Baron-Ferejohn (1989) type of bargaining model to which we append an investment stage. As long as no agreement is reached, a new proposer is selected randomly from the player set. A proposal is accepted if at least q players accept it. Prior to the bargaining stage, players may make...

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 repeated prize allocation problem when the discount factors f the agents are not equal. It is shown that the feasible set of payoffs is not well behaved. In particular, it is not convex as it contains holes and caves. The Pareto frontier is everywhere discontinuous and there is an open...

We study infinitely repeated Prisoners' Dilemma, where one of the players may be demented. If a player gets demented in period t after his choice of action, he is stuck to this choice for the rest of the game. So if his last choice was ``cooperate'' just before dementia struck him, then he's...

We study the existence of pure strategy Nash equilibria in finite congestion and coordination games. Player set is divided into two disjoint groups, called men and women. A man choosing an action a is better off if the number of other men choosing a decreases, or if the number of women choosing...

We study non-cooperative link formation games in which players have to decide how much to invest in relationships with other players. A link between two players is formed, if and only if both make a positive investment. The cost of forming a link can be interpreted as the opportunity cost of...

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 information aggregation problems where to a set of measures a single measure of the same dimension is associated. 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....