We present a model for the dynamics of networks in which edges represent positions in organizations, holders of which are connected to each other when the positions belong to the same organization. Once a vacancy is opened, the new employee can be hired from the current network. In particular,...

We study axiomatically recursive clustering methods for networks. Such methods can be used to identify community structures of a network. One of the methods is based on identifying a node subset that maximizes the average degree within this subset. Once such a subset is found, the method is...

We give a proof of the existence of a Nash equilibrium forn-personnormal form games when each player's utility function is continuousw.r.t. strategy profiles, and concave and differentiable w.r.t. his ownstrategy. The proof uses only elementary mathematical tools such asmathematical induction....

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