Sequential Competitive Facility Location In Continuous Geometric Space

Please enable javascript in your browser.

Lavasani, Ali Mohammad | 2018

731 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 51204 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Abam, Mohammad Ali
Abstract:
Abstract The problem of competetive facility location can be defined as follows: There are a number of customers in the form of points in space, and two players arrange a number of facilities in the form of points in space, given some limitations, respectively. Each customer’s connection to each facility has a cost for the customer and an advantage for the facility, and each customer wants to be connected to at most one of the facilities which has the lowest cost for him. The goal is to find the strategy of placing the facilities and determining the cost which the facility receives from the customer, in such a way that the player’s profit is maximised.In this thesis, we first sought to resolve this version of the problem: each customer is connected to the closest facility and has a steady profit for the players. The first player places his facility on the page so that if the second player chooses anywhere else from the page, earns less than the first player. In the process of solving, we find the problem of finding a convex polygon of maximum weight, although it is not related to the title of the thesis, but it is important in terms of theoretical and practical value
Keywords:
Computational Geometry ; Geometric Space ; Plurality Point ; Competitive Facility Location