Competitive location under proportional choice: 1-suboptimal points on networks

DOI10.7494/DMMS.2012.6.2.53MaRDI QIDQ2966342zbMATH OpenOpenAlexFDO

Authors Dominik Kress, Erwin Pesch

Publication date 6 March 2017

Published in Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/dmms.2012.6.2.53

zbMATH Keywords

discretizationcompetitive locationvoting locationcentroid problemvertex optimality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Voting theory (91B12) Discrete location and assignment (90B80)

Recommendations

• Competitive location and pricing on networks with random utilities
• scientific article; zbMATH DE number 4064727
• Sequential competitive location on networks
• On competitive sequential location in a network with a decreasing demand intensity
• Existence theory for spatially competitive network facility location models
• Location Games on Networks: Existence and Efficiency of Equilibria
• On Nash equilibria of a competitive location-design problem
• Computation of multi-facility location Nash equilibria on a network under quantity competition
• scientific article; zbMATH DE number 1128836
• Competitive location on networks under delivered pricing

Cited in

(2)

• Aggregation without loss of optimality in competitive location models
• scientific article; zbMATH DE number 4064727 (Why is no real title available?)

This page was built for publication: Competitive location under proportional choice: 1-suboptimal points on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966342)