Modeling of the City’s Transport Network Using Game-Theoretic Methods on the Example of Petrozavodsk

Abstract

The paper presents the results of modeling of the city’s transport network. The effectiveness of the game-theoretic method for estimating the centrality of graph vertices using the Myerson value is demonstrated on the transport graph. Correspondences in the given graph are found with gravitational and entropy approaches, using the information about citizens and companies distributed by vertices in the graph. The results of computer calculations are represented on the transport network of the city of Petrozavodsk.