Two groups produce a network good perceived by a third party, such as a police or military institution, as a ‘public bad’, referred to as ‘crime’ for simplicity. These two groups, considered mafias, are assumed to be antagonists, whether they are enemies or competitors in the same market, causing harm to each other’s activities. This paper provides guidelines for the policymaker, typically the police, seeking to minimize overall crime levels by internalizing these negative externalities. One specific question is investigated: the allocation of resources for the police. In general, we recommend a balanced crackdown on both antagonists, but an imbalance in group sizes may lead the police to focus on the more criminal group.
In Boolean models of gene regulatory networks, each regulator acts as an activator or a repressor, a structure captured by unate Boolean functions. Determining whether a unate Boolean function is compatible with a set of binary observations is NP-complete. We address this problem through a combinatorial formulation built on two concepts: the multiset of discrepancies, which encodes how positive and negative observations differ, and the coverage vector, which represents a way to resolve those differences. We prove that the existence of a coverage vector is necessary and sufficient for the existence of a compatible unate function, and we characterize the full set of compatible functions as an interval between two explicit bounds. Building on these results, we develop a greedy randomized algorithm that constructs coverage vectors and scales to instances with several thousand variables. Experiments on synthetic data show that recovery of the true signed support depends primarily on the ratio between active and total variables, and that an optional sparsity bound improves both recall and precision. A case study on the Drosophila ventral furrow Boolean network confirms the applicability of the method to gene regulatory networks under sparse biological observations.
Following Maier principles, system of systems are composed of constituent systems that exhibit together emergent behaviors which cannot be exposed using individually the constituent systems. All constituent systems chosen to realize emergent behaviors are themselves composed of thousands of system elements, which were selected also as a result of decision processes. However, decision making based on specific criteria and decision gates in ISO/IEC 15288:2023 is based on management assumptions rather than formal mathematical formulations. The present paper proposes a mathematical formulation of decision aid composition in systems of systems. Based on the observation that state-of-the-art in decision aid applied mathematics domain could be tackled with system engineering process. Using decision aid, we expose the big picture in architecture selection as a composition of decisions. Through a simple example of a choice to introduce a new technology in an existing air-defence system-ofsystem, a sketch of a decision algebra in system-of-system design holds keys to validation of GO/No GO with quantifyable interests of multiple external stakeholders. Our definitions and axioms are presented as a solid foundation for shaping design spaces in systems with respect to dedicated large industrial consortiums.
In Boolean models of gene regulatory networks, each regulator acts as an activator or a repressor, a structure captured by unate Boolean functions. Determining whether a unate Boolean function is compatible with a set of binary observations is NP-complete. We address this problem through a combinatorial formulation built on two concepts: the multiset of discrepancies, which encodes how positive and negative observations differ, and the coverage vector, which represents a way to resolve those differences. We prove that the existence of a coverage vector is necessary and sufficient for the existence of a compatible unate function, and we characterize the full set of compatible functions as an interval between two explicit bounds. Building on these results, we develop a greedy randomized algorithm that constructs coverage vectors and scales to instances with several thousand variables. Experiments on synthetic data show that recovery of the true signed support depends primarily on the ratio between active and total variables, and that an optional sparsity bound improves both recall and precision. A case study on the Drosophila ventral furrow Boolean network confirms the applicability of the method to gene regulatory networks under sparse biological observations.