Volume 21, No 4, 2014, P. 62-79

UDC 519.87
A. A. Melnikov
Computational complexity of the discrete competitive facility location problem

We consider the discrete competitive facility location problem where a finite set of clients and a finite set of candidate sites are given. Two competing firms successively open their facilities with the goal to maximize the profit from serving the clients. Each client chooses only one facility to be served by according to his known preferences. We determine the computational complexity of the problem in two special cases.
Bibliogr. 16.

Keywords: polynomial hierarchy, Stackelberg game, bilevel programming.

Mel’nikov Andrey Andreevich 1,2
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: a.a.melnikov@hotmail.com

 © Sobolev Institute of Mathematics, 2015