Social optimality and cooperation in nonatomic congestion games. (Q1421898): Difference between revisions

Let \(G[c,f]\) be a nonatomic congestion game, where \(c\) denotes cost functions and \(f\) denotes a fixed-utility assignment. The paper shows the existence of a Nash equilibrium and a Pareto optimum of \(G[c,f]\), and gives a sufficient conditions for the equilibrium and the optimum to coincide. In the event that costs are logarithmic, the equilibrium payoff distribution of \(G[c,f]\) coincides with the Harsanyi value of the corresponding transferable utility game -- a remarkable result.