In this paper, we examine the class of congestion games with player-specific payoff functions introduced by Milchtaich, I. (1996). Focusing on the special case of two resources, we give a short and simple method for identifying all Nash equilibria in pure strategies. We also provide a...

In hedonic games, coalitions are created as a result of the strategic interaction of independent players. In particular, in additively separable hedonic games, every player has valuations for all other ones, and the utility for belonging to a coalition is given by the sum of the valuations for...

The paper reports simulations applied on two similar congestion games: the first is the classical minority game. The second one is a asymmetric variation of the minority game with linear payoff functions. For each game simulation results based on an extended reinforcement algorithm are compared...

Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively)...

This paper provides a game-theoretic model of network formation with a continuous effort choice. Efforts are strategic complements for direct neighbors in the network and display global substitution/congestion effects. We show that if the parameter governing local strategic complements is larger...

This paper studies a non-cooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...