Paulin Jacquot

Paulin Jacquot

Auto-generated profile, based on publicly available information

Paulin Jacquot

GERAD research center Polytechnique Montréal Montréal Canada

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
OBOlivier Beaude
Olivier Beaude
PBPascal Benchimol
Pascal Benchimol
SGStéphane Gaubert
Stéphane Gaubert
PJPaulin Jacquot
Paulin Jacquot
NONadia Oudjane
Nadia Oudjane
We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly nonconvex, cost while satisfying the agents' constraints, for instance, an energy operator in charge of the management of energy consumption flexibilities of many individual consumers. We provide a privacy-preserving algorithm that computes the optimal allocation of resources, and in which each agent's private information (constraints and individual solution profile) is never revealed either to the central operator or to a third party. Our method relies on an aggregation procedure: we compute iteratively a global allocation of resources, and gradually ensure existence of a disaggregation, that is, individual profiles satisfying agents' private constraints, by a protocol involving the generation of polyhedral cuts and secure multiparty computations. To obtain these cuts, we use an alternate projection method, which is implemented locally by each agent, preserving her privacy needs. We address especially the case in which the local and global constraints define a transportation polytope. Then, we provide theoretical convergence estimates together with numerical results, showing that the algorithm can be effectively used to solve the allocation problem in high dimension, while addressing privacy issues.

1 September 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
PJPaulin Jacquot
Paulin Jacquot
CWCheng Wan
Cheng Wan

1 December 2019
Verified
Conference Paper
Open access
PJPaulin Jacquot
Paulin Jacquot
OBOlivier Beaude
Olivier Beaude
PBPascal Benchimol
Pascal Benchimol
SGStephane Gaubert
Stephane Gaubert
NONadia Oudjane
Nadia Oudjane
We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly non-convex, cost while satisfying the agents’ constraints. We focus on the practical case of the management of energy consumption flexibilities by the operator of a mi-crogrid. This paper provides a privacy-preserving algorithm that does compute the optimal allocation of resources, avoiding each agent to reveal her private information (constraints and individual solution profile) neither to the central operator nor to a third party. Our method relies on an aggregation procedure: we maintain a global allocation of resources, and gradually disaggregate this allocation to enforce the satisfaction of private constraints, by a protocol involving the generation of polyhedral cuts and secure multiparty computations (SMC). To obtain these cuts, we use an alternate projections method à la Von Neumann, which is implemented locally by each agent, preserving her privacy needs. Our theoretical and numerical results show that the method scales well as the number of agents gets large, and thus can be used to solve the allocation problem in high dimension, while addressing privacy issues.

13 July 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
PJPaulin Jacquot
Paulin Jacquot
CWCheng Wan
Cheng Wan
OBOlivier Beaude
Olivier Beaude
NONadia Oudjane
Nadia Oudjane
Aggregative games have many industrial applications, and computing an equilibrium in those games is challenging when the number of players is large. In the framework of atomic aggregative games with coupling constraints, we show that variational Nash equilibria of a large aggregative game can be approximated by a Wardrop equilibrium of an auxiliary population game of smaller dimension. Each population of this auxiliary game corresponds to a group of atomic players of the initial large game. This approach enables an efficient computation of an approximated equilibrium, as the variational inequality characterizing the Wardrop equilibrium is of smaller dimension than the initial one. This is illustrated on an example in the smart grid context.

6 November 2023 in Fixed Point Theory and Algorithms for Sciences and Engineering
Verified
Journal Article
Open access
PDF file
MSMathias Staudigl
Mathias Staudigl
PJPaulin Jacquot
Paulin Jacquot
We develop a novel randomised block-coordinate primal-dual algorithm for a class of non-smooth ill-posed convex programs. Lying midway between the celebrated Chambolle–Pock primal-dual algorithm and Tseng’s accelerated proximal gradient method, we establish global convergence of the last iterate as well as optimal $O(1/k)$ O ( 1 / k ) and $O(1/k^{2})$ O ( 1 / k 2 ) complexity rates in the convex and strongly convex case, respectively, k being the iteration count. Motivated by the increased complexity in the control of distribution-level electric-power systems, we test the performance of our method on a second-order cone relaxation of an AC-OPF problem. Distributed control is achieved via the distributed locational marginal prices (DLMPs), which are obtained as dual variables in our optimisation framework.

25 October 2018 in HAL
Verified
Preprint
Open access
PDF file
CWCheng Wan
Cheng Wan
PJPaulin Jacquot
Paulin Jacquot
OBOlivier Beaude
Olivier Beaude
NONadia Oudjane
Nadia Oudjane
Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work, we analyze the case of generalized atomic congestion games, with coupling constraints, and with players that are heterogeneous through their action sets and their utility functions. We obtain an approximation of the variational Nash equilibria-a notion generalizing Nash equilibria in the presence of coupling constraints-of a large atomic congestion game by an equilibrium of an auxiliary population game, where each population corresponds to a group of atomic players of the initial game. Because the variational inequalities characterizing the equilibrium of the auxiliary game have smaller dimension than the original problem, this approach enables the fast computation of an estimation of equilibria in a large congestion game with thousands of heterogeneous players.