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 条
  • [31] Computing Approximate Nash Equilibria in Polymatrix Games
    Deligkas, Argyrios
    Fearnley, John
    Savani, Rahul
    Spirakis, Paul
    WEB AND INTERNET ECONOMICS, 2014, 8877 : 58 - 71
  • [32] Computing nash equilibria: Approximation and smoothed complexity
    Chen, Xi
    Deng, Xiaotie
    Teng, Shang-Hua
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 603 - +
  • [33] Computing Approximate Nash Equilibria in Polymatrix Games
    Argyrios Deligkas
    John Fearnley
    Rahul Savani
    Paul Spirakis
    Algorithmica, 2017, 77 : 487 - 514
  • [34] Computing generalized Nash equilibria by polynomial programming
    Couzoudis, Eleftherios
    Renner, Philipp
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2013, 77 (03) : 459 - 472
  • [35] Computing Nash equilibria by iterated polymatrix approximation
    Govindan, S
    Wilson, R
    JOURNAL OF ECONOMIC DYNAMICS & CONTROL, 2004, 28 (07): : 1229 - 1241
  • [36] Nash equilibria in the Showcase Showdown game with unlimited spins
    Bayon, L.
    Ayuso, P. Fortuy
    Grau, J. M.
    Oller-Marcen, A. M.
    Ruiz, M. M.
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 497
  • [37] The structure and complexity of Nash equilibria for a selfish routing game
    Fotakis, D
    Kontogiannis, S
    Koutsoupias, E
    Mavronicolas, M
    Spirakis, P
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 123 - 134
  • [38] Mixed-strategy equilibria in the Nash Demand Game
    David A. Malueg
    Economic Theory, 2010, 44 : 243 - 270
  • [39] Optimality and complexity of pure Nash equilibria in the coverage game
    Ai, Xin
    Srinivasan, Vikram
    Tham, Chen-Khong
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (07) : 1170 - 1182
  • [40] The expected number of Nash equilibria of a normal form game
    McLennan, A
    ECONOMETRICA, 2005, 73 (01) : 141 - 174