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 条
  • [41] Mixed-strategy equilibria in the Nash Demand Game
    Malueg, David A.
    ECONOMIC THEORY, 2010, 44 (02) : 243 - 270
  • [42] Uniqueness of Nash equilibria in a quantum Cournot duopoly game
    Sekiguchi, Yohei
    Sakahara, Kiri
    Sato, Takashi
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2010, 43 (14)
  • [43] On Nash equilibria in Eisert-Lewenstein-Wilkens game
    Bolonek-Lason, Katarzyna
    Kosinski, Piotr
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2015, 13 (08)
  • [44] THE SET OF NASH EQUILIBRIA OF A SUPERMODULAR GAME IS A COMPLETE LATTICE
    ZHOU, L
    GAMES AND ECONOMIC BEHAVIOR, 1994, 7 (02) : 295 - 300
  • [45] The structure and complexity of Nash equilibria for a selfish routing game
    Fotakis, Dimitris
    Kontogiannis, Spyros
    Koutsoupias, Elias
    Mavronicolas, Marios
    Spirakis, Paul
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (36) : 3305 - 3326
  • [46] On Nash Equilibria in a Finite Game for Fuzzy Sets of Strategies
    Bekesiene, Svajone
    Mashchenko, Serhii
    MATHEMATICS, 2023, 11 (22)
  • [47] On the existence of Nash equilibria in an asymmetric tax competition game
    Taugourdeau, Emmanuelle
    Ziad, Abderrahmane
    REGIONAL SCIENCE AND URBAN ECONOMICS, 2011, 41 (05) : 439 - 445
  • [48] On Nash equilibria of a competitive location-design problem
    Saiz, M. Elena
    Hendrix, Eligius M. T.
    Pelegrin, Blas
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) : 588 - 593
  • [49] PyBNEq - A Tool for Computing Bayes-Nash Equilibria
    Joldes, I.
    Parv, B.
    Parpucea, I.
    Lupse, V.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2013, 8 (04) : 571 - 577
  • [50] Computing approximate Nash equilibria in network congestion games
    Feldmann, Andreas Emil
    Roeglin, Heiko
    Voecking, Berthold
    NETWORKS, 2012, 59 (04) : 380 - 386