Skip to main content
Log in

Government Formation Problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In addition to the same political and ideological attitudes, members of political parties can be interconnected at private and/or professional levels. They are considered as a part of one large social network. After democratic elections, the total effectiveness and stability of a government may depend on expertness and cooperability of its members. Our main goal is not to give a mechanism for pre-elective government formation, but to propose a model that decides what can be a good subset of candidates for positions in the new government. The decision is based on expertness of candidates and their interconnections in the social network. Inspired by the Team Formation Problem in a social network, we present a Government Formation Problem. We prove that this problem is NP-hard and give an algorithm based on integer linear programming formulation. In the experimental part, we test our algorithm on simulated data using the Gurobi MILP solver.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Note that we are using the same edge notation for both undirected and directed graphs for the sake of simplicity, i.e. usually edge (uv) in an undirected graph is written as \(\{u,v\}\), which complies with its definition for undirected graphs.

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Domagoj Ševerdija.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jelić, S., Ševerdija, D. Government Formation Problem. Cent Eur J Oper Res 26, 659–672 (2018). https://doi.org/10.1007/s10100-017-0505-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-017-0505-8

Keywords

Navigation