University of Twente Student Theses

Login

Efficiency and convergence of strategic two-sided facility location games on random graphs

Peeters, E.W.H. (2021) Efficiency and convergence of strategic two-sided facility location games on random graphs.

[img] PDF
1MB
Abstract:Location models are used to analyse and predict customer and company behaviour with regard to their location and attraction range. We look into location models that are represented by graphs. Existing algorithms can run simulations on the graphs that lead to an equilibrium state. In an equilibrium state, no single company can change their location without ending up with lower profits. It can be beneficial for companies to compute these equilibria, to gain insight in how their decisions will influence their profit in the equilibria. By implementing these algorithms into programming software, simulations can be ran using different input graphs. We look into the effect of different graph properties on the time complexity and efficiency of the algorithm. It shows that the distribution of the improvement step follows a normal distribution, and that the efficiency of the algorithm is maximum in the vast majority of the simulations. A low number of facilities and high edge density are beneficial for the time complexity of the algorithm, as they lower the number of improvement steps needed until an equilibrium is found.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:31 mathematics
Programme:Applied Mathematics BSc (56965)
Link to this item:http://purl.utwente.nl/essays/86772
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page