Computation of multi-facility location Nash equilibria on a network under quantity competition.

Abstract

We deal with the location-quantity problem for competing firms when they locate multiple facilities and offer the same type of product. Competition is performed under delivered quantities that are sent from the facilities to the customers. This problem is reduced to a location game when the competing firms deliver the Cournot equilibrium quantities. While existence conditions for a Nash equilibrium of the location game have been discussed in many contributions in the literature, computing an equilibrium on a network when multiple facilities are to be located by each firm is a problem not previously addressed. We propose an integer linear programming formulation to fill this gap. The formulation solves the profit maximization problem for a firm, assuming that the other firms have fixed their facility locations. This allows us to compute location Nash equilibria by the best response procedure. A study with data of Spanish municipalities under different scenarios is presented and conclusions are drawn from a sensitivity analysis.