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
相关论文
共 50 条
  • [1] Computing Nash equilibria based on heuristic search methods
    School of Sciences, Beijing Jiaotong University, Beijing 100044, China
    Beijing Jiaotong Daxue Xuebao, 2007, 3 (58-62):
  • [2] Computing Nash equilibria through computational intelligence methods
    Pavlidis, NG
    Parsopoulos, KE
    Vrahatis, MN
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2005, 175 (01) : 113 - 136
  • [3] Finding all pure strategy Nash equilibria in a planar location game
    Diaz-Banez, J. M.
    Heredia, M.
    Pelegrin, B.
    Perez-Lantero, P.
    Ventura, I.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 214 (01) : 91 - 98
  • [4] Nash equilibria and a subjective game
    Nakai, Teruhisa
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2012, 33 (01): : 89 - 102
  • [5] GAME DYNAMICS AND NASH EQUILIBRIA
    Viossat, Yannick
    JOURNAL OF DYNAMICS AND GAMES, 2014, 1 (03): : 537 - 553
  • [6] Computation of Multi-facility Location Nash Equilibria on a Network Under Quantity Competition
    Pelegrin, Blas
    Fernandez, Pascual
    Dolores Garcia, Maria
    NETWORKS & SPATIAL ECONOMICS, 2018, 18 (04): : 999 - 1017
  • [7] Computation of Multi-facility Location Nash Equilibria on a Network Under Quantity Competition
    Blas Pelegrín
    Pascual Fernández
    María Dolores García
    Networks and Spatial Economics, 2018, 18 : 999 - 1017
  • [8] Efficient Differentiable Path-Following Methods for Computing Nash Equilibria
    Cao, Yiyin
    Dang, Chuangyin
    Yu, Yixiong
    COMPUTATIONAL ECONOMICS, 2025,
  • [9] On Nash Equilibria for a Network Creation Game
    Albers, Susanne
    Eilts, Stefan
    Even-Dar, Eyal
    Mansour, Yishay
    Roditty, Liam
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 89 - 98
  • [10] On Nash equilibria for a network creation game
    Albers, Susanne (albers@informatik.hu-berlin.de), 1600, Association for Computing Machinery (02):