A Review of Games and Resource Allocation Algorithms Oriented Public Security

Abstract

It is important to study game algorithms and resource allocation strategies in the security field with the increasing number of unconventional emergencies, complexity and destructiveness. This paper introduces the current research status of game algorithms and resource allocation algorithms in the security field, analyzes the solution algorithms and models involved in detail, and evaluates the existing problems and application values objectively in order to play a certain reference role for similar research. At present, game algorithms in the security field are mainly divided into four categories: noncooperative games, cooperative games, complete information games, and incomplete information games. The most typical noncooperative game is Stackelberg game, Shapley value method is a common model solving algorithm in cooperative game. The complete information game uses the genetic algorithm to solve the event’s Nash equilibrium solution. The incomplete information game uses the Harsanyi transformation to transform the incomplete information into the probability distribution for the solution. Therefore, errors are indispensable when constructing game models. In resource allocation, the DEA model, ant colony algorithm and HTN-based planning method can be improved to improve the emergency capacity and reduce losses.