60 citations · 112 across the 13 of their papers we have counts for
17 papers
Quantum Distance Calculation for -Graph Construction
Naomi Mona Chmielewski, Nina Amini, Paulin Jacquot +1
In machine learning and particularly in topological data analysis, -graphs are important tools but are generally hard to compute as the distance calculation between n points tak…
Random block coordinate methods for inconsistent convex optimisation problems
Mathias Staudigl, Paulin Jacquot
We develop a novel randomised block coordinate primal-dual algorithm for a class of non-smooth ill-posed convex programs. Lying in the midway between the celebrated Chambolle-Pock…
On the challenges of using D-Wave computers to sample Boltzmann Random Variables
Thomas Pochart, Paulin Jacquot, Joseph Mikael
Sampling random variables following a Boltzmann distribution is an NP-hard problem involved in various applications such as training of \textit{Boltzmann machines}, a specific kind…
Hierarchically constrained blackbox optimization
Stéphane Alarie, Charles Audet, Paulin Jacquot +1
In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated independently or sequential…
A privacy-preserving distributed computational approach for distributed locational marginal prices
Olivier Bilenne, Paulin Jacquot, Nadia Oudjane +3
An important issue in today's electricity markets is the management of flexibilities offered by new practices, such as smart home appliances or electric vehicles. By inducing chang…
DLMP-based Coordination Procedure for Decentralized Demand Response under Distribution Network Constraints
Paulin Jacquot
Load aggregators are independent private entities whose goal is to optimize energy consumption flexibilities offered by multiple residential consumers. Although aggregators optimiz…
Efficient Estimation of Equilibria in Large Aggregative Games with Coupling Constraints
Paulin Jacquot, Cheng Wan, Olivier Beaude +1
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 aggr…
A Privacy-preserving Method to Optimize Distributed Resource Allocation
Olivier Beaude, Pascal Benchimol, Stéphane Gaubert +2
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…
Nonatomic Aggregative Games with Infinitely Many Types
Paulin Jacquot, Cheng Wan
We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an…
A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy
Paulin Jacquot, Olivier Beaude, Pascal Benchimol +2
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 optimizing…
Peer-to-Peer Electricity Market Analysis: From Variational to Generalized Nash Equilibrium
Hélène Le Cadre, Paulin Jacquot, Cheng Wan +1
We consider a network of prosumers involved in peer-to-peer energy exchanges, with differentiation price preferences on the trades with their neighbors, and we analyze two market d…
Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players
Cheng Wan, Paulin Jacquot, Olivier Beaude +1
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…
Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players
Paulin Jacquot, Cheng Wan
After defining a pure-action profile in a nonatomic aggregative game, where players have specific compact convex pure-action sets and nonsmooth convex cost functions, as a square-i…
Routing Game on Parallel Networks: the Convergence of Atomic to Nonatomic
Paulin Jacquot, Cheng Wan
We consider an instance of a nonatomic routing game. We assume that the network is parallel, that is, constituted of only two nodes, an origin and a destination. We consider infini…
Analysis and Implementation of a Hourly Billing Mechanism for Demand Response Management
Paulin Jacquot, Olivier Beaude, Stéphane Gaubert +1
An important part of the Smart Grid literature on residential Demand Response deals with game-theoretic consumption models. Among those papers, the hourly billing model is of speci…
Demand Response in the Smart Grid: the Impact of Consumers Temporal Preferences
Paulin Jacquot, Olivier Beaude, Nadia Oudjane +1
In Demand Response programs, price incentives might not be sufficient to modify residential consumers load profile. Here, we consider that each consumer has a preferred profile and…
Demand Side Management in the Smart Grid: an Efficiency and Fairness Tradeoff
Paulin Jacquot, Olivier Beaude, Stéphane Gaubert +1
We compare two Demand Side Management (DSM) mechanisms, introduced respectively by Mohsenian-Rad et al (2010) and Baharlouei et al (2012), in terms of efficiency and fairness. Each…