Obtaining the Minimum Winning Coalition Through Fuzzy Subsets and Binary Integer Programming (BIP)

13 Pages Posted: 23 Aug 2010

See all articles by Julio Rojas-Mora

Julio Rojas-Mora

Universidad Católica de Temuco

Jaime Gil-Lafuente

University of Barcelona - Department of Business Economics and Organization

Rodrigo Acuna-Agost

Université d'Avignon - Laboratoire Informatique D'Avignon

Date Written: August 22, 2010

Abstract

This paper deals with the problem of obtaining the minimum winning coalition and its stability level. The construction of a coalition is modeled using fuzzy sets by taking into account the position of the members on a set of political subjects of interest. Fuzzy sets allow to consider the nuances and uncertainties that constitute political thinking, making it possible to calculate the distance from each member to all others. We present a binary integer programming (BIP) model to find the winning coalition that minimizes the sum of distances between all its members. Nonetheless, the average time needed to solve this BIP model grows exponentially with the size of the group. This is the reason a heuristic approach is presented to solve this problem. The method solves iteratively, several simplified BIP models based on the concept of alpha-cuts. Each iteration minimizes the aggregated distance between coalition members, while the stability value alpha is maximized. The algorithm stops when a minimum winning coalition is found with the highest possible stability. The solution is then improved by a local search procedure that reaches the optimal solution in close to 90% of the simulated cases. The experimental results over these cases show that the heuristic method gives an excellent balance between speed and quality, obtaining, in average, solutions within 1% from the optimum.

Keywords: Coalition formation, fuzzy sets, distance, binary integer programming (BIP), local search

JEL Classification: D71, D20, D72

Suggested Citation

Rojas-Mora, Julio and Gil-Lafuente, Jaime and Acuna-Agost, Rodrigo, Obtaining the Minimum Winning Coalition Through Fuzzy Subsets and Binary Integer Programming (BIP) (August 22, 2010). Available at SSRN: https://ssrn.com/abstract=1663324 or http://dx.doi.org/10.2139/ssrn.1663324

Julio Rojas-Mora (Contact Author)

Universidad Católica de Temuco ( email )

Rudecindo Ortega 02950
Dpt. of Informatics Engineering
Temuco, 4781312
Chile

HOME PAGE: http://https://www.s3e2.cl

Jaime Gil-Lafuente

University of Barcelona - Department of Business Economics and Organization ( email )

Edificio Principal, Torre 2 - 3a planta
Av. Diagonal, 690
Barcelona, 08034
Spain

Rodrigo Acuna-Agost

Université d'Avignon - Laboratoire Informatique D'Avignon ( email )

339, chemin des Meinajaries
Agroparc BP 91228
Avignon Cedex 9, 84911
France

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
76
Abstract Views
1,213
Rank
567,594
PlumX Metrics