Computing an effective decision making group of a society using social network analysis

Recent years have witnessed how much a decision making group can be dysfunctional due to the extreme hyperpartisanship. While partisanship is crucial for the representatives to pursue the wishes of those whom they represent for, such an extremism results in a severe gridlock in the decision making progress, and makes themselves highly inefficient. It is known that such a problem can be mitigated by having negotiators in the group. This paper investigates the potential of social network analysis techniques to choose an effective leadership group of a society such that it suffers less from the extreme hyperpartisanship. We establish three essential requirements for an effective representative group, namely Influenceability, Partisanship, and Bipartisanship. Then, we formulate the problem of finding a minimum size representative group satisfying the three requirements as the minimum connected $$k$$ k -core dominating set problem (MC $$k$$ k CDSP), and show its NP-hardness. We introduce an extension of MC $$k$$ k CDSP, namely MC $$k$$ k CDSP-C, which assumes the society has a number of sub-communities and requires at least one representative from each sub-community should be in the leadership. We also propose an approximation algorithm for a subclass of MC $$k$$ k CDSP with $$k=2$$ k = 2 , and show an $$\alpha $$ α -approximation algorithm of MC $$k$$ k CDSP can be used to obtain an $$\alpha $$ α -approximation algorithm of MC $$k$$ k CDSP-SC.