Alexis Poindron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexis Poindron has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Julio Aracena
CI2MA and Departamento de Ingeniería Matemática, Universidad de Concepción
2 shared publications - Katerin Vanessa de la Hoz Luna2 shared publications
- Lilian Salinas
Departamento de Ingeniería Informática y Ciencias de la Computación and CI2MA, Universidad de Concepción, Concepción, Chile
2 shared publications Didier Lebert
ENSTA, Unité d’Économie Appliquée, i3-CRG Ecole Polytechnique-CNRS (UMR 9217), Paris, France
1 shared publication- Lorraine Brisacier-Porchon
AFIS - CT3SAI,Orsay,France
1 shared publication - Nizar Allouch
School of Economics, University of Kent, Canterbury CT2 7NZ, UK
1 shared publication
Latest Publications
- Open Access
- 18 June 2026
- Published by Elsevier in SSRN Electronic Journal
Compatibility of unate Boolean functions via coverage vectors
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.
- 18 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCompatibility of unate Boolean functions via coverage vectors
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.
- Open Access
- 18 June 2026
- Published by Elsevier in SSRN Electronic Journal
Compatibility of unate Boolean functions via coverage vectors
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.
- 18 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCompatibility of unate Boolean functions via coverage vectors
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.
- Open Access
A Multisectoral Input-Output Analysis of the Economic Effects of Embargoes: Modeling Feedbacks and the Boomerang Effect
We propose a method for analyzing international-trade embargoes that incorporates the economic feedback effects on the initiating country - the so-called ‘boomerang effect’ - including both mechanical feedback mechanisms and retaliatory measures. Based on a multisectoral input-output framework, the model simulates several embargo configurations using 2020 OECD inter-industry and international data. The scenarios account for supply and demand flexibility, price adjustments, and third-country cooperation or defection. This approach, illustrated by fictitious scenarios involving France and Russia, allows us to assess the direct and indirect economic effects of embargoes and to derive policy recommendations depending on the scenario: enforcement, abstention, or coordinated diplomatic action.
Open AccessA Multisectoral Input-Output Analysis of the Economic Effects of Embargoes: Modeling Feedbacks and the Boomerang Effect
We propose a method for analyzing international-trade embargoes that incorporates the economic feedback effects on the initiating country - the so-called ‘boomerang effect’ - including both mechanical feedback mechanisms and retaliatory measures. Based on a multisectoral input-output framework, the model simulates several embargo configurations using 2020 OECD inter-industry and international data. The scenarios account for supply and demand flexibility, price adjustments, and third-country cooperation or defection. This approach, illustrated by fictitious scenarios involving France and Russia, allows us to assess the direct and indirect economic effects of embargoes and to derive policy recommendations depending on the scenario: enforcement, abstention, or coordinated diplomatic action.
- 28 July 2025
- Published by Springer Nature in Theory and Decision
- Vol. 99 (1-2) , 491-527
Structural interactions in global trade
- 28 July 2025
- Published by Springer Nature in Theory and Decision
- Vol. 99 (1-2) , 491-527
Structural interactions in global trade
- 8 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
On the Structuration and Composition of Decision Problems: A Systemic Approach to Rollbacks
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.
- 8 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
On the Structuration and Composition of Decision Problems: A Systemic Approach to Rollbacks
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.
- Open Access
A Model of Competing Gangs in Networks
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.
Open AccessA Model of Competing Gangs in Networks
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.
- 17 January 2024
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 142
The maximal coordination principle in regulatory Boolean networks
- 17 January 2024
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 142
The maximal coordination principle in regulatory Boolean networks