Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network … (undirected two-terminal) network provides information about the existence of pure-strategy Nash equilibrium in the game. For some … network has at most three routes that do traverse any edge in opposite directions, or it consists of several such networks …

network formation. While the physics/applied mathematics approach is capable of reproducing most observed networks, it does …

network formation. While the physics/applied mathematics approach is capable of reproducing most observed networks, it does …

A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of … symmetric network we define a cooperative transferable utility game that measures the power of each coalition of positions in … the network. Applying the Shapley value to this game yields a network power measure, the beta-measure, which reflects the …

Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of … network formation: players announce independently the links they wish to form, and links are formed only under mutual consent …. We provide necessary and sufficient conditions on the network link marginal payoffs such that the set of pairwise stable …

We consider a model of an information network where nodes can fail and transmission of information is costly. The …