Compromise Solution In Economic Competition

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.

The article is not prepared yet for the html view. Check back soon.

Copyright information

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

About this article

Cite this paper as:

Click here to view the available options for cite this article.

Publisher

European Publisher

First Online

25.09.2021

Doi

10.15405/epsbs.2021.09.02.190

Online ISSN

2357-1330