5 papers
Strong aggregation of the Markov chains associated with matching models based on the automorphism group of their compatibility graphs
Moyi Yang, Jean-Michel Fourneau
We extend the analysis of strong aggregation to general compatibility graphs, focusing on item counts rather than positions, and exploring generalized greedy matching disciplines.…
Sender and Receiver Energy Consumption in a Sensor Network
J M Fourneau, F. Quessette
We consider a new type of model with energy packets and data packets where the transmission of a data packet requires energy on both the sender and the receiver nodes. Energy packe…
Efficient Solving of Large Single Input Superstate Decomposable Markovian Decision Process
Youssef Ait El Mahjoub, Jean-Michel Fourneau, Salma Alouah
Solving Markov Decision Processes (MDPs) remains a central challenge in sequential decision-making, especially when dealing with large state spaces and long-term optimization crite…
A slot-based energy storage decision-making approach for optimal Off-Grid telecommunication operator
Youssef Ait El Mahjoub, Jean-Michel Fourneau
This paper proposes a slot-based energy storage approach for decision-making in the context of an Off-Grid telecommunication operator. We consider network systems powered by solar…
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…