Title
Finding all pure strategy Nash equilibria in a planar location game.
Abstract
In this paper, we deal with a planar location-price game where firms first select their locations and then set delivered prices in order to maximize their profits. If firms set the equilibrium prices in the second stage, the game is reduced to a location game for which pure strategy Nash equilibria are studied assuming that the marginal delivered cost is proportional to the distance between the customer and the facility from which it is served. We present characterizations of local and global Nash equilibria. Then an algorithm is shown in order to find all possible Nash equilibrium pairs of locations. The minimization of the social cost leads to a Nash equilibrium. An example shows that there may exist multiple Nash equilibria which are not minimizers of the social cost. (C) 2011 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2011
10.1016/j.ejor.2011.04.003
European Journal of Operational Research
Keywords
Field
DocType
Location,Game theory,Nash equilibrium
Correlated equilibrium,Mathematical optimization,Mathematical economics,Risk dominance,Epsilon-equilibrium,Best response,Equilibrium selection,Normal-form game,Nash equilibrium,Folk theorem,Mathematics
Journal
Volume
Issue
ISSN
214
1
0377-2217
Citations 
PageRank 
References 
3
0.42
8
Authors
5
Name
Order
Citations
PageRank
José Miguel Díaz-Báñez119326.65
Marco A. Heredia2173.65
B. Pelegrín319818.15
Pablo Pérez-Lantero44717.76
Inmaculada Ventura510210.56