CORNET

    Vendredi 14 novembre, 11h30 – Salle C057. Title: Multi-Agent Reinforcement Learning for Task Offloading in Wireless Edge Networks Abstract: In edge computing systems, autonomous agents must make rapid local decisions while competing for shared resources. Existing MARL approaches often rely on centralized critics or frequent inter-agent communication, which breaks down under limited observability and communication constraints. We propose a decentralized framework in which agents coordinate implicitly through a shared constraint on resource usage. This constraint is updated infrequently, requiring minimal communication, while each agent independently solves a local constrained Markov decision process (CMDP) to learn its behavior. Leveraging safe reinforcement learning, agents learn policies that satisfy both local and global objectives. We provide theoretical guarantees under mild assumptions and validate our approach experimentally, demonstrating superior performance to centralized and independent baselines, particularly in large-scale settings.

Nous avons le plaisir de vous inviter au séminaire de l’équipe CORNET, qui se tiendra le jeudi 5 juin à 11h35 en salle C057 (ancienne BU). À cette occasion, nous accueillerons Cléophée Robin, enseignante-chercheuse à l’IRIF, qui nous présentera ses travaux intitulés : _________________________________________________________ Clique-covering co-bridge-free prismatic graphs Résumé : A graph G is prismatic if for every triangle T of G, every vertex of G that is not in T, has exactly one neighbor in T. The complement of a prismatic graph is called antiprismatic. The complexity of the coloring problem when restricted to prismatic graphs is unknown. Hence, the complexity of the clique-covering problem on prismatic graphs is also unknown. Chudnovsky and Seymour gave a full structural description of prismatic graphs. They divided the class in two subclasses : the orientable prismatic graphs and the non-orientable prismatic graphs.  Preissman, Robin and Trotignon gave an algorithm to solve the clique problem in non-orientable prismatic graphs in polynomial time. We show this algorithm can also be used for prismatic graphs with no 2K_1 + C_4 (co-bridge), whether they are orientable or not. To achieve this, we show that this class of graphs admits a bounded number of disjoint triangles through Plus d'infos

Dans le cadre de séminaires de l’équipe CORNET,  nous aurons le plaisird’accueillir M Giuseppe DI MOLFETTA ce lundi 10/03 à 12h00  Salle 6 CERI Titre: Quantum Computing : a gentle introduction Résumé : A short, self-consistent one-hour seminar to introduce quantumcomputing and some simple applications in algorithmics in a non-formalway. No pre-requisites required, the presentation will cater for apotentially heterogeneous audience.

L’équipe CORNET démarre les séminaires 2025 la semaine prochaine avec une présentation de Rita SAFI, doctorante de CORNET et EDF, encadrée par Yezekael HAYEL et Tania JIMENEZ. Attention : ce séminaire aura lieu exceptionnellement un mercredi. Rendez-vous le mercredi 15 janvier à 11h35, en salle C057 (ancienne BU) :_________________________________________________________ Smart charging and optimization of personalized flexibility services for electric vehicles’s users. Rita SAFI, doctorante CORNET-LIA & EDF Résumé : The increasing number of electric vehicles (EVs) presents new challenges for charging point operators (CPOs) due to the increasing charging demand. However, it also creates opportunities to influence the flexibility of EV users. In this work, we consider a CPO that offers a price menu to EV users. Each option in the menu represents a pair of charging times to satisfy the EV charging demand and the corresponding charging price. The goal of the price menu is to encourage EV users to be flexible in their charging time. The price menu design problem can be formulated as a bilevel optimization problem in which the upper level determines the charging prices of the price menu and the optimal allocation of power among EVs to maximize the profit of the CPO, while the Plus d'infos