共 50 条
Methods for computing Nash equilibria of a location-quantity game
被引:9
|作者:
Saiz, M. Elena
[1
]
Hendrix, Eligius M. T.
[1
]
机构:
[1] Wageningen Univ, NL-6706 KN Wageningen, Netherlands
关键词:
iterative algorithms;
networks;
discrete location;
spatial models;
competition;
oligopoly;
n-person games n > 2;
D O I:
10.1016/j.cor.2007.02.022
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
A two-stage model is described where firms take decisions on where to locate their facility and on how much to supply to which market. In such models in literature, typically the market price reacts linearly on supply. Often two competing suppliers are assumed or several that are homogeneous, i.e., their cost structure is assumed to be identical. The focus of this paper is oil developing methods to compute equilibria of the model where more than two suppliers are competing that each have their own cost structure, i.e., they are heterogeneous. Analytical results are presented with respect to optimality conditions for the Nash equilibria in the two stages. Based on these analytical results, an enumeration algorithm and a local search algorithm are developed to find equilibria. Numerical cases are used to illustrate the results and the viability of the algorithms. The methods find an improvement of a result reported in literature. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3311 / 3330
页数:20
相关论文