Network games; Adaptations to Nash-Cournot equilibrium

We consider nonlinear flow problems involving noncooperative agents, all active in the same network. To find Nash equilibria, we develop an algorithm that lends itself to decentralized computation and parallel processing. The algorithm, which proceeds in terms of iterative strategy adjustments, is, in essence, of subgradient type. One advantage of that type is the ease with which stochastic and nonsmooth data can be accommodated.