Network design with weighted players (Q733733)

The paper contributes to the network design methods treated by means of tools of the algorithmic games. Selfish players select paths in a network, minimizing their costs which are specified in accordance with Shapley cost shares. For the game with identical players, the cost share incurred by a player for an edge is the fixed cost for each of them. The main results specify the approximation of Nash equilibria, analyze their properties and prove their existence.