3 papers
cs.GT2020
Flexibility can hurt dynamic matching system performance
Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau +1
We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities…
stat.AP2019
The power disaggregation algorithms and their applications to demand dispatch
Arnaud Cadas, Ana Busic
We were interested in solving a power disaggregation problem which comes down to estimating the power consumption of each device given the total power consumption of the whole hous…
cs.DM2018
Optimal Control of Dynamic Bipartite Matching Models
Arnaud Cadas, Ana Bušić, Josu Doncel
A dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply…