A polyhedral approach to the stability of a family of coalitions

Authors:
Néstor E. Aguilera;Mariana S. Escalante
Affiliations:
Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina and Universidad Nacional del Litoral, Argentina;Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina and Universidad Nacional de Rosario, Argentina
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 6
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Strongly balanced cooperative games

International Journal of Game Theory
Fractional kernals in digraphs

Journal of Combinatorial Theory Series B
Graph imperfection

Journal of Combinatorial Theory Series B
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Mathematics of Operations Research
Recognizing Berge Graphs

Combinatorica

Quantified Score

Hi-index	0.04

Visualization

Abstract

Using polyhedral combinatorics and graph theory results, we study unstable families of coalitions and analyze the effect of adding players or deleting coalitions in order to obtain a stable family. We also generalize the definitions and results to the case of fractional participation of players in coalitions.