haku: @indexterm GAME THEORY / yhteensä: 415
viite: 239 / 415
Tekijä: | Kolstad, C. D. Mathiesen, L. |
Otsikko: | Computing Cournot-Nash equilibria. |
Lehti: | Operations Research
1991 : SEP-OCT, VOL. 39:5, p. 739-748 |
Asiasana: | GAME THEORY EQUILIBRIUM ANALYSIS OLIGOPOLY ALGORITHMS |
Kieli: | eng |
Tiivistelmä: | The basic purpose of the paper is to formalize a commonly used algorithm for finding Cournot-Nash equilibria and demonstrate conditions for global convergence of the algorithm. The method is based on formulating the equilibrium as that of finding a solution to a non-linear complementary problem. A major result is that if marginal profits are concave and the Jacobian of marginal profits has a negative dominant diagonal with unitary scales, then the algorithm is assured to converge from any feasible starting point. Within this context, three generic classes of markets are examined: homogeneous product, segmented markets; and differentiated products. |
SCIMA