Compromise Solution In Economic Competition
Year: 2021
Type: conference-paper
Abstract: The idea arose to look at new approaches specifically to identify hidden societies, evaluate their effectiveness and explore the role of the results obtained in the economic field, that is, to address the problem of compromise using game theory. The idea behind the research is to apply a new set of methods to identify hidden communities, which are then presented to agents for their use. The agent, in turn, needs to choose an algorithm in such a way as to obtain maximum profit and minimum losses in competition in the economic resource market. In this paper, the main algorithm for identifying hidden communities is an algorithm based on modularity, in addition, the following algorithms are considered: The Bron-Kerbosch algorithm; The shortest open path algorithm; the Minimum covering tree search algorithm; the graph kernel search algorithm. For some algorithms, it is necessary to introduce some modification. This topic is important today, because with the help of a social network, hidden terrorist or fraudulent groups can be formed, which are subject to research and struggle in the future.
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W3203724809