Modular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we give a uni_ed treatment of modular decomposition of...

Modular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. We propose an O(mn)-algorithm for the recognition of a modular set of a monotone Boolean function f with m prime implicants and n variables. Using...

Modular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. We propose an O(mn)-algorithm for the recognition of a modular set of a monotone Boolean function f with m prime implicants and n variables. Using...

In the widely used class of multidimensional poverty measures introduced by Alkire and Foster (2011), dimension-specific weights combined with a single cut-off parameter play a fundamental role in identifying who is multidimensionally poor. This paper revisits how these parameters are...

In the widely used class of multidimensional poverty measures introduced by Alkire and Foster (2011), dimension-specific weights combined with a single cut-off parameter play a fundamental role in identifying who is multidimensionally poor. This paper revisits how these parameters are...

We state an integer linear programming formulation for the unique characterization of complete simple games, i.e. a special subclass of monotone Boolean functions. In order to apply the parametric Barvinok algorithm to obtain enumeration formulas for these discrete objects we provide a tailored...