Maximizing Payoff in Competitive Facility Location

Please enable javascript in your browser.

Jafari Giv, Mehrdad | 2015

807 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 47544 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Zarrabi Zadeh, Hamid
Abstract:
In the competitive facility location problem, two service providers fight over winning consumers by establishing a series of well-located facilities on the line. The consumers seek their required services from the facility which is closest to them. The order in which service providers locate and build their facilities is as follows: the first service provider establishes k facilities after which the second service provider locates another k facilities and this goes on for m rounds. The payoff of each service provider equals the number of consumers that choose that provider’s facilities to seek service from. In this dissertation, we address different types of this problem and try to analyze the facility location problem combinatorially. Furthermore we present algorithms to find the optimal placement of each service provider’s facilities
Keywords:
Facility Location Model ; Computational Geometry ; Voronoi Game ; Winning Strategy