Arbib, C.Pınar, Mustafa Ç.Tonelli, M.2021-02-202021-02-202020-04-010377-2217http://hdl.handle.net/11693/75514Consider a three-level non-capacitated location/pricing problem: a firm first decides which facilities to open, out of a finite set of candidate sites, and sets service prices with the aim of revenue maximization; then a second firm makes the same decisions after checking competing offers; finally, customers make individual decisions trying to minimize costs that include both purchase and transportation. A restricted two-level problem can be defined to model an optimal reaction of the second firm to known decision of the first. For non-metric costs, the two-level problem corresponds to Envy-free Pricing or to a special Net- work Pricing problem, and is APX -complete even if facilities can be opened at no fixed cost. Our focus is on the metric 1-dimensional case, a model where customers are distributed on a main communica- tion road and transportation cost is proportional to distance. We describe polynomial-time algorithms that solve two- and three-level problems with opening costs and single 1 st level facility. Quite surpris- ingly, however, even the two-level problem with no opening costs becomes N P -hard when two 1 st level facilities are considered.EnglishPricingLocationSequential gamesMulti-level programmingComputational complexityArticle10.1016/j.ejor.2019.08.042