Naslov
Government Formation Problem

Autori
Jelić, Slobodan ; Ševerdija, Domagoj

Izvornik
Central European journal of operations research (1435-246X) 26 (2018); 659-672

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Government Formation Problem ; Team Formation Problem ; integer linear programming ; social network

Sažetak
Beside the same political and ideological attitudes, members of political parties can be interconnected on private and/or professional levels. We consider them as a part of one large social network. After the 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 about 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 social network, we present a Government Formation Problem (GFP). We prove that this problem is NP-hard and give an algorithm based on two integer linear programming formulations. In the experimental part we test our algorithm on simulated data using Gurobi MILP solver.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo

POVEZANOST RADA