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

We investigate the cases when the Bonacich measures of strongly connected directed bipartite networks can be interpreted as a Nash equilibrium of a non-cooperative game. One such case is a two-person game such that the utility functions are bilinear, the matrices of these bilinear forms...

We study iterated formation of mutually best matches (IMB) in college admissions problems. When IMB produces a maximal individually rational matching, the matching has many good properties like Pareto optimality and stability. If preferences satisfy a single peakedness condition, or have a...

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