Nash equilibria in location games on a network
From MaRDI portal
Publication:2014595
DOI10.1007/s00291-017-0472-4zbMath1375.90168OpenAlexW2582260681MaRDI QIDQ2014595
Blas Pelegrín, Mercedes Pelegrín
Publication date: 25 August 2017
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-017-0472-4
Mixed integer programming (90C11) Linear programming (90C05) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80) Auctions, bargaining, bidding and selling, and other market models (91B26) General equilibrium theory (91B50)
Related Items
Approximation of the competitive facility location problem with MIPs, Computation of multi-facility location Nash equilibria on a network under quantity competition
Uses Software
Cites Work
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Hotelling's duopoly on a tree
- Competitive location on networks under delivered pricing
- Location analysis: a synthesis and survey
- Isodistant points in competitive network facility location
- Finding all pure strategy Nash equilibria in a planar location game
- Locational equilibrium of two facilities on a tree
- Market and Locational Equilibrium for Two Competitors
- On Hotelling's "Stability in Competition"
- The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree
- Static competitive facility location: an overview of optimisation approaches.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item