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

We study non-cooperative link formation games in which players have to decide how much to invest in relationships with other players. The relationship between equilibrium strategies and network centrality measures are investigated in games where there is a common valuation of players as friends....