@inproceedings{51c126dc5452462e8ec70949612f3bd6,
title = "Upper bound for the competitive facility location problem with quantile criterion",
abstract = "In this paper, we consider a competitive location problem in a form of Stackelberg game. Two parties open facilities with the goal to capture customers and maximize own profits. One of the parties, called Leader, opens facilities first. The set of customers is specified after Leader{\textquoteright}s turn with random realization of one of possible scenarios. Leader{\textquoteright}s goal is to maximize the profit guaranteed with given probability or reliability level provided that the second party, called Follower, acts rationally in each of the scenarios. We suggest an estimating problem to obtain an upper bound for Leader{\textquoteright}s objective function and compare the performance of estimating problem reformulations experimentally.",
keywords = "Competitive location, Reformulation, Stackelberg game, Upper bound",
author = "Andrey Melnikov and Vladimir Beresnev",
year = "2016",
doi = "10.1007/978-3-319-44914-2_30",
language = "English",
isbn = "9783319449135",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "373--387",
editor = "Michael Khachay and Panos Pardalos and Yury Kochetov and Vladimir Beresnev and Evgeni Nurminski",
booktitle = "Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings",
address = "Germany",
note = "9th International Conference on Discrete Optimization and Operations Research, DOOR 2016 ; Conference date: 19-09-2016 Through 23-09-2016",
}