Some solution concepts for n -person games admit a recursive definition. In such a recursion, the solution of an n -person game is computed by using the knowledge of how some of the proper subgames of a given game have been solved. While these kind of recursion formulas are of course...

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

We investigate a random proposer bargaining game with a dead line. A bounded time interval is divided into bargaining periods of equal length and we study the limit of the subgame perfect equilibrium outcome as the number of bargaining periods goes to infinity while the dead line is kept fixed....

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